Ladislav Stacho

Evangelos Kranakis, Oscar Morales Ponce, Ladislav Stacho: Strongly connected orientations of plane graphs. Discrete Applied Mathematics 161(1-2): 176-183 (2013)

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. Discrete Math., Alg. and Appl. 4(3) (2012)

Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho: Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. Discrete Math., Alg. and Appl. 4(3) (2012)

Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho: Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33(3): 294-301 (2012)

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. Journal of Computational Biology 19(4): 439-454 (2012)

Ján Manuch, Ladislav Stacho, Christine Stoll: Step-wise tile assembly with a constant number of tile types. Natural Computing 11(3): 535-550 (2012)

Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho: Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discrete Math. 26(3): 884-895 (2012)

Bahar Behsaz, Ján Manuch, Ladislav Stacho: Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA 2012: 1-11

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho: Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. LATIN 2012: 255-266

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing 10(1): 391-405 (2011)

Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011)

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227

Ahmad Mahmoody-Ghaidary, Cedric Chauve, Ladislav Stacho: Tractability results for the Double-Cut-and-Join circular median problem. CoRR abs/1111.5872 (2011)

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho: Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. CoRR abs/1112.3523 (2011)

Ján Manuch, Ladislav Stacho, Christine Stoll: Two Lower Bounds for Self-Assemblies at Temperature 1. Journal of Computational Biology 17(6): 841-852 (2010)

Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring via Galled-Tree Networks Is NP-Complete. Journal of Computational Biology 17(10): 1435-1449 (2010)

Daniel Král', Ladislav Stacho: Coloring plane graphs with independent crossings. Journal of Graph Theory 64(3): 184-205 (2010)

Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264

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. COCOA (2) 2010: 72-86

Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho: Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. COCOA (1) 2010: 385-397

Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon: An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119

Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho: Maximum Interference of Random Sensors on a Line. SIROCCO 2010: 197-210

Evangelos Kranakis, Oscar Morales Ponce, Ladislav Stacho: Strong Orientations of Planar Graphs with Bounded Stretch Factor. SIROCCO 2010: 224-236

Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho: A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model. CoRR abs/1007.2120 (2010)

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discrete Applied Mathematics 157(10): 2310-2324 (2009)

Arthur L. Liestman, Dana S. Richards, Ladislav Stacho: Broadcasting from multiple originators. Discrete Applied Mathematics 157(13): 2886-2891 (2009)

Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho: The Odd-Distance Plane Graph. Discrete & Computational Geometry 42(2): 132-141 (2009)

Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in tori. Discrete Mathematics 309(8): 2239-2249 (2009)

Peter Horák, Ladislav Stacho: Preface. Discrete Mathematics 309(18): 5509 (2009)

Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho: Spanning cubic graph designs. Discrete Mathematics 309(18): 5781-5788 (2009)

Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115

Ján Manuch, Ladislav Stacho, Christine Stoll: Step-Assembly with a Constant Number of Tile Types. ISAAC 2009: 954-963

Ján Manuch, Ladislav Stacho, Christine Stoll: Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809

Evangelos Kranakis, Tim Mott, Ladislav Stacho: Constant memory routing in quasi-planar and quasi-polyhedral graphs. Discrete Applied Mathematics 156(18): 3430-3442 (2008)

Daniel Král, Ladislav Stacho: Hamiltonian threshold for strong products of graphs. Journal of Graph Theory 58(4): 314-328 (2008)

Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete Math. 22(2): 832-847 (2008)

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298

Jurek Czyzowicz, Stefan Dobrev, Hernán 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

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. Discrete Applied Mathematics 155(6-7): 759-787 (2007)

Daniel Král, Ladislav Stacho: Closure for the property of having a hamiltonian prism. Journal of Graph Theory 54(3): 209-220 (2007)

Tomás Kaiser, Daniel Král, Ladislav Stacho: Tough spiders. Journal of Graph Theory 56(1): 23-40 (2007)

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132

Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho: Characterization of the Existence of Galled-tree Networks. J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006)

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)

Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306

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

Evangelos Kranakis, Tim Mott, Ladislav Stacho: Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. PerCom Workshops 2006: 426-430

Ladislav Stacho, Dávid Szeszlér: On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discrete Mathematics 292(1-3): 159-165 (2005)

Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics 296(2-3): 167-186 (2005)

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)

Arvind Gupta, Ján Manuch, Ladislav Stacho: Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. Journal of Computational Biology 12(10): 1328-1345 (2005)

Luis A. Goddyn, Ladislav Stacho: Edge disjoint cycles through specified vertices. Journal of Graph Theory 50(3): 246-260 (2005)

Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho: (quasi) Spanners for Mobile Ad Hoc Networks. Journal of Interconnection Networks 6(2): 63-84 (2005)

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

Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning spiders and light-splitting switches. Discrete Mathematics 285(1-3): 83-95 (2004)

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)

Ladislav Stacho, Jozef Sirán, Sanming Zhou: Routing balanced communications on hamilton decomposable networks. Parallel Processing Letters 14(3-4): 377-385 (2004)

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

Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243

Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318

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

Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208

Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Factor d-domatic colorings of graphs. Discrete Mathematics 262(1-3): 17-25 (2003)

Ján Manuch, Ladislav Stacho: On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. ITA 37(3): 255-270 (2003)

Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365

Ladislav Stacho: New upper bounds for the chromatic number of a graph. Journal of Graph Theory 36(2): 117-120 (2001)

Ladislav Stacho: Cycles through specified vertices in 1-tough graphs. Ars Comb. 56 (2000)

Peter Horák, Ladislav Stacho: A lower bound on the number of hamiltonian cycles. Discrete Mathematics 222(1-3): 275-280 (2000)

Ladislav Stacho, Imrich Vrto: Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29(5): 1621-1629 (2000)

Ladislav Stacho: Locally Pancyclic Graphs. J. Comb. Theory, Ser. B 76(1): 22-40 (1999)

Ladislav Stacho: Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. Ars Comb. 48 (1998)

Ladislav Stacho, Imrich Vrto: Bisection Width of Transposition Graphs. Discrete Applied Mathematics 84(1-3): 221-235 (1998)

Ladislav Stacho: A sufficient condition guaranteeing large cycles in graphs. Discrete Mathematics 169(1-3): 273-277 (1997)

Ladislav Stacho: Maximally non-hamiltonian graphs of girth 7. Graphs and Combinatorics 12(1): 361-371 (1996)

Ladislav Stacho, Imrich Vrto: Virtual Path Layout for Some Bounded Degree Networks. SIROCCO 1996: 269-178