H
Henning Fernau
Researcher at University of Trier
Publications - 369
Citations - 5647
Henning Fernau is an academic researcher from University of Trier. The author has contributed to research in topics: Parameterized complexity & Formal language. The author has an hindex of 35, co-authored 353 publications receiving 5226 citations. Previous affiliations of Henning Fernau include University of Newcastle & Newcastle University.
Papers
More filters
Journal ArticleDOI
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
TL;DR: An algorithm is presented 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 and k is the size of the face cover set.
Journal ArticleDOI
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
TL;DR: New techniques to derive upper and lower bounds on the kernel size for certain parameterized problems are developed, including a new set of reduction and coloring rules that allows the derivation of nice combinatorial properties in the kernelized graph leading to a tighter bound on the size of the kernel.
Journal ArticleDOI
Parameterized complexity: exponential speed-up for planar graph problems
TL;DR: General techniques that allow to develop algorithms with running time c√k|G|, given an instance G of a problem on planar graphs with parameter k are discussed, and extensions of the speed-up technique to basically all fixed-parameter tractable planar graph problems are exhibited.
Proceedings ArticleDOI
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
TL;DR: The first polynomial kernel is given for {\sc Rooted $k$-Leaf-Out-Branching}, a variant of {\sc $k $-Le leaf-out-branching} where the root of the tree searched for is also a part of the input, and is obtained using extremal combinatorics.
Book ChapterDOI
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
Jochen Alber,Hongbing Fan,Michael R. Fellows,Henning Fernau,Rolf Niedermeier,Frances A. Rosamond,Ulrike Stege +6 more
TL;DR: A fixed parameter algorithm with running time O(8kn), where k is the size of the dominating set and n is the number of vertices in the graph is derived.