#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1947

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
- Algorithmica
- 2009

We present a general framework for designing fast subexponential exact and parameterized algorithms on planar graphs. Our approach is based on geometric properties of planar branch decompositions… (More)

- Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
- ICALP
- 2007

We present a series of techniques for the design of subexponential parameterized algorithms for graph problems. The design of such algorithms usually consists of two main steps: first find a… (More)

- Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
- SODA
- 2008

We give an algorithm that, for a fixed graph <i>H</i> and integer <i>k</i>, decides whether an <i>n</i>-vertex <i>H</i>-minor-free graph <i>G</i> contains a path of length <i>k</i> in… (More)

Divide-and-conquer strategy based on variations of the LiptonTarjan planar separator theorem has been one of the most common approaches for solving planar graph problems for more than 20 years. We… (More)

- Frederic Dorn
- STACS
- 2010

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, J’GAA 99] gives… (More)

In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( √ k)nO(1), where n is… (More)

- Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
- SWAT
- 2006

We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain time 2 √ n)… (More)

Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in scheduling and routing… (More)

- Paul S. Bonsma, Frederic Dorn
- ArXiv
- 2007

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 digraph D has an out-branching with… (More)

- Jochen Alber, Frederic Dorn, Rolf Niedermeier
- Discrete Applied Mathematics
- 2005

Many NP-complete problems on planar graphs are “fixed-parameter tractable:” Recent theoretical work provided tree decomposition based fixed-parameter algorithms exactly solving various parameterized… (More)