Chapters in Books:

E. Kranakis, L. Stacho, Routing and Traversal via Location Awareness in Ad-Hoc Networks. In Handbook of Algorithms for Wireless and Mobile Networks and Computing, A. Boukerche, editor, pp. 165-182, Chapman and Hall/CRC, 2005. (download)

Edited Conference Proceedings:

P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting        in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009.

Refereed Journal Articles

Submitted:

A. Gupta, J. Manuch, L. Stacho, X. Zhao, Polynomial algorithm for coloring random graphs by small posets, Journal of Discrete Algorithms.

Accepted or published:

E. Kranakis, O. Morales Ponce, L. Stacho, Strong Orientations of Plane Graphs with Stretch Factor, Discrete Applied Mathematics 161 (2013), 176-183. (download)

D. Kral, J-S. Sereni, L. Stacho, Min-max relations for odd cycles in planar graphs, SIAM J. Discrete Mathematics 26 (2012), 884-895. (download)

E. Kranakis, D. Krizanc, O. Morales Ponce, L. Stacho, Bounded Length 2-Edge Augmentation of Geometric Planar Graphs, spec. issue of Discrete Mathematics, Algorithms and Applications 4 (2012), 1250036 (19 pages).

S. Dobrev, E. Kranakis, D. Krizanc, J. Opatrny, O. Morales Ponce, L. Stacho, Strong Connectivity in Sensor Networks+, spec. issue of Discrete Mathematics, Algorithms and Applications 4 (2012), 1250038 (26 pages).

J. Manuch, L. Stacho, C. Stoll, Step-assembly with a constant number of tile types, Natural Computing 11 (2012) 535-550. (download)

A. Gupta, J. Manuch, L. Stacho, X. Zhao, Algorithm for haplotype inference via galled-tree with simple galls, Journal of Computational Biology 19 (2012), 439-454. (download)

J. Safaei, J. Manuch, A. Gupta, L. Stacho, S.  Pelech, Prediction of Human Protein Kinase Substrate Specificities, Proteome Science 9 (2011). (download)

J. Azarija, R. Erman, D. Kral, M. Krnc, L. Stacho, Cyclic colorings of plane graphs with independent faces, European Journal of Combinatorics 33 (2012), 294-301. (download)

J. Manuch, C. Thachuk, L. Stacho, A. Condon, NP-completeness of the energy problem without pseudoknots and temporary arcs, Natural Computing 10 (2011), 391-405. (download)

C. Thachuk, J. Manuch, A. Rafiey, L-A. Mathieson, L. Stacho, A. Condon, An algorithm for the energy barrier problem without pseudoknots and temporary arcs, Journal of Computational Biology.

J. Czyzowicz, S. Dobrev, H. González-Aguilar, R. Kralovic, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs, Theoretical Computer Science 412, (2011), 1696-1704. (download)

A. Gupta, M. Karimi, J. Manuch, L. Stacho, X.  Zhao, Haplotype inferring via galled-tree is NP-complete, Journal of Computational Biology 17 (2010), 1435-1449. (download)

D. Kral, L. Stacho, Coloring plane graphs with independent crossings, Journal of Graph Theory 64 (2010), 184-205. (download)

J. Manuch, L. Stacho, C. Stoll, Two lower bounds for self-assemblies at temperature 1, Journal of Computational Biology 17 (2010), 841-852. (download)

P. Adams, H. Ardal, J. Manuch, M. Rosenfeld, L. Stacho, Spanning cubic graph designs, Discrete Mathematics 309 (2009), 5781-5788. (download)

A. Liestman, D. Richards, L. Stacho, Broadcasting from Multiple Originators, Discrete Applied Mathematics 157 (2009), 2886-2891. (download)

H. Ardal, J. Manuch, M. Rosenfeld, S. Shelah, L. Stacho, The odd-distance plane graph, Discrete and Computational Geometry 42 (2009), 132-141. (download)

A. Gupta, J. Manuch, L. Stacho, X. Zhao, Haplotype inferring via galled-tree networks using a covering problem for special genotype matrices, Discrete Appl. Math. 157 (2009), 2310-2324. (download)

A. Liestman, T. Shermer, L. Stacho, Edge disjoint spanners in tori, Discrete Mathhematics 309 (2009), 2239-2249. (download)

E. Kranakis, T. Mott, L. Stacho, Constant memory routing in quasi-planar and quasi-polyhedral graphs, Discrete Applied Mathematics 156 (2008), 3430-3442. (download)

A. Gupta, J. van Heuvel, J. Manuch, L. Stacho, X. Zhao, On the complexity of ordered colorings, SIAM J. Discrete Mathematics 22 (2008), 832-847. (download)

D. Kral, L. Stacho, On hamiltonian threshold for strong product of graphs, Journal of Graph Theory 58 (2008), 314-328. (download)

T. Kaiser, D. Kral, L. Stacho, Tough spiders, Journal of Graph Theory 56 (2007), 23-40. (download)

D. Kral, L. Stacho, Closure for the property of having hamiltonian prism, Journal of Graph Theory 53 (2007), 209-220. (download)

P. Clote, E. Kranakis, D. Krizanc, L. Stacho, Asymptotic expected number of base pairs in optimal secondary structure for random RNA+, Discrete Applied Mathematics 155 (2007), 759-787. (download)

A. Gupta, J. Manuch, L. Stacho, X. Zhao, Characterization of the existence of galled-tree networks, Journal of Bioinformatics and Computational Biology 6 (2006), 1309-1328. (download)

A. Gupta, J. Manuch, L. Stacho, Fault tolerant forwarding and optical indexes: a design theory approach, Journal of Combinatorial Designs 14 (2006), 25-40. (design06)

E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Route Discovery with Constant Memory in Oriented Planar Geometric Networks, Networks 48 (2006), 7-15. (download)

L. Goddyn, L. Stacho, Edge disjoint cycles through prescribed vertices, Journal of Graph Theory 50 (2005), 246-260. (download)

A. Gupta, J. Manuch, L. Stacho, Structure-approximating inverse protein folding problem in 2D HP model, Journal of Computational Biology 12 (2005), 1328-1345. (download)

P. Berenbrink, T. Friedetzky, J. Manuch, L. Stacho, (Quasi) spanner in mobile ad hoc networks, Journal of Interconnection Networks 6 (2005), 63-84. (download)

G. Fertin, A. Liestman, T. Shermer, L. Stacho, Edge-disjoint spanners in Cartesian products of graphs, Discrete Mathematics 296 (2005), 167-186. (download)

L. Stacho, D. Szeszler, On a generalization of Chvatal's condition giving new hamiltonian degree sequences, Discrete Mathematics 292 (2005), 159-165. (download)

L. Stacho, J. Siran, and S. Zhou, Routing Balanced Communications on Hamiltonian Decomposable Networks, Parallel Processing Letters 14 (2004), 377--385. (download)

L. Gargano, M. Hammar, P. Hell, L. Stacho, and U. Vaccaro, Spanning spiders and light-splitting switches, Discrete Mathematics 285 (2004), 83--95. (download)

J. Manuch, and L. Stacho, On f-wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes, Theoretical Informatics and Applications 37 (2003), 255--270. (download)

N. Alon, G. Fertin, A. Liestman, T. Shermer, and L. Stacho, Factor d-domatic colorings of graphs, Discrete Mathematics 262 (2003), 17--25. (download)

L. Stacho, A note on two circumference generalizations of Chvatal's hamiltonicity condition, Mathematica Slovaca 52 (2002), 127--133.

L. Stacho, A note on upper bound for chromatic number of a graph, Acta Math. Univ. Comenianae LXXI , No. 1 (2002), 1--2. (download)

L. Stacho, New upper bounds for the chromatic number of a graph, J. Graph Theory 36 (2001), 117-120. (download)

P. Horak and L. Stacho, A lower bound on the number of hamiltonian cycles, Discrete Math. 222 (2000), 275--280. (download)

L. Stacho, Degrees, neighbourhoods, and closure operations, Acta Math. Univ. Comenianae LXIX (2000), 71--76.

L. Stacho, Cycles through specified vertices in 1-tough graphs, Ars Combinatoria 56 (2000), 263-269.

L. Stacho, and I. Vrt'o, Virtual path layouts in ATM networks, SIAM J. Comput. 29 (2000), 1621-1629. (download)

L. Stacho, Locally pancyclic graphs, J. Combin. Theory Series B, 76 (1999), 22--40. (download)

L. Stacho, Non-isomorphic smallest maximally non-hamiltonian graphs, Ars Combinatoria 48 (1998), 307--317.

L. Stacho, and I. Vrt'o, Bisection width of transposition graphs and its applications, Discrete Applied Mathematics, 84 (1998) no. 1-3,221-235. (download)

L. Stacho, Old hamiltonian ideas from a new point of view, Mathematische Nachrichten 186 (1997), 251--258.

L. Stacho, A sufficient condition guaranteeing large cycles in graphs, Discrete Mathematics 169 (1997), 273-277.

L. Stacho, A new Chvatal type condition for pancyclicity, Graphs and Combinatorics 13 (1997), 275-280.

L. Stacho, Maximally non-hamiltonian graphs of girth 7, Graphs and Combinatorics 12 (1996), 361-371. (download)

L. Stacho, and E. Urland, The nonexistence of a decomposition of complete graph K_12 into three factors with diameter two, Journal of Comb. Math. and Com. Computing 21 (1996), 147-159.

L. Stacho, A note on the circumference of graphs, Acta Math. Univ. Comenianae 2 (1995), 259-263.

D. Palumbiny, and L. Stacho, On decomposition of complete graphs into factors with prescribed s-edge-connectivities, Acta Mathematica 2 University of Nitra (1995), 3-14.

L. Stacho, On minimal outerplanar graphs of given diameter, Australasian Journal of Combinatorics 12 (1995), 67-76.

E. Urland and L. Stacho, Factorizing the complete graph K_12 by computer, Computers and Artificial Intelligence 6 (1994), 595-601.

L. Stacho, Reconstruction of graphs with certain degree-sequences, Acta Math. Univ. Comenianae LXI (1992), 219-223.

Refereed Conference Proceedings

The asterisk indicates that the paper has appeared in its final form in a journal. The + sign indicates shortened title.

Submitted:

Accepted or published:

B. Behsaz, J. Manuch, L. Stacho, Turing universality of step-wise and stage assembly at temperature 1, DNA Computing and Molecular Programming, LNCS 7433 (2012), 1-11.

S. Dobrev, E. Kranakis, D. Krizanc, O. Morales Ponce, L. Stacho, Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points, LATIN 2012,    LNCS 7256 (2012), pp. 255-266.

J. Safaei, J. Manuch, A. Gupta, L. Stacho, S. Pelech, Evolutionary Conservation of Human Phosphorylation Sites, Proc.of IEEE Int. Conf. on Bioinf. & Biom. (BIBM, Atlanta, 2011), pp. 222-227.

* J. Safaei, J. Manuch, A. Gupta, L. Stacho, S. Pelech, Prediction of Human Protein Kinase+, Proc. of IEEE Int. Conf. on Bioinf. & Biomedicine (BIBM, Hong Kong, 2010), pp. 259-264.

E. Kranakis, D. Krizanc, O. Morales Ponce, L. Stacho, Bounded Length 2-Edge Augmentation of Geometric Planar Graphs, Proc. of 4th COCOA, Hawaii, 2010, LNCS 6509, pp. 385-397.

S. Dobrev, E. Kranakis, D. Krizanc, J. Opatrny, O. Morales Ponce, L. Stacho, Strong Connectivity in Sensor Networks+, Proc. of 4th COCOA, Hawaii, 2010, LNCS 6509, pp. 72-86.

* E. Kranakis, O. Morales Ponce, L. Stacho, Strong Orientations of Planar Graphs with Bounded Stretch Factor, Proc. of 17th SIROCCO, Sirince, 2010, LNCS 6058, pp. 224-236.

E. Kranakis, D. Krizanc, L. Narayanan, L. Stacho, Maximum interference of random sensors on a line, Proc. of 17th SIROCCO, Sirince, 2010, LNCS 6058, pp. 197-210.

A. Mahmoody Ghaidary, C. Chauve, and L. Stacho, Theoretical advances on multichromosomal median computation, Proc. of 8th Annual RECOMB Satellite Workshop, (Ottawa, 2010), poster.

J. Manuch, L. Stacho, C. Stoll, Step-assembly with a constant number of tile types, Proc. of 20th Int. Symp. on Algorithms and Computation (ISAAC, Hawaii, 2009), LNCS 5878, pp. 954-963.

C. Thachuk, J. Manuch, A. Rafiey, L-A. Mathieson, L. Stacho, A. Condon, An algorithm for energy barrier problem without pseudoknots and temporary arcs, Proc. of 15th Pacific Symposium on Biocomputing (PSB, Hawaii, 2010), LNCS 5877, pp. 106-115.

J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadarisx, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia, M. Yazdanix, On minimizing the maximum sensor movement for barrier coverage of a line segment. Proc. of 8th ADHOC-NOW, Spain, 2009, LNCS 5793, pp. 194-212.

A-H. Khodabakhshi, J. Manuch, A. Rafiey, L. Stacho, A. Gupta, Protein designs in HP models, AIP Conf. Proc. 1146 (2009), pp. 41-64.

* J. Manuch, C. Thachuk, L. Stacho, A. Condon, NP-completeness of the direct energy barrier problem without pseudoknots, Proc. of  DNA, Fayetteville, 2009, LNCS 5877, pp. 106-115.

* J. Manuch, L. Stacho, C. Stoll, Two lower bounds for self-assemblies at temperature 1, Proc. of 24th Annual ACM Symposium on Applied Computing (ACM SAC, Honolulu, 2009), pp. 808-809.

* A. Gupta, J. Manuch, L. Stacho, X. Zhao, Haplotype inferring via galled-tree networks is complete, Proc. of 14th COCOON, Dalian, 2008, LNCS 5092 pp. 287-298.

A. Gupta, J. Manuch, L. Stacho, X. Zhao, Algorithm for haplotype inferring via galled-tree networks with simple galls, Proc. of  ISBRA, Atlanta, 2007, LNCS 4463, pp.121-132.

* E. Kranakis, T. Mott, L. Stacho, On-Line Routing in Quasi-Planar and Quasi-Polyhedral Graphs, Proc. of 2nd IEEE PerCom Work. on Pervasive Wir. Net. (PERCOMW, Pisa, 2006), pp. 426-430.

E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges, Proc. of 7th Latin American Theoretical Informatics Symposium (LATIN, Valdivia, 2006), LNCS 3887, pp. 286-297.

* J. Manuch, X. Zhao, L. Stacho, A. Gupta, Characterization of the existence of galled-tree networks, Proc. of  APBC, Taipei, 2006, Advances in Bioinf. & Comp. Biology 4 (2006), 297-306.

E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, H. Tejeda, J. Urrutia, Half-Space Proximal+, Proc. of  OPODIS, Pisa, 2005, LNCS 3974 (2006), pp. 235-245.

A. Gupta, J. Manuch, L. Stacho, and J. Zhu, Small phylogeny problem: character evolution trees, In Proc. of Combinatorial Pattern Matching: 15th Annual Symposium (CPM'04), Istanbul, Turkey, July 2004, Lecture Notes in Comput. Sci. 3109 (2004), 230-242.

1. *E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Route Discovery with Constant Memory in Oriented Planar Geometric Networks, 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'04), in conjunction with ICALP'04, July 2004, Turku, Finland, Lecture Notes in Comput. Sci. 3121 (2004), 147-156.
   

2. *A. Gupta, J. Manuch, and L. Stacho, Inverse protein folding in HP model, 3rd Computational Systems Bioinformatics conference (CSB'04), August 2004, Stanford, CA.
   

3. *E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Traversal of a quasi-planar subdivision without using mark bits, 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'04), in conjunction with IPDPS'04, April 2004, Santa Fe, New Mexico.
   

4. *A. Gupta, J. Manuch, and L. Stacho, Fault-tolerant forwarding and optical indexes of complete and complete bipartite networks, 11th Colloquiua on Structural Information and Communication Complexity (SIROCCO'04), Lecture Notes in Comput. Sci. 3104 (2004), 197-208.
   

5. *L. Gargano, P. Hell, L. Stacho, and U. Vaccaro, Spanning trees with bounded number of branch vertices, in Proc. of ICALP'02, Lecture Notes in Comput. Sci. 2380 (2002), 355--365.
   

6. *J. Manuch, and L. Stacho, Fault-tolerant wavelength allocations in all-optical hypercubes, in Proc. Structure Information and Communication Complexity, 6th Colloquium, (SIROCCO'99), Proceedings in Informatics 5 (eds. C. Gavoille, J.C. Bermond, and A. Raspaud), Carleton Scientific Press, Ottawa, 1999, 219-232.
   

7. *L. Stacho, and I. Vrt'o, Virtual path layouts in ATM networks, in Proc. Structure Information and Communication Complexity, (SIROCCO'96), International Informatics Series 6 (eds. N. Santoro, P. Spirakis), Carleton Univ. Press, Ottawa, 1997, 269-278.
   

8. *L. Stacho, and I. Vrt'o, Bisection width of transposition graphs, in Proc. of 7th IEEE Symposium on Parallel and Distributed Processing (IPDPS'95), California,1995, 681-688.
   

L. Stacho, and E. Urland, The problem of three airway companies is completely solved, "Proceedings of the XIX International Software Seminar SOFSEM, High Tatras, Czechoslovakia", April 1991, p. 119-123.