2009 | ||
---|---|---|
48 | EE | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Julià Urrutia: Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009) |
2008 | ||
47 | EE | Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, H. González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia: Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 |
46 | EE | Jurek Czyzowicz, Stefan Dobrev, H. González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 |
45 | Evangelos Kranakis, Jaroslav Opatrny: Introduction to the Special Issue. Ad Hoc & Sensor Wireless Networks 6(3-4): 177 (2008) | |
44 | EE | Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny: High delivery rate position-based routing algorithms for 3D ad hoc networks. Computer Communications 31(4): 807-817 (2008) |
43 | EE | Shahab Kamali, Jaroslav Opatrny: A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks. JNW 3(4): 31-41 (2008) |
2007 | ||
42 | Evangelos Kranakis, Jaroslav Opatrny: Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceeedings Springer 2007 | |
41 | EE | Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny: Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks. ICC 2007: 3130-3135 |
40 | EE | 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 |
2006 | ||
39 | EE | Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny: Hybrid Position-Based 3D Routing Algorithms with Partial Flooding. CCECE 2006: 227-230 |
38 | EE | 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 |
37 | EE | Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006) |
2005 | ||
36 | EE | 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 |
35 | EE | Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny: A Generalization of the Face Routing. MobiQuitous 2005: 213-224 |
34 | EE | Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia: Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245 |
33 | EE | Lata Narayanan, Jaroslav Opatrny: Wavelength routing of uniform instances in all-optical rings. Discrete Optimization 2(4): 335-347 (2005) |
2004 | ||
32 | EE | 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 |
31 | EE | 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 |
30 | EE | 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 |
29 | EE | Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny: Two-Hop Virtual Path Layout in Tori. SIROCCO 2004: 69-78 |
28 | EE | Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Traversal of a quasi-planar subdivision without using mark bits. Journal of Interconnection Networks 5(4): 395-407 (2004) |
2003 | ||
27 | EE | Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny: Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790 |
26 | EE | Jaroslav Opatrny: Uniform multi-hop all-to-all optical routings in rings. Theor. Comput. Sci. 297(1-3): 385-397 (2003) |
25 | EE | Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny: Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing 3(2): 141-153 (2003) |
2001 | ||
24 | EE | Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau: All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31(2): 155-178 (2001) |
2000 | ||
23 | Lata Narayanan, Jaroslav Opatrny: Wavelength Routing of Uniform Instances in Optical Rings. ICALP Satellite Workshops 2000: 203-214 | |
22 | Jaroslav Opatrny: Uniform Multi-hop All-to-All Optical Routings in Rings. LATIN 2000: 237-246 | |
21 | EE | Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny: Optical Routing of Uniform Instances in Tori. MFCS 2000: 285-294 |
20 | EE | Jaroslav Opatrny, Dominique Sotteau: Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. Discrete Applied Mathematics 98(3): 237-254 (2000) |
1999 | ||
19 | EE | Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau: All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. SODA 1999: 695-703 |
18 | EE | Lata Narayanan, Jaroslav Opatrny: Compact Routing on Chordal Rings of Degree 4. Algorithmica 23(1): 72-96 (1999) |
1998 | ||
17 | Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá: Network Properties of Double and Triple Fixed Step Graphs. Int. J. Found. Comput. Sci. 9(1): 57- (1998) | |
16 | A. 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 | ||
15 | Lata Narayanan, Jaroslav Opatrny: Compact Routing on Chordal Rings. SIROCCO 1997: 125-137 | |
1996 | ||
14 | 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) | |
13 | EE | 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) |
1995 | ||
12 | EE | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) 1995: 546-554 |
1994 | ||
11 | A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275 | |
10 | C. C. Koung, Jaroslav Opatrny: Multidimensional Linear Congruential Graphs. ITA 28(3-4): 187-199 (1994) | |
9 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. Parallel Distrib. Comput. 23(1): 104-111 (1994) | |
1992 | ||
8 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Hypercubes and Grids into de Bruijn Graphs. ICPP (3) 1992: 28-37 | |
7 | EE | Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau: Forwarding Indices of k-Connected Graphs. Discrete Applied Mathematics 37/38: 287-296 (1992) |
6 | EE | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. Discrete Applied Mathematics 37/38: 297-317 (1992) |
1991 | ||
5 | Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Shuffle-Like Graphs in Hyphercubes. PARLE (1) 1991: 179-190 | |
1986 | ||
4 | EE | J. Chvatalova, Jaroslav Opatrny: The bandwidth problem and operations on graphs. Discrete Mathematics 61(2-3): 141-150 (1986) |
1982 | ||
3 | 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 | |
1979 | ||
2 | Jaroslav Opatrny: Total Ordering Problem. SIAM J. Comput. 8(1): 111-114 (1979) | |
1974 | ||
1 | Karel Culik II, Jaroslav Opatrny: Context in Parallel Rewriting. L Systems 1974: 230-243 |