Fernau, Henning
Parameterized Algorithms for Hitting Set: The Weighted Case.CIAC. 2006 S. 332 - 343
Fernau, Henning
ROMAN DOMINATION: A Parameterized Perspective.SOFSEM. 2006 S. 262 - 271
Fernau, Henning
Speeding up Exact Algorithms With High Probability.Electron. Notes Discret. Math. Bd. 25. 2006 S. 57 - 59
Fernau, Henning; F. Manlove, David
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms.ACiD. 2006 S. 69 - 84
Alber, Jochen; Fan, Hongbing; R. Fellows, Michael et al.
A refined search tree technique for Dominating Set on planar graphs.J. Comput. Syst. Sci. Bd. 71. H. 4. 2005 S. 385 - 405
Fernau, Henning
Algorithms for Learning Regular Expressions.ALT. 2005 S. 297 - 311
N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael
Asymptotically Faster Algorithms for Parameterized FACE COVER.ACiD. 2005 S. 43 - 58
Fernau, Henning; Kaufmann, Michael; Poths, Mathias
Comparing Trees Via Crossing Minimization.FSTTCS. 2005 S. 457 - 469
Chen, Jianer; Fernau, Henning; A. Kanj, Iyad et al.
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.STACS. 2005 S. 269 - 280
Fernau, Henning; Freund, Rudolf; Oswald, Marion et al.
Refining the Nonterminal Complexity of Graph-controlled Grammars.DCFS. 2005 S. 110 - 121