Ladislav Stacho

According to our database, Ladislav Stacho authored at least 89 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On the cop number of graphs of high girth.

Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho

J. Graph Theory, 2023

2022

Robust Connectivity of Graphs on Surfaces.

Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho

SIAM J. Discret. Math., 2022

Flexible list colorings in graphs with special degeneracy conditions.

Peter Bradshaw, Tomás Masarík, Ladislav Stacho

J. Graph Theory, 2022

From One to Many Rainbow Hamiltonian Cycles.

Peter Bradshaw, Kevin Halasz, Ladislav Stacho

Graphs Comb., 2022

2020

Cops and robbers on graphs with a set of forbidden induced subgraphs.

Masood Masjoody, Ladislav Stacho

Theor. Comput. Sci., 2020

Hamiltonian cycles in covering graphs of trees.

Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho

Discret. Appl. Math., 2020

Weak Coverage of a Rectangular Barrier.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho

Algorithmica, 2020

2019

Traversal with Enumeration of Geometric Graphs in Bounded Space.

Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho

J. Interconnect. Networks, 2019

2017

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models.

Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho

Algorithmica, 2017

Weak Coverage of a Rectangular Barrier.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Pattern overlap implies runaway growth in hierarchical tile systems.

David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho

J. Comput. Geom., 2016

Connectivity with directional antennas in the symmetric communication model.

Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho

Comput. Geom., 2016

2015

Monitoring the Plane with Rotating Radars.

Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

Graphs Comb., 2015

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm.

Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2013

Strongly connected orientations of plane graphs.

Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho

Discret. Appl. Math., 2013

The robber strikes back.

Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho

CoRR, 2013

Learning Polytrees with Constant Number of Roots from Data.

Javad Safaei, Ján Manuch, Ladislav Stacho

Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

2012

Min-Max Relations for Odd Cycles in Planar Graphs.

Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho

SIAM J. Discret. Math., 2012

Step-wise tile assembly with a constant number of tile types.

Ján Manuch, Ladislav Stacho, Christine Stoll

Nat. Comput., 2012

Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

J. Comput. Biol., 2012

Cyclic colorings of plane graphs with independent faces.

Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho

Eur. J. Comb., 2012

Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs.

Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho

Discret. Math. Algorithms Appl., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho

Discret. Math. Algorithms Appl., 2012

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Turing Universality of Step-Wise and Stage Assembly at Temperature 1.

Bahar Behsaz, Ján Manuch, Ladislav Stacho

Proceedings of the DNA Computing and Molecular Programming - 18th International Conference, 2012

2011

Local 7-coloring for planar subgraphs of unit disk graphs.

Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

Theor. Comput. Sci., 2011

NP-completeness of the energy barrier problem without pseudoknots and temporary arcs.

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon

Nat. Comput., 2011

Tractability results for the Double-Cut-and-Join circular median problem

Ahmad Mahmoody-Ghaidary, Cédric Chauve, Ladislav Stacho

CoRR, 2011

Evolutionary Conservation of Human Phosphorylation Sites.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

Coloring plane graphs with independent crossings.

Daniel Král', Ladislav Stacho

J. Graph Theory, 2010

Two Lower Bounds for Self-Assemblies at Temperature 1.

Ján Manuch, Ladislav Stacho, Christine Stoll

J. Comput. Biol., 2010

Haplotype Inferring via Galled-Tree Networks Is NP-Complete.

Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

J. Comput. Biol., 2010

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model

Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho

CoRR, 2010

Strong Orientations of Planar Graphs with Bounded Stretch Factor.

Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho

Proceedings of the Structural Information and Communication Complexity, 2010

Maximum Interference of Random Sensors on a Line.

Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho

Proceedings of the Structural Information and Communication Complexity, 2010

An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs.

Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon

Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

Prediction of human protein kinase substrate specificities.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.

Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani

Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009

Edge-disjoint spanners in tori.

Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2009

Preface.

Peter Horák, Ladislav Stacho

Discret. Math., 2009

Spanning cubic graph designs.

Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho

Discret. Math., 2009

The Odd-Distance Plane Graph.

Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho

Discret. Comput. Geom., 2009

Broadcasting from multiple originators.

Arthur L. Liestman, Dana S. Richards, Ladislav Stacho

Discret. Appl. Math., 2009

Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Discret. Appl. Math., 2009

Step-Assembly with a Constant Number of Tile Types.

Ján Manuch, Ladislav Stacho, Christine Stoll

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots.

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon

Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.

Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani

Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008

On the Complexity of Ordered Colorings.

Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

SIAM J. Discret. Math., 2008

Hamiltonian threshold for strong products of graphs.

Daniel Král, Ladislav Stacho

J. Graph Theory, 2008

Constant memory routing in quasi-planar and quasi-polyhedral graphs.

Evangelos Kranakis, Tim Mott, Ladislav Stacho

Discret. Appl. Math., 2008

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Closure for the property of having a hamiltonian prism.

Daniel Král, Ladislav Stacho

J. Graph Theory, 2007

Tough spiders.

Tomás Kaiser, Daniel Král, Ladislav Stacho

J. Graph Theory, 2007

Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model.

Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho

Discret. Appl. Math., 2007

Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2006

Route discovery with constant memory in oriented planar geometric networks.

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

Networks, 2006

Characterization of the Existence of Galled-tree Networks.

Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho

J. Bioinform. Comput. Biol., 2006

Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs.

Evangelos Kranakis, Tim Mott, Ladislav Stacho

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Routing and Traversal via Location Awareness in Ad Hoc Networks.

Evangelos Kranakis, Ladislav Stacho

Proceedings of the Handbook of Algorithms for Wireless Networking and Mobile Computing., 2005

(quasi) Spanners for Mobile Ad Hoc Networks.

Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho

J. Interconnect. Networks, 2005

Edge disjoint cycles through specified vertices.

Luis A. Goddyn, Ladislav Stacho

J. Graph Theory, 2005

Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model.

Arvind Gupta, Ján Manuch, Ladislav Stacho

J. Comput. Biol., 2005

Ordered 3-colorings.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Electron. Notes Discret. Math., 2005

On a generalization of Chva'tal's condition giving new hamiltonian degree sequences.

Ladislav Stacho, Dávid Szeszlér

Discret. Math., 2005

Edge-disjoint spanners in Cartesian products of graphs.

Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2005

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004

Routing balanced communications on hamilton decomposable networks.

Ladislav Stacho, Jozef Sirán, Sanming Zhou

Parallel Process. Lett., 2004

Traversal of a quasi-planar subdivision without using mark bits.

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

J. Interconnect. Networks, 2004

Spanning spiders and light-splitting switches.

Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro

Discret. Math., 2004

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the Structural Information and Communication Complexity, 2004

Inverse Protein Folding in 2D HP Mode (Extended Abstract).

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Small Phylogeny Problem: Character Evolution Trees.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes.

Ján Manuch, Ladislav Stacho

RAIRO Theor. Informatics Appl., 2003

Factor <i>d</i>-domatic colorings of graphs.

Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2003

2002

Spanning Trees with Bounded Number of Branch Vertices.

Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

New upper bounds for the chromatic number of a graph.

Ladislav Stacho

J. Graph Theory, 2001

2000

Virtual Path Layouts in ATM Networks.

Ladislav Stacho, Imrich Vrto

SIAM J. Comput., 2000

A lower bound on the number of hamiltonian cycles.

Peter Horák, Ladislav Stacho

Discret. Math., 2000

Cycles through specified vertices in 1-tough graphs.

Ladislav Stacho

Ars Comb., 2000

1999

Locally Pancyclic Graphs.

Ladislav Stacho

J. Comb. Theory, Ser. B, 1999

1998

Bisection Width of Transposition Graphs.

Ladislav Stacho, Imrich Vrto

Discret. Appl. Math., 1998

Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs.

Ladislav Stacho

Ars Comb., 1998

1997

A New Chvátal Type Condition for Pancyclicity.

Ladislav Stacho

Graphs Comb., 1997

A sufficient condition guaranteeing large cycles in graphs.

Ladislav Stacho

Discret. Math., 1997

1996

Maximally non-hamiltonian graphs of girth 7.

Ladislav Stacho

Graphs Comb., 1996

Virtual Path Layout for Some Bounded Degree Networks.

Ladislav Stacho, Imrich Vrto

Proceedings of the SIROCCO'96, 1996

1995

On minimal outerplanar graphs of given diameter.

Ladislav Stacho

Australas. J Comb., 1995

Bisection widths of transposition graphs.

Ladislav Stacho, Imrich Vrt'o

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995