| Publication | Date of Publication | Type |
|---|
Hamiltonicity of covering graphs of trees
Discrete Applied Mathematics | 2024-09-26 | Paper |
From one to many rainbow Hamiltonian cycles
Graphs and Combinatorics | 2022-11-29 | Paper |
Robust connectivity of graphs on surfaces
SIAM Journal on Discrete Mathematics | 2022-06-23 | Paper |
Hamiltonicity of covering graphs of trees
| 2022-06-11 | Paper |
From one to many rainbow Hamiltonian cycles
| 2021-04-14 | Paper |
Cops and robbers on graphs with a set of forbidden induced subgraphs
Theoretical Computer Science | 2020-09-03 | Paper |
Hamiltonian cycles in covering graphs of trees
Discrete Applied Mathematics | 2020-06-05 | Paper |
Weak coverage of a rectangular barrier
Algorithmica | 2020-02-28 | Paper |
Traversal with Enumeration of Geometric Graphs in Bounded Space
| 2018-11-10 | Paper |
Constructing Geometric Graphs of Cop Number Three
| 2018-11-10 | Paper |
Hamiltonian cycles in covering graphs of trees
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models
Algorithmica | 2017-11-09 | Paper |
Pattern overlap implies runaway growth in hierarchical tile systems
| 2017-10-10 | Paper |
Weak coverage of a rectangular barrier
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Pattern overlap implies runaway growth in hierarchical tile systems
| 2017-03-30 | Paper |
Combinatorial RNA design: designability and structure-approximating algorithm
Combinatorial Pattern Matching | 2015-08-20 | Paper |
The robber strikes back
| 2013-08-13 | Paper |
Min-max relations for odd cycles in planar graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Strongly connected orientations of plane graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Step-wise tile assembly with a constant number of tile types
Natural Computing | 2012-11-15 | Paper |
Turing universality of step-wise and stage assembly at temperature 1
Lecture Notes in Computer Science | 2012-11-06 | Paper |
STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Bounded length, 2-edge augmentation of geometric planar graphs
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Cyclic colorings of plane graphs with independent faces
European Journal of Combinatorics | 2012-02-11 | Paper |
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
Natural Computing | 2011-05-23 | Paper |
Strong connectivity in sensor networks with given number of directional antennae of bounded angle
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Bounded length, 2-edge augmentation of geometric planar graphs
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Coloring plane graphs with independent crossings
Journal of Graph Theory | 2010-11-10 | Paper |
Strong orientations of planar graphs with bounded stretch factor
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Maximum interference of random sensors on a line
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Broadcasting from multiple originators
Discrete Applied Mathematics | 2010-04-28 | Paper |
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Lecture Notes in Computer Science | 2010-01-07 | Paper |
Step-assembly with a constant number of tile types
Algorithms and Computation | 2009-12-17 | Paper |
Spanning cubic graph designs
Discrete Mathematics | 2009-12-15 | Paper |
The odd-distance plane graph
Discrete & Computational Geometry | 2009-07-24 | Paper |
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
Discrete Applied Mathematics | 2009-06-24 | Paper |
Edge-disjoint spanners in tori
Discrete Mathematics | 2009-06-19 | Paper |
Hamiltonian threshold for strong products of graphs
Journal of Graph Theory | 2009-06-04 | Paper |
On the Complexity of Ordered Colorings
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Constant memory routing in quasi-planar and quasi-polyhedral graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Tough spiders
Journal of Graph Theory | 2008-01-04 | Paper |
Ordered 3-colorings
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model
Discrete Applied Mathematics | 2007-04-18 | Paper |
Closure for the property of having a hamiltonian prism
Journal of Graph Theory | 2007-03-20 | Paper |
Fault tolerant forwarding and optical indexes: A design theory approach
Journal of Combinatorial Designs | 2006-03-24 | Paper |
Edge disjoint cycles through specified vertices
Journal of Graph Theory | 2005-12-08 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Edge-disjoint spanners in Cartesian products of graphs
Discrete Mathematics | 2005-08-17 | Paper |
On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
Discrete Mathematics | 2005-04-28 | Paper |
scientific article; zbMATH DE number 2099158 (Why is no real title available?)
| 2004-09-07 | Paper |
Spanning spiders and light-splitting switches
Discrete Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2086635 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2051830 (Why is no real title available?)
| 2004-03-07 | Paper |
Factor \(d\)-domatic colorings of graphs
Discrete Mathematics | 2003-04-28 | Paper |
scientific article; zbMATH DE number 1865919 (Why is no real title available?)
| 2003-02-10 | Paper |
scientific article; zbMATH DE number 1792643 (Why is no real title available?)
| 2002-08-29 | Paper |
New upper bounds for the chromatic number of a graph
| 2001-10-21 | Paper |
Non-isomorphic smallest maximally non-Hamiltonian graphs
Ars Combinatoria | 2001-05-30 | Paper |
A lower bound on the number of hamiltonian cycles
Discrete Mathematics | 2001-03-30 | Paper |
scientific article; zbMATH DE number 1509533 (Why is no real title available?)
| 2000-09-25 | Paper |
A new Chvátal type condition for pancyclicity
Graphs and Combinatorics | 2000-06-21 | Paper |
Virtual Path Layouts in ATM Networks
SIAM Journal on Computing | 2000-03-19 | Paper |
Locally pancyclic graphs
Journal of Combinatorial Theory. Series B | 2000-01-11 | Paper |
Bisection width of transposition graphs
Discrete Applied Mathematics | 1998-12-10 | Paper |
A sufficient condition guaranteeing large cycles in graphs
Discrete Mathematics | 1997-11-04 | Paper |
Old Hamiltonian Ideas from a New Point of View
Mathematische Nachrichten | 1997-10-08 | Paper |
Maximally non-hamiltonian graphs of girth 7
Graphs and Combinatorics | 1997-07-20 | Paper |
scientific article; zbMATH DE number 927056 (Why is no real title available?)
| 1997-05-04 | Paper |
scientific article; zbMATH DE number 894357 (Why is no real title available?)
| 1996-09-29 | Paper |
scientific article; zbMATH DE number 825130 (Why is no real title available?)
| 1996-05-13 | Paper |
scientific article; zbMATH DE number 772776 (Why is no real title available?)
| 1995-07-12 | Paper |
scientific article; zbMATH DE number 745299 (Why is no real title available?)
| 1995-04-18 | Paper |
Oriented Colouring Graphs of Bounded Degree and Degeneracy
| N/A | Paper |
Cornering Robots to Synchronize a DFA
| N/A | Paper |
