Get started
Author

Jaroslav Opatrný

Observed names: J Opatrny, J. OPATRNY, J. Opatrny, J. Opatrný, JAROSLAV OPATRNY, Jaroslav Opatrny, Opatrny, J., Opatrny, Jaroslav
Observed institutions: Université Paris-Sud, Rutgers, The State University of New Jersey, Natural Sciences and Engineering Research Council of Canada, Centre National de la Recherche Scientifique, University of Waterloo, Engineering Research & Analysis (United States), Max Planck Institute for Informatics, Laboratoire de Recherche en Informatique, Concordia University
ORCID: 0000-0001-6149-003X
Observed ORCID: 0000-0001-6149-003X
OpenAlex ID: A5012902253
Total Ordering Problem
1979 · J. Opatrny · SIAM Journal on Computing · 172
Robust position‐based routing in wireless ad hoc networks with irregular transmission ranges
2003 · Lali Barrière, Pierre Fraigniaud, et al. · Wireless Communications and Mobile Computing · 116
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
2009 · J. Czyzowicz, E. Kranakis, et al. · Lecture notes in computer science · 86
PDF
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
2010 · Jurek Czyzowicz, Evangelos Kranakis, et al. · Lecture notes in computer science · 64
PDF
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
2008 · Shahab Kamali, Jaroslav Opatrny · Journal of Networks · 64
POSANT: A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
2007 · Shahab Kamali, Jaroslav Opatrny · International Conference on Wireless and Mobile Communications · 62
Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks.
2005 · George Kao, Thomas Fevens, et al. · 60
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
2000 · J Opatrny, D Sotteau · Discrete Applied Mathematics · 59
PDF
Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares
2015 · J. Czyzowicz, E. Kranakis, et al. · Lecture notes in computer science · 56
Minimizing the number of sensors moved on line barriers
2011 · Mona Mehrandish, Lata Narayanan, et al. · IEEE Wireless Communications and Networking Conference · 51
Complexity of barrier coverage with relocatable sensors in the plane
2015 · Stefan Dobrev, Stephane Durocher, et al. · Theoretical Computer Science · 50
PDF
High delivery rate position-based routing algorithms for 3D ad hoc networks
2007 · A.E. Abdallah, T. Fevens, et al. · Computer Communications · 42
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph
2006 · Edgar Chavez, Stefan Dobrev, et al. · Lecture notes in computer science · 40
Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks
2006 · A.E. Abdallah, T. Fevens, et al. · 37
All-to-All Optical Routing in Chordal Rings of Degree 4
2001 · L. Narayanan, J. Opatrny, et al. · Algorithmica · 37
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
2015 · J. Czyzowicz, K. Georgiou, et al. · Lecture notes in computer science · 36
Search on a Line with Faulty Robots
2016 · Jurek Czyzowicz, Evangelos Kranakis, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 34
Search on a Line by Byzantine Robots
2016 · Czyzowicz, Jurek, Georgiou, Konstantinos, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 32
PDF
Search on a line with faulty robots
2017 · Jurek Czyzowicz, Evangelos Kranakis, et al. · Distributed Computing · 31
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
2008 · J. Czyzowicz, S. Dobrev, et al. · Springer eBooks · 31
Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks
2007 · A. E. Abdallah, T. Fevens, et al. · International Conference on Communications · 31
Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks
2009 · A.E. Abdallah, T. Fevens, et al. · Ad Hoc Networks · 30
Expected sum and maximum of displacement of random sensors for coverage of a domain
2013 · Evangelos Kranakis, Danny Krizanc, et al. · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 27
Network Properties of Double and Triple Fixed Step Graphs
1998 · A. L. LIESTMAN, J. OPATRNY, et al. · International Journal of Foundations of Computer Science · 27
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
2004 · Paul Boone, Edgar Chavez, et al. · Lecture notes in computer science · 26
Works count: 141
Citation count: 2,109
H-index: 25
I10-index: 58
Year
Topic
Type