Jaroslav Opatrny

Orcid: 0000-0001-6149-003X

Affiliations:
  • Concordia University, Montreal, Canada


According to our database1, Jaroslav Opatrny authored at least 99 papers between 1974 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploration of High-Dimensional Grids by Finite State Machines.
Algorithmica, May, 2024

The En Route Truck-Drone Delivery Problem.
CoRR, 2024

2021
On synchronization and orientation in distributed barrier coverage with relocatable sensors.
Theor. Comput. Sci., 2021

Time-energy tradeoffs for evacuation by two robots in the wireless model.
Theor. Comput. Sci., 2021

Search on a Line by Byzantine Robots.
Int. J. Found. Comput. Sci., 2021

The Bike Sharing Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Graph Exploration by Energy-Sharing Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2021

Group Evacuation on a Line by Agents with Different Communication Abilities.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Priority evacuation from a disk: The case of <i>n</i> ≥ 4.
Theor. Comput. Sci., 2020

Priority evacuation from a disk: The case of <i>n</i> = 1, 2, 3.
Theor. Comput. Sci., 2020

Evacuating Robots from a Disk Using Face-to-Face Communication.
Discret. Math. Theor. Comput. Sci., 2020

Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
Discret. Appl. Math., 2020

Evacuating equilateral triangles and squares in the face-to-face model.
Comput. Geom., 2020

Weak Coverage of a Rectangular Barrier.
Algorithmica, 2020

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Search on a line with faulty robots.
Distributed Comput., 2019

Distributed Pattern Formation in a Ring.
Proceedings of the Structural Information and Communication Complexity, 2019

Exploration of High-Dimensional Grids by Finite Automata.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Energy Consumption of Group Search on a Line.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range.
Proceedings of the Algorithms for Sensor Systems, 2019

2018
Priority Evacuation from a Disk Using Mobile Robots.
CoRR, 2018

Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2018

Satisfying Neighbor Preferences on a Circle.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

God Save the Queen.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Evacuating an Equilateral Triangle in the Face-to-Face Model.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Weak Coverage of a Rectangular Barrier.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Linear Search with Terrain-Dependent Speeds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Distributed algorithms for barrier coverage using relocatable sensors.
Distributed Comput., 2016

Connectivity with directional antennas in the symmetric communication model.
Comput. Geom., 2016

2015
Complexity of barrier coverage with relocatable sensors in the plane.
Theor. Comput. Sci., 2015

Monitoring the Plane with Rotating Radars.
Graphs Comb., 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors.
Theory Comput. Syst., 2014

Distributed Barrier Coverage with Relocatable Sensors.
Proceedings of the Structural Information and Communication Complexity, 2014

Efficient Beacon-Less Broadcasting in MANETs.
Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013
3D Local Algorithm for Dominating Sets of Unit Disk Graphs.
Ad Hoc Sens. Wirel. Networks, 2013

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

On Multi-round Sensor Deployment for Barrier Coverage.
Proceedings of the IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, 2013

2012
Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced.
Discret. Math. Algorithms Appl., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discret. Math. Algorithms Appl., 2012

2011
Local 7-coloring for planar subgraphs of unit disk graphs.
Theor. Comput. Sci., 2011

Minimizing the number of sensors moved on line barriers.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

New routing algorithms to balance traffic load.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

2010
Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks.
Ad Hoc Networks, 2010

Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks.
Proceedings of the 2010 IEEE Wireless Communications and Networking Conference, 2010

Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations.
Proceedings of the Combinatorial Optimization and Applications, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.
Theor. Comput. Sci., 2009

A new local algorithm for backbone formation in ad hoc networks.
Proceedings of the 6th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2009

A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks.
Proceedings of the Complex Sciences, 2009

A local algorithm for dominating sets of quasi-unit disk graphs.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks.
J. Networks, 2008

High delivery rate position-based routing algorithms for 3D ad hoc networks.
Comput. Commun., 2008

Introduction to the Special Issue.
Ad Hoc Sens. Wirel. Networks, 2008

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks.
Proceedings of IEEE International Conference on Communications, 2007

2006
Route discovery with constant memory in oriented planar geometric networks.
Networks, 2006

Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks.
Proceedings of the 3rd Annual International ICST Conference on Mobile and Ubiquitous Systems: Computing, 2006

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Hybrid Position-Based 3D Routing Algorithms with Partial Flooding.
Proceedings of the Canadian Conference on Electrical and Computer Engineering, 2006

2005
Wavelength routing of uniform instances in all-optical rings.
Discret. Optim., 2005

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

A Generalization of the Face Routing Algorithm to a Class of Non-Planar Networks.
Proceedings of the 2nd Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2005), 2005

Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Traversal of a quasi-planar subdivision without using mark bits.
J. Interconnect. Networks, 2004

Two-Hop Virtual Path Layout in Tori.
Proceedings of the Structural Information and Communication Complexity, 2004

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.
Proceedings of the Structural Information and Communication Complexity, 2004

2003
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.
Wirel. Commun. Mob. Comput., 2003

Uniform multi-hop all-to-all optical routings in rings.
Theor. Comput. Sci., 2003

Longest subsequences in permutations.
Australas. J Comb., 2003

Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001
All-to-All Optical Routing in Chordal Rings of Degree 4.
Algorithmica, 2001

2000
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1.
Discret. Appl. Math., 2000

Optical Routing of Uniform Instances in Tori.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Wavelength Routing of Uniform Instances in Optical Rings.
Proceedings of the ICALP Workshops 2000, 2000

1999
Compact Routing on Chordal Rings of Degree 4.
Algorithmica, 1999

All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Embedding Complete Binary Trees Into Star and Pancake Graphs.
Theory Comput. Syst., 1998

Network Properties of Double and Triple Fixed Step Graphs.
Int. J. Found. Comput. Sci., 1998

1997
Compact Routing on Chordal Rings.
Proceedings of the SIROCCO'97, 1997

1996
DCC Linear Congruential Graphs: A New Class of Interconnection Networks.
IEEE Trans. Computers, 1996

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*.
Parallel Algorithms Appl., 1996

1995
Embeddings of complete binary trees into star graphs with congestion 1.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Forwarding indices of consistent routings and their complexity.
Networks, 1994

Embeddings of Hypercubes and Grids into de Bruijn Graphs.
J. Parallel Distributed Comput., 1994

Multidimensional Linear Congruential Graphs.
RAIRO Theor. Informatics Appl., 1994

Embedding Complete Binary Trees into Star Networks.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1992
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
Discret. Appl. Math., 1992

Forwarding Indices of <i>k</i>-Connected Graphs.
Discret. Appl. Math., 1992

1991
Embeddings of Shuffle-Like Graphs in Hyphercubes.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1988
Bigeodetic graphs.
Graphs Comb., 1988

1986
The bandwidth problem and operations on graphs.
Discret. Math., 1986

1982
NOVAC: a non-tree variable tree for combinatorial computing.
Proceedings of the International Conference on Parallel Processing, 1982

1979
Total Ordering Problem.
SIAM J. Comput., 1979

1975
Time Complexity of Recognition and Parsing of E0L-Languages.
Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974
Context in Parallel Rewriting.
Proceedings of the L Systems, 1974


  Loading...