Ladislav Stacho

111 papers A* 2A 1B 15C 3Misc 3Journal 74Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A cornering strategy for synchronizing a DFA. Theor. Comput. Sci. Peter Bradshaw, Alexander Clow, Ladislav Stacho
2026	J	`jnl`	Oriented colouring graphs of bounded degree and degeneracy. Discret. Math. Alexander Clow, Ladislav Stacho
2024	J	`jnl`	Cornering Robots to Synchronize a DFA. CoRR Peter Bradshaw, Alexander Clow, Ladislav Stacho
2023	J	`jnl`	On the cop number of graphs of high girth. J. Graph Theory Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
2022	J	`jnl`	Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2022	J	`jnl`	From One to Many Rainbow Hamiltonian Cycles. Graphs Comb. Peter Bradshaw, Kevin Halasz, Ladislav Stacho
2022	J	`jnl`	Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2021	J	`jnl`	Robust Connectivity of Graphs on Surfaces. CoRR Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2020	J	`jnl`	Cops and robbers on graphs with a set of forbidden induced subgraphs. Theor. Comput. Sci. Masood Masjoody, Ladislav Stacho
2020	B	`conf`	Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2020	J	`jnl`	Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2020	J	`jnl`	Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
2020	J	`jnl`	On the cop number of graphs of high girth. CoRR Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
2020	J	`jnl`	Weak Coverage of a Rectangular Barrier. Algorithmica Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
2019	J	`jnl`	Traversal with Enumeration of Geometric Graphs in Bounded Space. J. Interconnect. Networks Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho
2018	J	`jnl`	Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs. CoRR Masood Masjoody, Ladislav Stacho
2017	J	`jnl`	Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models. Algorithmica Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho
2017	—	`conf`	Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
2017	C	`conf`	Weak Coverage of a Rectangular Barrier. CIAC Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho
2017	J	`jnl`	Weak Coverage of a Rectangular Barrier. CoRR Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
2016	J	`jnl`	Connectivity with directional antennas in the symmetric communication model. Comput. Geom. Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
2016	J	`jnl`	Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho
2015	B	`conf`	Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CPM Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
2015	J	`jnl`	Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CoRR Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
2015	J	`jnl`	Monitoring the Plane with Rotating Radars. Graphs Comb. Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2015	A*	`conf`	Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
2014	J	`jnl`	Pattern overlap implies runaway growth in hierarchical tile systems. CoRR Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
2013	—	`conf`	Learning Polytrees with Constant Number of Roots from Data. Australasian Conference on Artificial Intelligence Javad Safaei, Ján Manuch, Ladislav Stacho
2013	J	`jnl`	Strongly connected orientations of plane graphs. Discret. Appl. Math. Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho
2013	J	`jnl`	The robber strikes back. CoRR Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho
2012	J	`jnl`	Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2012	B	`conf`	Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. LATIN Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
2012	J	`jnl`	Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. Discret. Math. Algorithms Appl. Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
2012	J	`jnl`	Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho
2012	J	`jnl`	Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho
2012	J	`jnl`	Step-wise tile assembly with a constant number of tile types. Nat. Comput. Ján Manuch, Ladislav Stacho, Christine Stoll
2012	J	`jnl`	Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. Discret. Math. Algorithms Appl. Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho
2012	B	`conf`	Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA Bahar Behsaz, Ján Manuch, Ladislav Stacho
2011	J	`jnl`	Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points CoRR Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
2011	—	`conf`	Evolutionary Conservation of Human Phosphorylation Sites. BIBM Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
2011	J	`jnl`	Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2011	J	`jnl`	NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
2011	J	`jnl`	Tractability results for the Double-Cut-and-Join circular median problem CoRR Ahmad Mahmoody-Ghaidary, Cédric Chauve, Ladislav Stacho
2010	J	`jnl`	A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model CoRR Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho
2010	Misc	`conf`	An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon
2010	—	`conf`	Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. COCOA (1) Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho
2010	J	`jnl`	Coloring plane graphs with independent crossings. J. Graph Theory Daniel Král', Ladislav Stacho
2010	J	`jnl`	Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2010	B	`conf`	Maximum Interference of Random Sensors on a Line. SIROCCO Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho
2010	—	`conf`	On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani
2010	—	`conf`	Prediction of human protein kinase substrate specificities. BIBM Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
2010	—	`conf`	Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho
2010	B	`conf`	Strong Orientations of Planar Graphs with Bounded Stretch Factor. SIROCCO Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho
2010	J	`jnl`	Two Lower Bounds for Self-Assemblies at Temperature 1. J. Comput. Biol. Ján Manuch, Ladislav Stacho, Christine Stoll
2009	J	`jnl`	Broadcasting from multiple originators. Discret. Appl. Math. Arthur L. Liestman, Dana S. Richards, Ladislav Stacho
2009	J	`jnl`	Edge-disjoint spanners in tori. Discret. Math. Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2009	J	`jnl`	Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2009	B	`conf`	NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
2009	—	`conf`	On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani
2009	J	`jnl`	Preface. Discret. Math. Peter Horák, Ladislav Stacho
2009	J	`jnl`	Spanning cubic graph designs. Discret. Math. Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho
2009	B	`conf`	Step-Assembly with a Constant Number of Tile Types. ISAAC Ján Manuch, Ladislav Stacho, Christine Stoll
2009	J	`jnl`	The Odd-Distance Plane Graph. Discret. Comput. Geom. Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho
2009	Misc	`conf`	Two lower bounds for self-assemblies at temperature 1. SAC Ján Manuch, Ladislav Stacho, Christine Stoll
2008	J	`jnl`	Constant memory routing in quasi-planar and quasi-polyhedral graphs. Discret. Appl. Math. Evangelos Kranakis, Tim Mott, Ladislav Stacho
2008	J	`jnl`	Hamiltonian threshold for strong products of graphs. J. Graph Theory Daniel Král, Ladislav Stacho
2008	Misc	`conf`	Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2008	C	`conf`	Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2008	J	`jnl`	On the Complexity of Ordered Colorings. SIAM J. Discret. Math. Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2007	—	`conf`	Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2007	J	`jnl`	Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model. Discret. Appl. Math. Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho
2007	J	`jnl`	Closure for the property of having a hamiltonian prism. J. Graph Theory Daniel Král, Ladislav Stacho
2007	J	`jnl`	Tough spiders. J. Graph Theory Tomás Kaiser, Daniel Král, Ladislav Stacho
2006	B	`conf`	Characterization of the Existence of Galled-Tree Networks. APBC Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
2006	J	`jnl`	Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
2006	B	`conf`	Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2006	—	`conf`	Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. PerCom Workshops Evangelos Kranakis, Tim Mott, Ladislav Stacho
2006	J	`jnl`	Route discovery with constant memory in oriented planar geometric networks. Networks Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2005	J	`jnl`	(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho
2005	J	`jnl`	Edge disjoint cycles through specified vertices. J. Graph Theory Luis A. Goddyn, Ladislav Stacho
2005	J	`jnl`	Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2005	B	`conf`	Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia
2005	J	`jnl`	On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discret. Math. Ladislav Stacho, Dávid Szeszlér
2005	J	`jnl`	Ordered 3-colorings. Electron. Notes Discret. Math. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2005	—	`ch.`	Routing and Traversal via Location Awareness in Ad Hoc Networks. Handbook of Algorithms for Wireless Networking and Mobile Computing Evangelos Kranakis, Ladislav Stacho
2005	J	`jnl`	Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	B	`conf`	Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	—	`conf`	Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	C	`conf`	Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2004	J	`jnl`	Routing balanced communications on hamilton decomposable networks. Parallel Process. Lett. Ladislav Stacho, Jozef Sirán, Sanming Zhou
2004	B	`conf`	Small Phylogeny Problem: Character Evolution Trees. CPM Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
2004	J	`jnl`	Spanning spiders and light-splitting switches. Discret. Math. Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2004	A	`conf`	Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia
2004	J	`jnl`	Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2003	J	`jnl`	Factor Discret. Math. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003	J	`jnl`	On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. RAIRO Theor. Informatics Appl. Ján Manuch, Ladislav Stacho
2002	A*	`conf`	Spanning Trees with Bounded Number of Branch Vertices. ICALP Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2001	J	`jnl`	New upper bounds for the chromatic number of a graph. J. Graph Theory Ladislav Stacho
2000	J	`jnl`	A lower bound on the number of hamiltonian cycles. Discret. Math. Peter Horák, Ladislav Stacho
2000	J	`jnl`	Cycles through specified vertices in 1-tough graphs. Ars Comb. Ladislav Stacho
2000	J	`jnl`	Virtual Path Layouts in ATM Networks. SIAM J. Comput. Ladislav Stacho, Imrich Vrto
1999	B	`conf`	Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO Ján Manuch, Ladislav Stacho
1999	J	`jnl`	Locally Pancyclic Graphs. J. Comb. Theory B Ladislav Stacho
1998	J	`jnl`	Bisection Width of Transposition Graphs. Discret. Appl. Math. Ladislav Stacho, Imrich Vrto
1998	J	`jnl`	Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. Ars Comb. Ladislav Stacho
1997	J	`jnl`	A New Chvátal Type Condition for Pancyclicity. Graphs Comb. Ladislav Stacho
1997	J	`jnl`	A sufficient condition guaranteeing large cycles in graphs. Discret. Math. Ladislav Stacho
1996	J	`jnl`	Maximally non-hamiltonian graphs of girth 7. Graphs Comb. Ladislav Stacho
1996	B	`conf`	Virtual Path Layout for Some Bounded Degree Networks. SIROCCO Ladislav Stacho, Imrich Vrto
1995	—	`conf`	Bisection widths of transposition graphs. SPDP Ladislav Stacho, Imrich Vrt'o
1995	J	`jnl`	On minimal outerplanar graphs of given diameter. Australas. J Comb. Ladislav Stacho