Ladislav Stacho

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 24

Top Venues

CoRR

J. Graph Theory

Algorithmica

Graphs Comb.

Publications

Peter Bradshaw, Alexander Clow, Ladislav Stacho
Cornering Robots to Synchronize a DFA. CoRR (2024)
Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
On the cop number of graphs of high girth. J. Graph Theory 102 (1) (2023)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. 36 (2) (2022)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory 101 (4) (2022)
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
From One to Many Rainbow Hamiltonian Cycles. Graphs Comb. 38 (6) (2022)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. CoRR (2021)
Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. 282 (2020)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR (2020)
Masood Masjoody, Ladislav Stacho
Cops and robbers on graphs with a set of forbidden induced subgraphs. Theor. Comput. Sci. 839 (2020)
Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
On the cop number of graphs of high girth. CoRR (2020)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. Algorithmica 82 (4) (2020)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC (2020)
Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho
Traversal with Enumeration of Geometric Graphs in Bounded Space. J. Interconnect. Networks 19 (4) (2019)
Masood Masjoody, Ladislav Stacho
Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs. CoRR (2018)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. CIAC (2017)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. CoRR (2017)
Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models. Algorithmica 79 (3) (2017)
Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) (2017)
Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Connectivity with directional antennas in the symmetric communication model. Comput. Geom. 55 (2016)
David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. 7 (2) (2016)
Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CPM (2015)
Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CoRR (2015)
Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG (2015)
Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
Monitoring the Plane with Rotating Radars. Graphs Comb. 31 (2) (2015)
Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR (2014)
Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho
Strongly connected orientations of plane graphs. Discret. Appl. Math. 161 (1-2) (2013)
Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho
The robber strikes back. CoRR (2013)
Javad Safaei, Ján Manuch, Ladislav Stacho
Learning Polytrees with Constant Number of Roots from Data. Australasian Conference on Artificial Intelligence (2013)
Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho
Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33 (3) (2012)
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. Discret. Math. Algorithms Appl. 4 (3) (2012)
Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. Discret. Math. Algorithms Appl. 4 (3) (2012)
Bahar Behsaz, Ján Manuch, Ladislav Stacho
Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA (2012)
Ján Manuch, Ladislav Stacho, Christine Stoll
Step-wise tile assembly with a constant number of tile types. Nat. Comput. 11 (3) (2012)
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)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. 19 (4) (2012)
Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26 (3) (2012)
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 (2011)
Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10 (1) (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) (2011)
Ahmad Mahmoody-Ghaidary, Cédric Chauve, Ladislav Stacho
Tractability results for the Double-Cut-and-Join circular median problem CoRR (2011)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Evolutionary Conservation of Human Phosphorylation Sites. BIBM (2011)
Ján Manuch, Ladislav Stacho, Christine Stoll
Two Lower Bounds for Self-Assemblies at Temperature 1. J. Comput. Biol. 17 (6) (2010)
Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. COCOA (1) (2010)
Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. 17 (10) (2010)
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)
Daniel Král', Ladislav Stacho
Coloring plane graphs with independent crossings. J. Graph Theory 64 (3) (2010)
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)
Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho
Strong Orientations of Planar Graphs with Bounded Stretch Factor. SIROCCO (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)
Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho
Maximum Interference of Random Sensors on a Line. SIROCCO (2010)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Prediction of human protein kinase substrate specificities. BIBM (2010)
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 (2010)
Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho
The Odd-Distance Plane Graph. Discret. Comput. Geom. 42 (2) (2009)
Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho
Spanning cubic graph designs. Discret. Math. 309 (18) (2009)
Ján Manuch, Ladislav Stacho, Christine Stoll
Step-Assembly with a Constant Number of Tile Types. ISAAC (2009)
Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in tori. Discret. Math. 309 (8) (2009)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. 157 (10) (2009)
Ján Manuch, Ladislav Stacho, Christine Stoll
Two lower bounds for self-assemblies at temperature 1. SAC (2009)
Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA (2009)
Arthur L. Liestman, Dana S. Richards, Ladislav Stacho
Broadcasting from multiple originators. Discret. Appl. Math. 157 (13) (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)
Peter Horák, Ladislav Stacho
Preface. Discret. Math. 309 (18) (2009)
Daniel Král, Ladislav Stacho
Hamiltonian threshold for strong products of graphs. J. Graph Theory 58 (4) (2008)
Evangelos Kranakis, Tim Mott, Ladislav Stacho
Constant memory routing in quasi-planar and quasi-polyhedral graphs. Discret. Appl. Math. 156 (18) (2008)
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)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON (2008)
Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
On the Complexity of Ordered Colorings. SIAM J. Discret. Math. 22 (2) (2008)
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. Discret. Appl. Math. 155 (6-7) (2007)
Tomás Kaiser, Daniel Král, Ladislav Stacho
Tough spiders. J. Graph Theory 56 (1) (2007)
Daniel Král, Ladislav Stacho
Closure for the property of having a hamiltonian prism. J. Graph Theory 54 (3) (2007)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA (2007)
Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
Characterization of the Existence of Galled-Tree Networks. APBC (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) (2006)
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)
Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4 (6) (2006)
Evangelos Kranakis, Tim Mott, Ladislav Stacho
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. PerCom Workshops (2006)
Ladislav Stacho, Dávid Szeszlér
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discret. Math. 292 (1-3) (2005)
Luis A. Goddyn, Ladislav Stacho
Edge disjoint cycles through specified vertices. J. Graph Theory 50 (3) (2005)
Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho
(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks 6 (2) (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)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Ordered 3-colorings. Electron. Notes Discret. Math. 22 (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12 (10) (2005)
Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. 296 (2-3) (2005)
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)
Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks 5 (4) (2004)
Ladislav Stacho, Jozef Sirán, Sanming Zhou
Routing balanced communications on hamilton decomposable networks. Parallel Process. Lett. 14 (3-4) (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
Small Phylogeny Problem: Character Evolution Trees. CPM (2004)
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)
Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
Spanning spiders and light-splitting switches. Discret. Math. 285 (1-3) (2004)
Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
-domatic colorings of graphs. Discret. Math. 262 (1-3) (2003)
Ján Manuch, Ladislav Stacho
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. RAIRO Theor. Informatics Appl. 37 (3) (2003)
Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
Spanning Trees with Bounded Number of Branch Vertices. ICALP (2002)
Ladislav Stacho
New upper bounds for the chromatic number of a graph. J. Graph Theory 36 (2) (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. Discret. Math. 222 (1-3) (2000)
Ladislav Stacho, Imrich Vrto
Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29 (5) (2000)
Ladislav Stacho
Locally Pancyclic Graphs. J. Comb. Theory, Ser. B 76 (1) (1999)
Ladislav Stacho, Imrich Vrto
Bisection Width of Transposition Graphs. Discret. Appl. Math. 84 (1-3) (1998)

Ladislav Stacho.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ladislav Stacho