• Publications
  • Influence
Improved Algorithms for the Feedback Vertex Set Problems
TLDR
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Expand
  • 95
  • 9
  • PDF
Improved algorithms for feedback vertex set problems
TLDR
We present improved parameterized algorithms for the feedback vertex set problem on both unweighted and weighted graphs. Expand
  • 108
  • 8
Independent Set in P5-Free Graphs in Polynomial Time
TLDR
In this paper we give the first polynomial time algorithm for Independent Set on P5-free graphs. Expand
  • 106
  • 8
  • PDF
A Polynomial Kernel for Proper Interval Vertex Deletion
TLDR
We obtain a polynomial kernel for Proper Interval Vertex Deletion. Expand
  • 34
  • 7
  • PDF
Interval Completion Is Fixed Parameter Tractable
TLDR
We present an algorithm with runtime $O(k^{2k}n^3m) for the k-Interval Completion problem of deciding whether a graph on n vertices and m edges can be made into an interval graph by adding at most k edges. Expand
  • 65
  • 6
  • PDF
Subexponential parameterized algorithm for minimum fill-in
TLDR
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Expand
  • 79
  • 5
  • PDF
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
TLDR
The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k leaves in a given digraph. Expand
  • 71
  • 5
Large Induced Subgraphs via Triangulations and CMSO
TLDR
We give an algorithm solving this optimization problem on any $n$-vertex graph $G$ in time ${\cal O}(|\Pi_G| \cdot n^{t+4}\cdot f(t,\varphi))$, where $\varphi$ is a counting monadic second order logic formula and $t\geq 0$ be an integer. Expand
  • 57
  • 5
  • PDF
Interval completion with few edges
We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most kExpand
  • 41
  • 5
  • PDF
Finding Induced Subgraphs via Minimal Triangulations
TLDR
We show that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible in time the number of potential minimal cliques times $O(n^{O(t)})$ to find a maximum induced subgraph of treewidth t in G. Expand
  • 91
  • 4
  • PDF