The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ladislav Stacho: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
    Characterization of the Existence of Galled-Tree Networks. [Citation Graph (0, 0)][DBLP]
    APBC, 2006, pp:297-306 [Conf]
  3. Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
    Small Phylogeny Problem: Character Evolution Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:230-243 [Conf]
  4. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Inverse Protein Folding in 2D HP Mode (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:311-318 [Conf]
  5. Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
    Spanning Trees with Bounded Number of Branch Vertices. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:355-365 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. Evangelos Kranakis, Tim Mott, Ladislav Stacho
    Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:426-430 [Conf]
  10. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:197-208 [Conf]
  11. Ladislav Stacho, Imrich Vrto
    Virtual Path Layout for Some Bounded Degree Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:269-178 [Conf]
  12. Ladislav Stacho
    Cycles through specified vertices in 1-tough graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  13. Ladislav Stacho
    Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:48, n:, pp:- [Journal]
  14. Ladislav Stacho, Imrich Vrto
    Bisection Width of Transposition Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:221-235 [Journal]
  15. Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho
    Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:759-787 [Journal]
  16. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Factor d-domatic colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:17-25 [Journal]
  17. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Edge-disjoint spanners in Cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:296, n:2-3, pp:167-186 [Journal]
  18. Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
    Spanning spiders and light-splitting switches. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:83-95 [Journal]
  19. Peter Horák, Ladislav Stacho
    A lower bound on the number of hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:275-280 [Journal]
  20. Ladislav Stacho, Dávid Szeszlér
    On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:292, n:1-3, pp:159-165 [Journal]
  21. Ján Manuch, Ladislav Stacho
    On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:3, pp:255-270 [Journal]
  22. Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
    Characterization of the Existence of Galled-tree Networks. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:6, pp:1309-1328 [Journal]
  23. Ladislav Stacho
    Locally Pancyclic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:1, pp:22-40 [Journal]
  24. Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho
    (quasi) Spanners for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:2, pp:63-84 [Journal]
  25. 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]
  26. 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]
  27. Ladislav Stacho, Jozef Sirán, Sanming Zhou
    Routing balanced communications on hamilton decomposable networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:377-385 [Journal]
  28. Ladislav Stacho, Imrich Vrto
    Virtual Path Layouts in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1621-1629 [Journal]
  29. Luis A. Goddyn, Ladislav Stacho
    Edge disjoint cycles through specified vertices. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:246-260 [Journal]
  30. Daniel Král, Ladislav Stacho
    Closure for the property of having a hamiltonian prism. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:3, pp:209-220 [Journal]
  31. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
    Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:121-132 [Conf]
  32. Ladislav Stacho
    A sufficient condition guaranteeing large cycles in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:273-277 [Journal]

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


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


  35. Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. [Citation Graph (, )][DBLP]


  36. NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. [Citation Graph (, )][DBLP]


  37. Two lower bounds for self-assemblies at temperature 1. [Citation Graph (, )][DBLP]


  38. Maximum Interference of Random Sensors on a Line. [Citation Graph (, )][DBLP]


  39. Strong Orientations of Planar Graphs with Bounded Stretch Factor. [Citation Graph (, )][DBLP]


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


  41. A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model [Citation Graph (, )][DBLP]


  42. Constant memory routing in quasi-planar and quasi-polyhedral graphs. [Citation Graph (, )][DBLP]


  43. Broadcasting from multiple originators. [Citation Graph (, )][DBLP]


  44. Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. [Citation Graph (, )][DBLP]


  45. The Odd-Distance Plane Graph. [Citation Graph (, )][DBLP]


  46. Spanning cubic graph designs. [Citation Graph (, )][DBLP]


  47. Preface. [Citation Graph (, )][DBLP]


  48. Edge-disjoint spanners in tori. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.029secs
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