The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jaroslav Opatrny: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Karel Culik II, Jaroslav Opatrny
    Context in Parallel Rewriting. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:230-243 [Conf]
  2. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Route Discovery with Constant Memory in Oriented Planar Geometric Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:147-156 [Conf]
  3. George Kao, Thomas Fevens, Jaroslav Opatrny
    Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:88-91 [Conf]
  4. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of complete binary trees into star graphs with congestion 1. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:546-554 [Conf]
  5. Lata Narayanan, Jaroslav Opatrny
    Wavelength Routing of Uniform Instances in Optical Rings. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:203-214 [Conf]
  6. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:28-37 [Conf]
  7. Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia
    Traversal of a Quasi-Planar Subdivision without Using Mark Bits. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:286-297 [Conf]
  9. Jaroslav Opatrny
    Uniform Multi-hop All-to-All Optical Routings in Rings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:237-246 [Conf]
  10. A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embedding Complete Binary Trees into Star Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:266-275 [Conf]
  11. Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny
    Optical Routing of Uniform Instances in Tori. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:285-294 [Conf]
  12. Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny
    A Generalization of the Face Routing. [Citation Graph (0, 0)][DBLP]
    MobiQuitous, 2005, pp:213-224 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:235-245 [Conf]
  14. Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Shuffle-Like Graphs in Hyphercubes. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:179-190 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:23-34 [Conf]
  16. Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny
    Two-Hop Virtual Path Layout in Tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:69-78 [Conf]
  17. Lata Narayanan, Jaroslav Opatrny
    Compact Routing on Chordal Rings. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:125-137 [Conf]
  18. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:781-790 [Conf]
  19. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:695-703 [Conf]
  20. Lata Narayanan, Jaroslav Opatrny
    Compact Routing on Chordal Rings of Degree 4. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:1, pp:72-96 [Journal]
  21. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Chordal Rings of Degree 4. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:155-178 [Journal]
  22. Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau
    Forwarding Indices of k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:287-296 [Journal]
  23. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:297-317 [Journal]
  24. Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:98, n:3, pp:237-254 [Journal]
  25. Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá
    Network Properties of Double and Triple Fixed Step Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:1, pp:57-0 [Journal]
  26. C. C. Koung, Jaroslav Opatrny
    Multidimensional Linear Congruential Graphs. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:187-199 [Journal]
  27. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Traversal of a quasi-planar subdivision without using mark bits. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:4, pp:395-407 [Journal]
  28. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:104-111 [Journal]
  29. A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embedding Complete Binary Trees Into Star and Pancake Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:3, pp:279-305 [Journal]
  30. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Route discovery with constant memory in oriented planar geometric networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:7-15 [Journal]
  31. Jaroslav Opatrny
    Total Ordering Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:1, pp:111-114 [Journal]
  32. Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman
    DCC Linear Congruential Graphs: A New Class of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:156-164 [Journal]
  33. Jaroslav Opatrny
    Uniform multi-hop all-to-all optical routings in rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:385-397 [Journal]
  34. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
    Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2003, v:3, n:2, pp:141-153 [Journal]
  35. Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:195-207 [Conf]
  36. A. E. Abdallah, Thomas Fevens, Jaroslav Opatrny
    Hybrid Position-Based 3D Routing Algorithms with Partial Flooding. [Citation Graph (0, 0)][DBLP]
    CCECE, 2006, pp:227-230 [Conf]
  37. J. Chvatalova, Jaroslav Opatrny
    The bandwidth problem and operations on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:141-150 [Journal]

  38. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  39. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  40. 3d local algorithm for dominating sets of unit disk graphs. [Citation Graph (, )][DBLP]


  41. Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks. [Citation Graph (, )][DBLP]


  42. NOVAC: a non-tree variable tree for combinatorial computing. [Citation Graph (, )][DBLP]


  43. Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. [Citation Graph (, )][DBLP]


  44. A new local algorithm for backbone formation in ad hoc networks. [Citation Graph (, )][DBLP]


  45. Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. [Citation Graph (, )][DBLP]


  46. A local algorithm for dominating sets of quasi-unit disk graphs. [Citation Graph (, )][DBLP]


  47. Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks. [Citation Graph (, )][DBLP]


  48. A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  49. Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks. [Citation Graph (, )][DBLP]


  50. High delivery rate position-based routing algorithms for 3D ad hoc networks. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002