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
Fernau, Henning; Freund, Rudolf; Holzer, Markus
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.Fundam. Inform. Bd. 64. H. 1-4. 2005 S. 159 - 170
Bordihn, Henning; Fernau, Henning
The degree of parallelism.DCFS. 2005 S. 51 - 62
Fernau, Henning
Two-Layer Planarization: Improving on Parameterized Algorithmics.SOFSEM. 2005 S. 137 - 146
Fernau, Henning; W. Juedes, David
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.MFCS. 2004 S. 488 - 499
Fernau, Henning
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting SetElectronic Colloquium on Computational Complexity (ECCC). H. 073. 2004
Fernau, Henning
Extracting Minimum Length Document Type Definitions Is NP-Hard.ICGI. 2004 S. 277 - 278