| Publication | Date of Publication | Type |
|---|
| Deferred-query—An efficient approach for problems on interval and circular-arc graphs | 2023-01-18 | Paper |
| Moderately exponential time algorithms for the maximum bounded-degree-1 set problem | 2018-12-03 | Paper |
| Fixed-parameter algorithms for Vertex Cover \(P_3\) | 2018-05-24 | Paper |
| An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs | 2016-08-31 | Paper |
| Moderately exponential time algorithms for the maximum induced matching problem | 2015-07-22 | Paper |
| Linear-time algorithms for tree root problems | 2015-05-26 | Paper |
| Finding large \(k\)-clubs in undirected graphs | 2015-01-26 | Paper |
| Exact algorithms for problems related to the densest \(k\)-set problem | 2014-05-05 | Paper |
| Testing consistency of quartet topologies: a parameterized approach | 2014-04-14 | Paper |
| Recognition of probe distance-hereditary graphs | 2013-01-18 | Paper |
| Independent sets in edge-clique graphs | 2012-06-10 | Paper |
| Edge-clique graphs of cocktail parties have unbounded rankwidth | 2012-05-11 | Paper |
| An improved algorithm for the red-blue hitting set problem with the consecutive ones property | 2012-03-27 | Paper |
| A property tester for tree-likeness of quartet topologies | 2011-11-30 | Paper |
| An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs | 2011-10-10 | Paper |
| Recognition of Probe Ptolemaic Graphs | 2011-05-19 | Paper |
| Block-graph width | 2011-05-18 | Paper |
| Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs | 2011-03-10 | Paper |
| New fixed-parameter algorithms for the minimum quartet inconsistency problem | 2010-10-06 | Paper |
| Signed and minus clique-transversal functions on graphs | 2010-06-16 | Paper |
| On probe permutation graphs | 2010-04-28 | Paper |
| An improved algorithm for the maximum agreement subtree problem | 2009-12-04 | Paper |
| New upper bounds on feedback vertex numbers in butterflies | 2009-07-21 | Paper |
| Block-Graph Width | 2009-06-03 | Paper |
| Variations of \(Y\)-dominating functions on graphs | 2008-09-04 | Paper |
| Partitioned Probe Comparability Graphs | 2008-09-04 | Paper |
| Probe Ptolemaic Graphs | 2008-07-10 | Paper |
| The 3-Steiner Root Problem | 2008-07-01 | Paper |
| New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem | 2008-06-05 | Paper |
| Partitioned probe comparability graphs | 2008-05-28 | Paper |
| Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs | 2008-01-04 | Paper |
| Finding a minimum path cover of a distance-hereditary graph in polynomial time | 2007-10-29 | Paper |
| Linear-Time Algorithms for Tree Root Problems | 2007-09-07 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Distance-hereditary graphs are clique-perfect | 2006-04-28 | Paper |
| Weighted irredundance of interval graphs. | 2006-01-17 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Solving the path cover problem on circular-arc graphs by using an approximation algorithm | 2006-01-10 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs | 2005-09-22 | Paper |
| Hamilton cycles in split graphs with large minimum degree | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448744 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448745 | 2004-02-18 | Paper |
| Domination in distance-hereditary graphs | 2002-08-24 | Paper |
| The \(K_r\)-packing problem | 2002-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525750 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262690 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232775 | 1999-08-17 | Paper |
| Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs | 1998-09-21 | Paper |
| On minimum intersection of two minimum dominating sets of interval graphs | 1998-03-26 | Paper |
| Weighted domination of cocomparability graphs | 1998-03-25 | Paper |
| Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs | 1997-06-19 | Paper |
| Edge domination on bipartite permutation graphs and cotriangulated graphs | 1997-02-28 | Paper |
| Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | 1997-01-13 | Paper |
| Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201930 | 1993-09-06 | Paper |
| Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs | 1993-01-16 | Paper |
| Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs | 1992-11-29 | Paper |
| A simple linear time algorithm for the domatic partition problem on strongly chordal graphs | 1992-11-29 | Paper |
| Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs | 1992-09-27 | Paper |
| 20‐relative neighborhood graphs are hamiltonian | 1992-06-27 | Paper |
| An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs | 1990-01-01 | Paper |
