default search action
Jaroslav Opatrny
Person information
- affiliation: Concordia University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j46]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov
:
Exploration of High-Dimensional Grids by Finite State Machines. Algorithmica 86(5): 1700-1729 (2024) - [i18]Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The En Route Truck-Drone Delivery Problem. CoRR abs/2402.00829 (2024) - 2021
- [j45]Jurek Czyzowicz
Search on a Line by Byzantine Robots. Int. J. Found. Comput. Sci. 32(4): 369-387 (2021) - [j44]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-energy tradeoffs for evacuation by two robots in the wireless model. Theor. Comput. Sci. 852: 61-72 (2021) - [j43]Mohsen Eftekhari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro:
On synchronization and orientation in distributed barrier coverage with relocatable sensors. Theor. Comput. Sci. 887: 1-10 (2021) - [c66]Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Group Evacuation on a Line by Agents with Different Communication Abilities. ISAAC 2021: 57:1-57:24 - [c65]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. SIROCCO 2021: 185-203 - [c64]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. WALCOM 2021: 65-77 - [i17]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. CoRR abs/2102.13062 (2021) - [i16]Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Group Evacuation on a Line by Agents with Different Communication Abilities. CoRR abs/2109.12676 (2021) - 2020
- [j42]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny
Weak Coverage of a Rectangular Barrier. Algorithmica 82(4): 721-746 (2020) - [j41]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating equilateral triangles and squares in the face-to-face model. Comput. Geom. 89: 101624 (2020) - [j40]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage. Discret. Appl. Math. 285: 650-662 (2020) - [j39]Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber:
Evacuating Robots from a Disk Using Face-to-Face Communication. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j38]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority evacuation from a disk: The case of n = 1, 2, 3. Theor. Comput. Sci. 806: 595-616 (2020) - [j37]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority evacuation from a disk: The case of n ≥ 4. Theor. Comput. Sci. 846: 91-102 (2020) - [c63]Jared Ray Coleman, Evangelos Kranakis, Oscar Morales-Ponce, Jaroslav Opatrny, Jorge Urrutia, Birgit Vogtenhuber:
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. CCCG 2020: 73-79 - [i15]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. CoRR abs/2006.13241 (2020) - [i14]Jared Ray Coleman
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. CoRR abs/2006.15664 (2020)
2010 – 2019
- 2019
- [j36]Jurek Czyzowicz, Evangelos Kranakis
Search on a line with faulty robots. Distributed Comput. 32(6): 493-504 (2019) - [c62]Iman Bagheri, Lata Narayanan, Jaroslav Opatrny:
Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range. ALGOSENSORS 2019: 3-22 - [c61]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Energy Consumption of Group Search on a Line. ICALP 2019: 137:1-137:15 - [c60]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite Automata. ICALP 2019: 139:1-139:16 - [c59]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model. SIROCCO 2019: 185-199 - [c58]Anne-Laure Ehresmann
Distributed Pattern Formation in a Ring. SIROCCO 2019: 215-229 - [i13]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite State Machines. CoRR abs/1902.03693 (2019) - [i12]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Energy Consumption of Group Search on a Line. CoRR abs/1904.09714 (2019) - [i11]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model. CoRR abs/1905.06783 (2019) - [i10]Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Distributed Pattern Formation in a Ring. CoRR abs/1905.08856 (2019) - [i9]Iman Bagheri, Lata Narayanan, Jaroslav Opatrny:
Evacuation of equilateral triangles by mobile agents of limited communication range. CoRR abs/1908.07315 (2019) - 2018
- [c57]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
God Save the Queen. FUN 2018: 16:1-16:20 - [c56]Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende
Satisfying Neighbor Preferences on a Circle. LATIN 2018: 727-740 - [c55]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract). SIROCCO 2018: 392-407 - [i8]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
God Save the Queen. CoRR abs/1804.06011 (2018) - [i7]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority Evacuation from a Disk Using Mobile Robots. CoRR abs/1805.03568 (2018) - [i6]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model. CoRR abs/1812.10162 (2018) - 2017
- [c54]Stefan Dobrev, Evangelos Kranakis
Weak Coverage of a Rectangular Barrier. CIAC 2017: 196-208 - [c53]Jurek Czyzowicz, Evangelos Kranakis
Linear Search with Terrain-Dependent Speeds. CIAC 2017: 430-441 - [c52]Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating an Equilateral Triangle in the Face-to-Face Model. OPODIS 2017: 11:1-11:16 - [c51]Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. SPAA 2017: 265-274 - [i5]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Linear Search with Terrain-Dependent Speeds. CoRR abs/1701.03047 (2017) - [i4]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CoRR abs/1701.07294 (2017) - 2016
- [j35]Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Connectivity with directional antennas in the symmetric communication model. Comput. Geom. 55: 1-25 (2016) - [j34]Mohsen Eftekhari Hesari, Evangelos Kranakis
Distributed algorithms for barrier coverage using relocatable sensors. Distributed Comput. 29(5): 361-376 (2016) - [c50]Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis
Search on a Line by Byzantine Robots. ISAAC 2016: 27:1-27:12 - [c49]Jurek Czyzowicz, Evangelos Kranakis
Search on a Line with Faulty Robots. PODC 2016: 405-414 - [i3]Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Search on a Line by Byzantine Robots. CoRR abs/1611.08209 (2016) - 2015
- [j33]Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis
Monitoring the Plane with Rotating Radars. Graphs Comb. 31(2): 393-405 (2015) - [j32]Stefan Dobrev
Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579: 64-73 (2015) - [c48]Jurek Czyzowicz, Evangelos Kranakis
Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares. ADHOC-NOW 2015: 181-194 - [c47]Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract). CIAC 2015: 140-152 - [i2]Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber:
Evacuating Robots from a Disk Using Face-to-Face Communication. CoRR abs/1501.04985 (2015) - 2014
- [j31]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. Theory Comput. Syst. 54(4): 622-639 (2014) - [c46]Louisa Harutyunyan, Jaroslav Opatrny:
Efficient Beacon-Less Broadcasting in MANETs. AINA 2014: 172-179 - [c45]Mohsen Eftekhari Hesari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro
Distributed Barrier Coverage with Relocatable Sensors. SIROCCO 2014: 235-249 - [c44]Jurek Czyzowicz, Evangelos Kranakis
Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage. WAOA 2014: 119-131 - [i1]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage. CoRR abs/1410.6726 (2014) - 2013
- [j30]Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny:
3D Local Algorithm for Dominating Sets of Unit Disk Graphs. Ad Hoc Sens. Wirel. Networks 19(1-2): 21-41 (2013) - [c43]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182 - [c42]Mohsen Eftekhari Hesari, Lata Narayanan, Jaroslav Opatrny:
On Multi-round Sensor Deployment for Barrier Coverage. MASS 2013: 310-318 - [c41]Mohsen Eftekhari Hesari, Evangelos Kranakis
Distributed algorithms for barrier coverage using relocatable sensors. PODC 2013: 383-392 - [c40]Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract. SPAA 2013: 73-82 - 2012
- [j29]Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny:
Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced. Discret. Math. Algorithms Appl. 4(2) (2012) - [j28]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. Discret. Math. Algorithms Appl. 4(3) (2012) - [c39]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. FUN 2012: 94-106 - 2011
- [j27]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic
Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) - [c38]Mona Mehrandish, Lata Narayanan, Jaroslav Opatrny:
Minimizing the number of sensors moved on line barriers. WCNC 2011: 653-658 - [c37]Mohsen Eftekhari Hesari, Lata Narayanan, Jaroslav Opatrny:
New routing algorithms to balance traffic load. WCNC 2011: 968-973 - 2010
- [j26]Alaa Eddien Abdallah
Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks. Ad Hoc Networks 8(1): 15-29 (2010) - [c36]Jurek Czyzowicz, Evangelos Kranakis
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42 - [c35]Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny:
3d local algorithm for dominating sets of unit disk graphs. CCCG 2010: 35-38 - [c34]Stefan Dobrev, Evangelos Kranakis
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) 2010: 72-86 - [c33]Evangelos Kranakis
Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations. COCOA (2) 2010: 303-316 - [c32]Hossein Kassaei, Mona Mehrandish, Lata Narayanan, Jaroslav Opatrny:
Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks. WCNC 2010: 1-6
2000 – 2009
- 2009
- [j25]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009) - [c31]Jurek Czyzowicz, Evangelos Kranakis
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212 - [c30]Yonatan Cohen, Jaroslav Opatrny:
A local algorithm for dominating sets of quasi-unit disk graphs. C3S2E 2009: 223-231 - [c29]Shahab Kamali, Jaroslav Opatrny:
A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks. Complex (2) 2009: 1337-1354 - [c28]Hossein Kassaei, Mona Mehrandish, Lata Narayanan, Jaroslav Opatrny:
A new local algorithm for backbone formation in ad hoc networks. PE-WASUN 2009: 49-57 - 2008
- [j24]Evangelos Kranakis, Jaroslav Opatrny:
Introduction to the Special Issue. Ad Hoc Sens. Wirel. Networks 6(3-4): 177 (2008) - [j23]Alaa Eddien Abdallah
High delivery rate position-based routing algorithms for 3D ad hoc networks. Comput. Commun. 31(4): 807-817 (2008) - [j22]Shahab Kamali, Jaroslav Opatrny:
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks. J. Networks 3(4): 31-41 (2008) - [c27]Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 - [c26]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 - 2007
- [c25]Alaa Eddien Abdallah
Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks. ICC 2007: 3130-3135 - [c24]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. SIROCCO 2007: 195-207 - [e1]Evangelos Kranakis, Jaroslav Opatrny:
Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceeedings. Lecture Notes in Computer Science 4686, Springer 2007, ISBN 978-3-540-74822-9 [contents] - 2006
- [j21]Edgar Chávez
Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006) - [c23]Alaa Eddien Abdallah
Hybrid Position-Based 3D Routing Algorithms with Partial Flooding. CCECE 2006: 227-230 - [c22]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN 2006: 286-297 - [c21]Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny:
Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks. MobiQuitous 2006: 1-8 - 2005
- [j20]Lata Narayanan, Jaroslav Opatrny:
Wavelength routing of uniform instances in all-optical rings. Discret. Optim. 2(4): 335-347 (2005) - [c20]George S.-C. Kao, Thomas Fevens, Jaroslav Opatrny:
Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks. CCCG 2005: 88-91 - [c19]Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny:
A Generalization of the Face Routing Algorithm to a Class of Non-Planar Networks. MobiQuitous 2005: 213-224 - [c18]Edgar Chávez
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245 - 2004
- [j19]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks 5(4): 395-407 (2004) - [c17]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156 - [c16]Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia:
Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004 - [c15]Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia:
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. SIROCCO 2004: 23-34 - [c14]Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny:
Two-Hop Virtual Path Layout in Tori. SIROCCO 2004: 69-78 - 2003
- [j18]Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny:
Longest subsequences in permutations. Australas. J Comb. 28: 225-238 (2003) - [j17]Jaroslav Opatrny:
Uniform multi-hop all-to-all optical routings in rings. Theor. Comput. Sci. 297(1-3): 385-397 (2003) - [j16]Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny:
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wirel. Commun. Mob. Comput. 3(2): 141-153 (2003) - [c13]Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny:
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790 - 2001
- [j15]Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31(2): 155-178 (2001) - 2000
- [j14]Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. Discret. Appl. Math. 98(3): 237-254 (2000) - [c12]Lata Narayanan, Jaroslav Opatrny:
Wavelength Routing of Uniform Instances in Optical Rings. ICALP Satellite Workshops 2000: 203-214 - [c11]Jaroslav Opatrny:
Uniform Multi-hop All-to-All Optical Routings in Rings. LATIN 2000: 237-246 - [c10]Francesc Comellas, Margarida Mitjana
Optical Routing of Uniform Instances in Tori. MFCS 2000: 285-294
1990 – 1999
- 1999
- [j13]Lata Narayanan, Jaroslav Opatrny:
Compact Routing on Chordal Rings of Degree 4. Algorithmica 23(1): 72-96 (1999) - [c9]Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. SODA 1999: 695-703 - 1998
- [j12]Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá:
Network Properties of Double and Triple Fixed Step Graphs. Int. J. Found. Comput. Sci. 9(1): 57-76 (1998) - [j11]Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embedding Complete Binary Trees Into Star and Pancake Graphs. Theory Comput. Syst. 31(3): 279-305 (1998) - 1997
- [c8]Lata Narayanan, Jaroslav Opatrny:
Compact Routing on Chordal Rings. SIROCCO 1997: 125-137 - 1996
- [j10]Marie-Claude Heydemann, Dominique Sotteau, Jaroslav Opatrny:
Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*. Parallel Algorithms Appl. 8(3-4): 333-354 (1996) - [j9]Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman:
DCC Linear Congruential Graphs: A New Class of Interconnection Networks. IEEE Trans. Computers 45(2): 156-164 (1996) - 1995
- [c7]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) 1995: 546-554 - 1994
- [j8]C. C. Koung, Jaroslav Opatrny:
Multidimensional Linear Congruential Graphs. RAIRO Theor. Informatics Appl. 28(3-4): 187-199 (1994) - [j7]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. Parallel Distributed Comput. 23(1): 104-111 (1994) - [j6]Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny:
Forwarding indices of consistent routings and their complexity. Networks 24(2): 75-82 (1994) - [c6]Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275 - 1992
- [j5]Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau:
Forwarding Indices of k-Connected Graphs. Discret. Appl. Math. 37/38: 287-296 (1992) - [j4]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. Discret. Appl. Math. 37/38: 297-317 (1992) - [c5]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Hypercubes and Grids into de Bruijn Graphs. ICPP (3) 1992: 28-37 - 1991
- [c4]Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Shuffle-Like Graphs in Hyphercubes. PARLE (1) 1991: 179-190
1980 – 1989
- 1988
- [j3]N. Srinivasan, Jaroslav Opatrny, Vangalur S. Alagar:
Bigeodetic graphs. Graphs Comb. 4(1): 379-392 (1988) - 1986
- [j2]J. Chvatalova, Jaroslav Opatrny:
The bandwidth problem and operations on graphs. Discret. Math. 61(2-3): 141-150 (1986) - 1982
- [c3]Bipin C. Desai, Clement Wing Hong Lam, J. William Atwood, Jaroslav Opatrny, Peter Grogono, S. Cabilio:
NOVAC: a non-tree variable tree for combinatorial computing. ICPP 1982: 193-195
1970 – 1979
- 1979
- [j1]Jaroslav Opatrny:
Total Ordering Problem. SIAM J. Comput. 8(1): 111-114 (1979) - 1975
- [c2]Jaroslav Opatrny, Karel Culík II:
Time Complexity of Recognition and Parsing of E0L-Languages. Automata, Languages, Development 1975: 243-250 - 1974
- [c1]Karel Culík II, Jaroslav Opatrny:
Context in Parallel Rewriting. L Systems 1974: 230-243
Coauthor Index
[j45] [j44] [c66] [c65] [c64] [i17] [i16] [j42] [j40] [j39] [j38] [j37] [c63] [i15] [i14] [j36] [c61] [c59] [i12] [i11] [c57] [c55] [i8] [i7] [c54] [c53] [i5] [i4] [j34] [c50] [c49] [i3] [j33] [j32] [c48] [c47] [i2] [c44] [i1] [c43] [c41] [c40] [j29] [j28] [j27] [c36] [c34] [c33] [j25] [c31] [j24] [c27] [c26] [c24] [e1] [j21] [c22] [c18] [j19] [c17] [c16] [c15]
[j46] [i18] [j45] [j44] [j43] [c66] [c65] [c64] [i17] [i16] [j42] [j41] [j40] [j39] [j38] [j37] [i15] [j36] [c62] [c61] [c60] [c59] [c58] [i13] [i12] [i11] [i10] [i9] [c57] [c56] [c55] [i8] [i7] [i6] [c54] [c53] [c52] [c51] [i5] [i4] [j35] [j34] [c50] [c49] [i3] [j32] [c48] [c47] [i2] [j31] [c45] [c44] [i1] [c43] [c42] [c41] [c40] [j29] [c39] [c38] [c37] [c36] [c33] [c32] [c31] [c28] [j20] [c19] [c14] [j16] [c13] [j15] [c12] [c10] [j13] [c9] [c8]
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 2024-05-08 21:51 CEST 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: