Fernau, Henning; Freund, Rudolf; Holzer, Markus
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.Fundam. Informaticae. 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 SetElectron. Colloquium Comput. Complex. Bd. TR04. H. 073. 2004
Fernau, Henning
Extracting Minimum Length Document Type Definitions Is NP-Hard.ICGI. 2004 S. 277 - 278
Fernau, Henning; de la Higuera, Colin
Grammar Induction: An Invitation to Formal Language Theorists.Grammars. Bd. 7. 2004 S. 45 - 55
Fernau, Henning
Identifying Terminal Distinguishable Languages.Ann. Math. Artif. Intell. Bd. 40. H. 3-4. 2004 S. 263 - 282
W. Adriaans, Pieter; Fernau, Henning; de la Higuera, Colin et al.
Introduction to the Special Issue on Grammar Induction.Grammars. Bd. 7. 2004 S. 41 - 43
Alber, Jochen; Fernau, Henning; Niedermeier, Rolf
Parameterized complexity: exponential speed-up for planar graph problems.J. Algorithms. Bd. 52. H. 1. 2004 S. 26 - 56