16 citations · 31 across the 4 of their papers we have counts for
4 papers
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov +2
We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied p…
Planar Subgraph Isomorphism Revisited
Frederic Dorn
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95,…
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Paul Bonsma, Frederic Dorn
An out-tree of a directed graph is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By and we…
An FPT Algorithm for Directed Spanning k-Leaf
Paul Bonsma, Frederic Dorn
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D h…