#### Filter Results:

- Full text PDF available (155)

#### Publication Year

1991

2017

- This year (13)
- Last 5 years (70)
- Last 10 years (134)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
- Algorithmica
- 2002

Abstract. We present an algorithm that constructively produces a solution to the k -DOMINATING SET problem for planar graphs in time O(c^ \sqrt k n) , where c=4^ 6\sqrt 34 . To obtain this result, we show that the treewidth of a planar graph with domination number γ (G) is O(\sqrt \rule 0pt 4pt \smash γ (G) ) , and that such a tree decomposition can be… (More)

- Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
- SIAM J. Comput.
- 2005

Determining whether a parameterized problem is kernelizable and has a small kernel size has recently become one of the most interesting topics of research in the area of parameterized complexity and algorithms. Theoretically, it has been proved that a parameterized problem is kernelizable if and only if it is fixed-parameter tractable. Practically, applying… (More)

- Henning Fernau, Michael Kaufmann, Mathias Poths
- FSTTCS
- 2005

Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges between the leaves give a one-to-one correspondence between pairs of leaves of the different trees. Do there exist two planar embeddings of the two trees that minimize the crossings of the… (More)

- Henning Fernau
- 2005

The <i>k</i>-Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented spanning tree, with at least <i>k</i> leaves in a given digraph. The problem has recently received much attention from the viewpoint of parameterized algorithms. Here, we take a kernelization based approach to the <i>k</i>-Leaf-Out-Branching problem. We give the… (More)

- Henning Fernau
- IWPEC
- 2006

- Henning Fernau
- Theor. Comput. Sci.
- 2000

We show how appropriately chosen functions f which we call distinguishing can be used to make deterministic "nite automata backward deterministic. This idea can be exploited to design regular language classes called f-distinguishable which are identi"able in the limit from positive samples. Special cases of this approach are the k-reversible and terminal… (More)

- Daniel Binkele-Raible, Henning Fernau
- IPEC
- 2010

- Henning Fernau
- COCOON
- 2002

- Henning Fernau, David Manlove
- ACiD
- 2006

We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generalize the notions of a vertex cover and an edge cover, respectively. A ttotal vertex (respectively edge) cover of a connected graph G is a vertex (edge) cover S of G such that each connected component of the subgraph of G induced by S has least t vertices… (More)