#### Filter Results:

- Full text PDF available (151)

#### Publication Year

1991

2017

- This year (8)
- Last 5 years (65)
- Last 10 years (129)

#### Publication Type

#### Co-author

#### Publication Venue

#### 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)

- 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)

- Daniel Binkele-Raible, Henning Fernau
- MFCS
- 2008

In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O * (2 K 6.2158) for Max-2-Sat (each clause contains at most 2 literals), where K is the number of clauses. The run time has been achieved by using heuristic priorities on the choice of… (More)

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
- 2005

We present an algorithm that constructively produces a solution to the k-dominating set problem for planar graphs in time O(c √ k n), where c = 3 6 √ 34. To obtain this result, we show that the treewidth of a pla-nar graph with domination number γ(G) is O(γ(G)), and that such a tree decomposition can be found in O(γ(G)n) time. The same technique can be used… (More)

- Henning Fernau
- Electronic Colloquium on Computational Complexity
- 2004

In this paper, we show how to systematically improve on parame-terized algorithms and their analysis, focusing on search-tree based algorithms for d-Hitting Set, especially for d = 3. We concentrate on algorithms which are easy to implement, in contrast with the highly sophisticated algorithms which have been elsewhere designed to improve on the exponential… (More)

- Henning Fernau
- IWPEC
- 2006

- Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
- KI/ÖGAI
- 2001

We present solutions of benchmark instances to the solitaire computer game Atomix found with different heuristic search methods. The problem is PSPACE-complete. An implementation of the heuristic algorithm A* is presented that needs no priority queue, thereby having very low memory overhead. The limited memory algorithm IDA* is handicapped by the fact that,… (More)

- Henning Fernau
- Electronic Colloquium on Computational Complexity
- 2006

We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set.