default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Mikula
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Jan Mikula
, Miroslav Kulich:
Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions. SN Comput. Sci. 5(2): 262 (2024)- [c7]Jan Blaha, Jan Mikula, Tomás Vintr, Jirí Janota, Jirí Ulrich, Tomás Roucek, Fatemeh Rekabi Bana, Laurenz Alexander Fedotoff, Martin Stefanec, Thomas Schmickl, Farshad Arvin, Miroslav Kulich, Tomás Krajník:
Effective Searching for the Honeybee Queen in a Living Colony. CASE 2024: 3675-3682 - [c6]Jan Blaha, Tomás Vintr, Jan Mikula, Jirí Janota, Tomás Roucek, Jirí Ulrich, Fatemeh Rekabi Bana, Laurenz Alexander Fedotoff, Martin Stefanec, Thomas Schmickl, Farshad Arvin, Miroslav Kulich, Tomás Krajník:
Toward Perpetual Occlusion-Aware Observation of Comb States in Living Honeybee Colonies. IROS 2024: 5948-5955 - [c5]Jan Mikula, Miroslav Kulich, Libor Preucil:
TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments. IROS 2024: 10503-10510 - [i2]Jan Mikula, Miroslav Kulich, Libor Preucil:
TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments. CoRR abs/2410.08752 (2024) - [i1]Jan Mikula, Miroslav Kulich:
Hybrid Filtering Heuristic for the Sensor-Placement Problem to Discretize 2D Continuous Environments. CoRR abs/2410.08784 (2024) - 2023
- [c4]Viktor Kozák, Jan Mikula, Lukás Bertl, Karel Kosnar, Libor Preucil:
Towards Visual Classification Under Class Ambiguity. ICRA 2023: 7032-7038 - 2022
- [j2]Jan Mikula, Miroslav Kulich:
Solving the traveling delivery person problem with limited computational time. Central Eur. J. Oper. Res. 30(4): 1451-1481 (2022) - [j1]Jan Mikula, Miroslav Kulich:
Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes. IEEE Robotics Autom. Lett. 7(3): 5934-5941 (2022) - [c3]Miroslav Kulich, Jan Vidasic, Jan Mikula:
On the Travelling Salesman Problem with Neighborhoods in a Polygonal World. CLAWAR 2022: 334-345 - [c2]Jan Mikula, Miroslav Kulich:
Triangular Expansion Revisited: Which Triangulation Is The Best? ICINCO 2022: 313-319 - [c1]David Zahrádka, Jan Mikula, Miroslav Kulich:
A Metaheuristic Approach for Inspection and Reconnaissance of Organized Areas. MESAS 2022: 44-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
