| Publication | Date of Publication | Type |
|---|
| From one to many rainbow Hamiltonian cycles | 2022-11-29 | Paper |
| Robust Connectivity of Graphs on Surfaces | 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 | 2020-09-03 | Paper |
| Hamiltonian cycles in covering graphs of trees | 2020-06-05 | Paper |
| Weak coverage of a rectangular barrier | 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 | 2018-03-26 | Paper |
| Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models | 2017-11-09 | Paper |
| Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems | 2017-10-10 | Paper |
| Weak coverage of a rectangular barrier | 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 | 2015-08-20 | Paper |
| The robber strikes back | 2013-08-13 | Paper |
| Min-Max Relations for Odd Cycles in Planar Graphs | 2013-01-04 | Paper |
| Strongly connected orientations of plane graphs | 2012-11-22 | Paper |
| Step-wise tile assembly with a constant number of tile types | 2012-11-15 | Paper |
| Turing Universality of Step-Wise and Stage Assembly at Temperature 1 | 2012-11-06 | Paper |
| BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS | 2012-10-15 | Paper |
| STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE | 2012-10-15 | Paper |
| Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points | 2012-06-29 | Paper |
| Cyclic colorings of plane graphs with independent faces | 2012-02-11 | Paper |
| NP-completeness of the energy barrier problem without pseudoknots and temporary arcs | 2011-05-23 | Paper |
| Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle | 2011-01-10 | Paper |
| Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs | 2011-01-08 | Paper |
| Coloring plane graphs with independent crossings | 2010-11-10 | Paper |
| Maximum Interference of Random Sensors on a Line | 2010-06-17 | Paper |
| Strong Orientations of Planar Graphs with Bounded Stretch Factor | 2010-06-17 | Paper |
| Broadcasting from multiple originators | 2010-04-28 | Paper |
| NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots | 2010-01-07 | Paper |
| Step-Assembly with a Constant Number of Tile Types | 2009-12-17 | Paper |
| Spanning cubic graph designs | 2009-12-15 | Paper |
| The odd-distance plane graph | 2009-07-24 | Paper |
| Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices | 2009-06-24 | Paper |
| Edge-disjoint spanners in tori | 2009-06-19 | Paper |
| Hamiltonian threshold for strong products of graphs | 2009-06-04 | Paper |
| On the Complexity of Ordered Colorings | 2009-05-27 | Paper |
| Constant memory routing in quasi-planar and quasi-polyhedral graphs | 2009-03-04 | Paper |
| Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges | 2008-09-18 | Paper |
| Haplotype Inferring Via Galled-Tree Networks Is NP-Complete | 2008-07-10 | Paper |
| Tough spiders | 2008-01-04 | Paper |
| Ordered 3-colorings | 2007-05-29 | Paper |
| Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model | 2007-04-18 | Paper |
| Closure for the property of having a hamiltonian prism | 2007-03-20 | Paper |
| Fault tolerant forwarding and optical indexes: A design theory approach | 2006-03-24 | Paper |
| Edge disjoint cycles through specified vertices | 2005-12-08 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Edge-disjoint spanners in Cartesian products of graphs | 2005-08-17 | Paper |
| On a generalization of Chvátal's condition giving new Hamiltonian degree sequences | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4815691 | 2004-09-07 | Paper |
| Spanning spiders and light-splitting switches | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737170 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453871 | 2004-03-07 | Paper |
| Factor \(d\)-domatic colorings of graphs | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792078 | 2003-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552236 | 2002-08-29 | Paper |
| New upper bounds for the chromatic number of a graph | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715965 | 2001-05-30 | Paper |
| A lower bound on the number of hamiltonian cycles | 2001-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505007 | 2000-09-25 | Paper |
| A new Chvátal type condition for pancyclicity | 2000-06-21 | Paper |
| Virtual Path Layouts in ATM Networks | 2000-03-19 | Paper |
| Locally pancyclic graphs | 2000-01-11 | Paper |
| Bisection width of transposition graphs | 1998-12-10 | Paper |
| A sufficient condition guaranteeing large cycles in graphs | 1997-11-04 | Paper |
| Old Hamiltonian Ideas from a New Point of View | 1997-10-08 | Paper |
| Maximally non-hamiltonian graphs of girth 7 | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892329 | 1997-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882912 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858145 | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4838482 | 1995-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763682 | 1995-04-18 | Paper |
