| Publication | Date of Publication | Type |
|---|
| Complexity of vertex switching on edge-bicolored graphs | 2020-02-06 | Paper |
| Two edge-disjoint paths with length constraints | 2019-10-18 | Paper |
| Finding Two Edge-Disjoint Paths with Length Constraints | 2016-12-22 | Paper |
| Computing the optimal bridge between two convex polygons | 2016-06-16 | Paper |
| Parameterized complexity of finding connected induced subgraphs | 2015-12-08 | Paper |
| Obtaining split graphs by edge contraction | 2015-12-08 | Paper |
| Parameterized Complexity of Connected Induced Subgraph Problems | 2015-05-20 | Paper |
| Obtaining Split Graphs by Edge Contraction | 2015-05-20 | Paper |
| Incompressibility of \(H\)-free edge modification problems | 2015-05-04 | Paper |
| Dual Connectedness of Edge-Bicolored Graphs and Beyond | 2014-10-14 | Paper |
| Contracting Few Edges to Remove Forbidden Induced Subgraphs | 2013-12-10 | Paper |
| Incompressibility of H-Free Edge Modification | 2013-12-10 | Paper |
| Parameterized complexity of even/odd subgraph problems | 2011-08-23 | Paper |
| Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem | 2011-07-18 | Paper |
| Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem | 2011-03-30 | Paper |
| Choosability of toroidal graphs without short cycles | 2010-11-10 | Paper |
| Parameterized Complexity of Even/Odd Subgraph Problems | 2010-05-28 | Paper |
| Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm | 2009-01-29 | Paper |
| Labelling planar graphs without 4-cycles with a condition on distance two | 2008-09-29 | Paper |
| Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems | 2008-06-03 | Paper |
| The complexity of the locally connected spanning tree problem | 2003-09-25 | Paper |
| Parameterized complexity of vertex colouring | 2003-06-10 | Paper |
| Game chromatic index of \(k\)-degenerate graphs | 2001-08-12 | Paper |
| Stable 2-pairs and \((X,Y)\)-intersection graphs | 2001-07-05 | Paper |
| On spanning 2-trees in a graph | 1998-03-16 | Paper |
| Computing Visibility Information in an Inaccurate Simple Polygon | 1998-02-08 | Paper |
| A linear-time algorithm for computing the intersection of all odd cycles in a graph | 1997-08-03 | Paper |
| Fixed-parameter tractability of graph modification problems for hereditary properties | 1997-02-27 | Paper |
| A generalization of perfect graphs?i-perfect graphs | 1996-12-15 | Paper |
| A generalization of line graphs: (X, Y)-intersection graphs | 1996-08-13 | Paper |
| Path decompositions of multigraphs | 1996-03-10 | Paper |
| Isomorphic tree spanner problems | 1995-10-09 | Paper |
| Tree Spanners | 1995-09-20 | Paper |
| Spanners in graphs of bounded degree | 1995-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139523 | 1994-05-19 | Paper |
| NP-completeness of minimum spanner problems | 1994-03-10 | Paper |
| On the SPANNING \(k\)-TREE problem | 1993-11-30 | Paper |
| The recognition of union trees | 1993-06-29 | Paper |
| On cycle double covers of line graphs | 1992-09-27 | Paper |
| Edge colouring line graphs of unicyclic graphs | 1992-06-28 | Paper |
| NP-completeness of edge-colouring some restricted graphs | 1992-06-25 | Paper |
