Ladislav Stacho

Alexander Clow

CoRR, 2024

2023

On the cop number of graphs of high girth.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Bojan Mohar

J. Graph Theory, 2023

2022

Robust Connectivity of Graphs on Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Flexible list colorings in graphs with special degeneracy conditions.

[BibT_eX]

[DOI]

Tomás Masarík

J. Graph Theory, 2022

From One to Many Rainbow Hamiltonian Cycles.

[BibT_eX]

[DOI]

Kevin Halasz

Graphs Comb., 2022

2020

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

[BibT_eX]

[DOI]

Masood Masjoody

Theor. Comput. Sci., 2020

Hamiltonian cycles in covering graphs of trees.

[BibT_eX]

[DOI]

Pavol Hell

Hiroshi Nishiyama

Discret. Appl. Math., 2020

Weak Coverage of a Rectangular Barrier.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Traversal with Enumeration of Geometric Graphs in Bounded Space.

[BibT_eX]

[DOI]

Sahand Khakabimamaghani

Masood Masjoody

J. Interconnect. Networks, 2019

2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

Weak Coverage of a Rectangular Barrier.

[BibT_eX]

[DOI]

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

2016

Pattern overlap implies runaway growth in hierarchical tile systems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Connectivity with directional antennas in the symmetric communication model.

[BibT_eX]

[DOI]

Stefan Dobrev

Mohsen Eftekhari Hesari

Comput. Geom., 2016

2015

Monitoring the Plane with Rotating Radars.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm.

[BibT_eX]

[DOI]

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

2013

Strongly connected orientations of plane graphs.

[BibT_eX]

[DOI]

Oscar Morales-Ponce

Discret. Appl. Math., 2013

The robber strikes back.

[BibT_eX]

[DOI]

Anthony Bonato

Stephen Finbow

Przemyslaw Gordinowicz

Ali Haidar

William B. Kinnersley

Dieter Mitsche

Pawel Pralat

CoRR, 2013

Learning Polytrees with Constant Number of Roots from Data.

[BibT_eX]

[DOI]

Javad Safaei

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

2012

Min-Max Relations for Odd Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Daniel Král'

Jean-Sébastien Sereni

SIAM J. Discret. Math., 2012

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

[BibT_eX]

[DOI]

Christine Stoll

Nat. Comput., 2012

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

[BibT_eX]

[DOI]

J. Comput. Biol., 2012

Cyclic colorings of plane graphs with independent faces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

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

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

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

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

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

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

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

[BibT_eX]

[DOI]

Bahar Behsaz

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

2011

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

[BibT_eX]

[DOI]

Jurek Czyzowicz

Stefan Dobrev

Hernán González-Aguilar

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Nat. Comput., 2011

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

[BibT_eX]

[DOI]

Ahmad Mahmoody-Ghaidary

Cédric Chauve

CoRR, 2011

Evolutionary Conservation of Human Phosphorylation Sites.

[BibT_eX]

[DOI]

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

2010

Coloring plane graphs with independent crossings.

[BibT_eX]

[DOI]

Daniel Král'

J. Graph Theory, 2010

Two Lower Bounds for Self-Assemblies at Temperature 1.

[BibT_eX]

[DOI]

Christine Stoll

J. Comput. Biol., 2010

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

[BibT_eX]

[DOI]

J. Comput. Biol., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Strong Orientations of Planar Graphs with Bounded Stretch Factor.

[BibT_eX]

[DOI]

Oscar Morales-Ponce

Proceedings of the Structural Information and Communication Complexity, 2010

Maximum Interference of Random Sensors on a Line.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

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

[BibT_eX]

[DOI]

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

Prediction of human protein kinase substrate specificities.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2009

Edge-disjoint spanners in tori.

[BibT_eX]

[DOI]

Arthur L. Liestman

Thomas C. Shermer

Discret. Math., 2009

Preface.

[BibT_eX]

[DOI]

Peter Horák

Discret. Math., 2009

Spanning cubic graph designs.

[BibT_eX]

[DOI]

Discret. Math., 2009

The Odd-Distance Plane Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Broadcasting from multiple originators.

[BibT_eX]

[DOI]

Arthur L. Liestman

Dana S. Richards

Discret. Appl. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Step-Assembly with a Constant Number of Tile Types.

[BibT_eX]

[DOI]

Christine Stoll

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

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2008

On the Complexity of Ordered Colorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Hamiltonian threshold for strong products of graphs.

[BibT_eX]

[DOI]

Daniel Král

J. Graph Theory, 2008

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

[BibT_eX]

[DOI]

Tim Mott

Discret. Appl. Math., 2008

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

[BibT_eX]

[DOI]

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

2007

Closure for the property of having a hamiltonian prism.

[BibT_eX]

[DOI]

Daniel Král

J. Graph Theory, 2007

Tough spiders.

[BibT_eX]

[DOI]

Tomás Kaiser

Daniel Král

J. Graph Theory, 2007

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

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

[BibT_eX]

[DOI]

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

2006

Route discovery with constant memory in oriented planar geometric networks.

[BibT_eX]

[DOI]

Networks, 2006

Characterization of the Existence of Galled-tree Networks.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2006

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

[BibT_eX]

[DOI]

Tim Mott

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Routing and Traversal via Location Awareness in Ad Hoc Networks.

[BibT_eX]

[DOI]

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

(quasi) Spanners for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2005

Edge disjoint cycles through specified vertices.

[BibT_eX]

[DOI]

Luis A. Goddyn

J. Graph Theory, 2005

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

[BibT_eX]

[DOI]

Arvind Gupta

J. Comput. Biol., 2005

Ordered 3-colorings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

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

[BibT_eX]

[DOI]

Dávid Szeszlér

Discret. Math., 2005

Edge-disjoint spanners in Cartesian products of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

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

[BibT_eX]

[DOI]

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

2004

Routing balanced communications on hamilton decomposable networks.

[BibT_eX]

[DOI]

Jozef Sirán

Sanming Zhou

Parallel Process. Lett., 2004

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

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2004

Spanning spiders and light-splitting switches.

[BibT_eX]

[DOI]

Discret. Math., 2004

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

[BibT_eX]

[DOI]

Arvind Gupta

Proceedings of the Structural Information and Communication Complexity, 2004

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

[BibT_eX]

[DOI]

Arvind Gupta

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

Small Phylogeny Problem: Character Evolution Trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

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

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Spanning Trees with Bounded Number of Branch Vertices.

[BibT_eX]

[DOI]

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

2001

New upper bounds for the chromatic number of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

2000

Virtual Path Layouts in ATM Networks.

[BibT_eX]

[DOI]

Imrich Vrto

SIAM J. Comput., 2000

A lower bound on the number of hamiltonian cycles.

[BibT_eX]

[DOI]

Peter Horák

Discret. Math., 2000

Cycles through specified vertices in 1-tough graphs.

[BibT_eX]

Ars Comb., 2000

1999

Locally Pancyclic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

1998

Bisection Width of Transposition Graphs.

[BibT_eX]

[DOI]

Imrich Vrto

Discret. Appl. Math., 1998

Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs.

[BibT_eX]

Ars Comb., 1998

1997

A New Chvátal Type Condition for Pancyclicity.

[BibT_eX]

[DOI]

Graphs Comb., 1997

A sufficient condition guaranteeing large cycles in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Maximally non-hamiltonian graphs of girth 7.

[BibT_eX]

[DOI]

Graphs Comb., 1996

Virtual Path Layout for Some Bounded Degree Networks.

[BibT_eX]

Imrich Vrto

Proceedings of the SIROCCO'96, 1996

1995

On minimal outerplanar graphs of given diameter.

[BibT_eX]

[DOI]

Australas. J Comb., 1995

Bisection widths of transposition graphs.

[BibT_eX]

[DOI]