| Publication | Date of Publication | Type |
|---|
| Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) | 2024-05-03 | Paper |
| List covering of regular multigraphs with semi-edges | 2024-03-25 | Paper |
| Complexity of graph covering problems | 2024-01-05 | Paper |
| Drawing Simultaneously Embedded Graphs with Few Bends | 2023-11-16 | Paper |
| The Rique-number of graphs | 2023-08-16 | Paper |
| Computational Complexity of Covering Disconnected Multigraphs | 2023-06-10 | Paper |
| List covering of regular multigraphs | 2022-08-30 | Paper |
| Computational complexity of covering disconnected multigraphs | 2022-05-20 | Paper |
| List covering of regular multigraphs with semi-edges | 2022-04-08 | Paper |
| Cops, a fast robber and defensive domination on interval graphs | 2019-10-16 | Paper |
| On Vertex- and Empty-Ply Proximity Drawings | 2019-02-20 | Paper |
| Testing Planarity of Partially Embedded Graphs | 2018-10-30 | Paper |
| Parameterized complexity of distance labeling and uniform channel assignment problems | 2018-09-17 | Paper |
| Homothetic polygons and beyond: maximal cliques in intersection graphs | 2018-09-06 | Paper |
| 3-connected reduction for regular graph covers | 2018-08-24 | Paper |
| Cops and robbers on intersection graphs | 2018-06-28 | Paper |
| Bounded stub resolution for some maximal 1-planar graphs | 2018-06-05 | Paper |
| Completion of the Mixed Unit Interval Graphs Hierarchy | 2018-04-27 | Paper |
| Extending partial representations of interval graphs | 2017-10-09 | Paper |
| MSOL restricted contractibility to planar graphs | 2017-05-11 | Paper |
| Extending partial representations of proper and unit interval graphs | 2017-05-02 | Paper |
| Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus | 2017-04-05 | Paper |
| Simultaneous Orthogonal Planarity | 2017-02-21 | Paper |
| 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus | 2017-02-10 | Paper |
| Algorithmic Aspects of Regular Graph Covers | 2016-09-10 | Paper |
| Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems | 2016-09-02 | Paper |
| On the Hardness of Switching to a Small Number of Edges | 2016-09-02 | Paper |
| Cops and Robbers on String Graphs | 2016-01-11 | Paper |
| Computational complexity of covering three-vertex multigraphs | 2015-12-08 | Paper |
| Completion of the Mixed Unit Interval Graphs Hierarchy | 2015-09-30 | Paper |
| Planar Embeddings with Small and Uniform Faces | 2015-09-11 | Paper |
| Contact Representations of Planar Graphs: Extending a Partial Representation is Hard | 2015-09-09 | Paper |
| Extending partial representations of subclasses of chordal graphs | 2015-05-18 | Paper |
| MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS | 2015-04-29 | Paper |
| Drawing Simultaneously Embedded Graphs with Few Bends | 2015-01-07 | Paper |
| Firefighting on square, hexagonal, and triangular grids | 2014-10-31 | Paper |
| Computational Complexity of Covering Three-Vertex Multigraphs | 2014-10-14 | Paper |
| Locally constrained graph homomorphisms -- structure, complexity, and applications | 2014-10-07 | Paper |
| Extending partial representations of proper and unit interval graphs | 2014-09-02 | Paper |
| Locally injective \(k\)-colourings of planar graphs | 2014-08-22 | Paper |
| Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417619 | 2014-05-22 | Paper |
| On Switching to H‐Free Graphs | 2014-05-22 | Paper |
| Determining the \(L(2,1)\)-span in polynomial space | 2014-04-22 | Paper |
| Guest editors' foreword | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403059 | 2014-03-25 | Paper |
| Can they cross? and how? | 2014-03-24 | Paper |
| A kuratowski-type theorem for planarity of partially embedded graphs | 2014-03-24 | Paper |
| Fast exact algorithm for \(L(2,1)\)-labeling of graphs | 2014-01-16 | Paper |
| Cops and robbers on intersection graphs | 2014-01-14 | Paper |
| The planar slope number of planar partial 3-trees of bounded degree | 2013-07-19 | Paper |
| Intersection graphs of homothetic polygons | 2013-06-28 | Paper |
| Non-crossing Connectors in the Plane | 2013-05-28 | Paper |
| Extending Partial Representations of Subclasses of Chordal Graphs | 2013-03-21 | Paper |
| Beyond Homothetic Polygons: Recognition and Maximum Clique | 2013-03-21 | Paper |
| A Kuratowski-type theorem for planarity of partially embedded graphs | 2013-03-07 | Paper |
| MSOL Restricted Contractibility to Planar Graphs | 2013-01-07 | Paper |
| Determining the L(2,1)-Span in Polynomial Space | 2012-11-06 | Paper |
| Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill | 2012-11-06 | Paper |
| Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width | 2012-09-25 | Paper |
| Extending Partial Representations of Function Graphs and Permutation Graphs | 2012-09-25 | Paper |
| Segment representation of a subclass of co-planar graphs | 2012-05-30 | Paper |
| Distance three labelings of trees | 2012-05-11 | Paper |
| Parameterized complexity of generalized domination problems | 2012-05-11 | Paper |
| On the complexity of reconstructing H-free graphs from their Star Systems | 2011-10-12 | Paper |
| Branch and recharge: exact algorithms for generalized domination | 2011-09-20 | Paper |
| Extending partial representations of interval graphs | 2011-07-01 | Paper |
| Fast Exact Algorithm for L(2,1)-Labeling of Graphs | 2011-07-01 | Paper |
| On the Computational Complexity of Degenerate Unit Distance Representations of Graphs | 2011-05-19 | Paper |
| Parameterized complexity of coloring problems: treewidth versus vertex cover | 2011-05-18 | Paper |
| Exact algorithms for \(L(2,1)\)-labeling of graphs | 2011-03-02 | Paper |
| Sort and Search: exact algorithms for generalized domination | 2010-08-20 | Paper |
| Max-tolerance graphs as intersection graphs | 2010-08-16 | Paper |
| Faithful Representations of Graphs by Islands in the Extended Grid | 2010-04-27 | Paper |
| The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree | 2010-04-27 | Paper |
| Pursuing a fast robber on a graph | 2010-03-09 | Paper |
| Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs | 2010-02-04 | Paper |
| Parameterized Complexity of Generalized Domination Problems | 2010-01-21 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| The capture time of a graph | 2009-12-15 | Paper |
| On the computation of the hull number of a graph | 2009-12-15 | Paper |
| Untangling a planar graph | 2009-12-14 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover | 2009-06-03 | Paper |
| Geometric Intersection Graphs: Do Short Cycles Help? | 2009-03-06 | Paper |
| Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters | 2009-03-03 | Paper |
| Branch and Recharge: Exact Algorithms for Generalized Domination | 2009-02-17 | Paper |
| On Switching to H-Free Graphs | 2008-11-20 | Paper |
| Exact Algorithms for L(2,1)-Labeling of Graphs | 2008-09-17 | Paper |
| Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy | 2008-09-04 | Paper |
| Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) | 2008-08-28 | Paper |
| Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs | 2008-07-01 | Paper |
| Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs | 2008-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387696 | 2008-05-27 | Paper |
| Distance Constrained Labelings of Trees | 2008-05-27 | Paper |
| Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity | 2008-05-27 | Paper |
| On the computational complexity of partial covers of theta graphs | 2008-04-16 | Paper |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | 2008-04-15 | Paper |
| Moving Vertices to Make Drawings Plane | 2008-03-25 | Paper |
| Clustered Planarity: Small Clusters in Eulerian Graphs | 2008-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439665 | 2007-05-29 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult | 2006-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5481339 | 2006-08-09 | Paper |
| Coloring mixed hypertrees | 2006-04-28 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Computing the branchwidth of interval graphs | 2005-02-22 | Paper |
| Systems of distant representatives | 2005-02-22 | Paper |
| Mixed hypercacti | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046488 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474120 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448371 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448764 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422267 | 2003-09-03 | Paper |
| Partial covers of graphs | 2003-08-21 | Paper |
| Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414507 | 2003-07-25 | Paper |
| On the complexity of bicoloring clique hypergraphs of graphs | 2003-05-14 | Paper |
| On the injective chromatic number of graphs | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779166 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766689 | 2002-07-09 | Paper |
| Fixed-parameter complexity of \(\lambda\)-labelings | 2002-03-29 | Paper |
| Representing graphs by disks and balls (a survey of recognition-complexity results) | 2001-10-07 | Paper |
| Efficient algorithms for graphs with few \(P_4\)'s | 2001-07-18 | Paper |
| Hom-properties are uniquely factorizable into irreducible factors | 2000-11-29 | Paper |
| Complexity of choosing subsets from color sets | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952596 | 2000-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944971 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944992 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219028 | 2000-06-04 | Paper |
| Independent sets with domination constraints | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222093 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263476 | 2000-01-03 | Paper |
| Rankings of Directed Graphs | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251049 | 1999-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250146 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223772 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232782 | 1999-03-15 | Paper |
| On the computational complexity of (O,P)-partition problems | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389782 | 1998-10-19 | Paper |
| On intersection representations of co-planar graphs | 1998-10-19 | Paper |
| Graphs maximal with respect to hom-properties | 1998-09-28 | Paper |
| Brooks-type theorems for choosability with separation | 1998-09-07 | Paper |
| Covering regular graphs | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373683 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373685 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344207 | 1997-11-25 | Paper |
| Transversal partitioning in balanced hypergraphs | 1997-11-18 | Paper |
| Covering and coloring polygon-circle graphs | 1997-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892794 | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852553 | 1996-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847026 | 1995-09-10 | Paper |
| The complexity of induced minors and related problems | 1995-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4838453 | 1995-07-12 | Paper |
| Intersection graphs of segments | 1995-01-05 | Paper |
| Regular codes in regular graphs are difficult | 1994-11-03 | Paper |
| A special planar satisfiability problem and a consequence of its NP- completeness | 1994-09-27 | Paper |
| Intersection dimensions of graph classes | 1994-09-26 | Paper |
| Algorithmic complexity of list colorings | 1994-07-18 | Paper |
| Satisfiability of co-nested formulas | 1994-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273844 | 1994-01-06 | Paper |
| One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027169 | 1993-02-21 | Paper |
| Thresholds for classes of intersection graphs | 1993-01-17 | Paper |
| Compatible 2-factors | 1992-09-27 | Paper |
| Proportional graphs | 1992-06-25 | Paper |
| String graphs. II: Recognizing string graphs is NP-hard | 1991-01-01 | Paper |
| String graphs. I: The number of critical nonstring graphs is infinite | 1991-01-01 | Paper |
| String graphs requiring exponential representations | 1991-01-01 | Paper |
| Noncrossing Subgraphs in Topological Layouts | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348944 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358652 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035339 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3474685 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495221 | 1989-01-01 | Paper |
| On the number of Hamiltonian cycles in triangulations | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802605 | 1988-01-01 | Paper |
| On Restricted Two-Factors | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207865 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798692 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745859 | 1986-01-01 | Paper |
| Perfect codes over graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698696 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676365 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309881 | 1983-01-01 | Paper |
| Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number | 0001-01-03 | Paper |
| On a Combinatorial Problem Arising in Machine Teaching | 0001-01-03 | Paper |
| On the Structure of Hamiltonian Graphs with Small Independence Number | 0001-01-03 | Paper |
