Henning Fernau

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013)

Daniel Binkele-Raible, Henning Fernau: Packing paths: Recycling saves time. Discrete Applied Mathematics 161(12): 1686-1698 (2013)

Henning Fernau, Markus L. Schmid: Pattern Matching with Variables: A Multivariate Complexity Analysis. CPM 2013: 83-94

Johanna Björklund, Henning Fernau, Anna Kasprzik: MAT Learning of Universal Automata. LATA 2013: 141-152

Henning Fernau, Pinar Heggernes, Yngve Villanger: A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286

Daniel Binkele-Raible, Henning Fernau: An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63(1-2): 323-346 (2012)

Daniel Binkele-Raible, Henning Fernau: Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica 64(1): 189-212 (2012)

Sergio Bermudo, Henning Fernau: Lower bounds on the differential of a graph. Discrete Mathematics 312(22): 3236-3250 (2012)

Guoqiang Bai, Henning Fernau: Constraint bipartite vertex cover: simpler exact algorithms and implementations. J. Comb. Optim. 23(3): 331-355 (2012)

Henning Fernau, Carlos Martín-Vide: From the Guest Editors. J. Comput. Syst. Sci. 78(6): 1793-1794 (2012)

Daniel Binkele-Raible, Henning Fernau: An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. J. Discrete Algorithms 15: 43-55 (2012)

Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Transactions on Algorithms 8(4): 38 (2012)

Christophe Costa Florêncio, Henning Fernau: On families of categorial grammars of bounded value, their learnability and related complexity questions. Theor. Comput. Sci. 452: 21-38 (2012)

Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang: Kernels for Packing and Covering Problems - (Extended Abstract). FAW-AAIM 2012: 199-211

Henning Fernau: Cooperating Distributed Tree Automata. Languages Alive 2012: 75-85

Henning Fernau: Saving on Phases: Parameterized Approximation for Total Vertex Cover. IWOCA 2012: 20-31

Michael R. Fellows, Henning Fernau: Facility location problems: A parameterized view. Discrete Applied Mathematics 159(11): 1118-1130 (2011)

Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discrete Optimization 8(1): 41-49 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011)

Henning Fernau, Ralf Stiebe: On the Expressive Power of Valences in Cooperating Distributed Grammar Systems. Computation, Cooperation, and Life 2011: 90-106

Sergio Bermudo, Henning Fernau: Computing the differential of a graph. CTW 2011: 68-71

Ljiljana Brankovic, Henning Fernau: Parameterized Approximation Algorithms for Hitting Set. WAOA 2011: 63-76

Henning Fernau: A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Algorithmica 57(1): 97-118 (2010)

Henning Fernau: minimum dominating set of queens: A trivial programming exercise? Discrete Applied Mathematics 158(4): 308-318 (2010)

Henning Fernau: Parameterized algorithmics for d-Hitting Set. Int. J. Comput. Math. 87(14): 3157-3174 (2010)

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)

Henning Fernau, Michael Kaufmann, Mathias Poths: Comparing trees via crossing minimization. J. Comput. Syst. Sci. 76(7): 593-608 (2010)

Daniel Binkele-Raible, Henning Fernau: A new upper bound for Max-2-SAT: A graph-theoretic approach. J. Discrete Algorithms 8(4): 388-401 (2010)

Henning Fernau: Parameterized algorithms for d-Hitting Set: The weighted case. Theor. Comput. Sci. 411(16-18): 1698-1713 (2010)

Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege: A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010: 31-38

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith: A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. CIAC 2010: 311-322

Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh: The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43

Daniel Binkele-Raible, Henning Fernau: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CSR 2010: 328-339

Christophe Costa Florêncio, Henning Fernau: Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. ICGI 2010: 280-283

Ljiljana Brankovic, Henning Fernau: Combining Two Worlds: Parameterised Approximation for Vertex Cover. ISAAC (1) 2010: 390-402

Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh: Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348

Daniel Binkele-Raible, Henning Fernau: Enumerate and Measure: Improving Parameter Budget Management. IPEC 2010: 38-49

Christophe Costa Florêncio, Henning Fernau: Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA 2010: 202-213

Daniel Raible, Henning Fernau: An Amortized Search Tree Analysis for k-Leaf Spanning Tree. SOFSEM 2010: 672-684

Adrian Horia Dediu, Henning Fernau, Carlos Martín-Vide (Eds.): Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. Lecture Notes in Computer Science 6031, Springer 2010, isbn 978-3-642-13088-5

Henning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta: Offensive r-alliances in graphs. Discrete Applied Mathematics 157(1): 177-182 (2009)

Jose Maria Sigarreta, Sergio Bermudo, Henning Fernau: On the complement graph and defensive k-alliances. Discrete Applied Mathematics 157(8): 1687-1695 (2009)

Henning Fernau: Algorithms for learning regular expressions from positive data. Inf. Comput. 207(4): 521-541 (2009)

Henning Fernau, Daniel Raible: A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4): 319-341 (2009)

Henning Fernau, David Manlove: Vertex and edge covers with clustering properties: Complexity and algorithms. J. Discrete Algorithms 7(2): 149-167 (2009)

Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97

Henning Fernau, Daniel Raible: Packing Paths: Recycling Saves Time. CTW 2009: 79-83

Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172

Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432

Henning Fernau, Daniel Raible: Searching Trees: An Essay. TAMC 2009: 59-70

Henning Fernau, Serge Gaspers, Daniel Raible: Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111

Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009)

Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles. CoRR abs/0909.4224 (2009)

Daniel Raible, Henning Fernau: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CoRR abs/0911.1900 (2009)

Henning Fernau: Parameterized algorithmics for linear arrangement problems. Discrete Applied Mathematics 156(17): 3166-3177 (2008)

Henning Fernau, Joseph F. Ryan, Kiki A. Sugeng: A sum labelling for the generalised friendship graph. Discrete Mathematics 308(5-6): 734-740 (2008)

Henning Fernau, Ralf Stiebe: Blind Counter Automata on omega-Words. Fundam. Inform. 83(1-2): 51-64 (2008)

Jürgen Dassow, Henning Fernau: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Inf. Comput. 206(9-10): 1095-1103 (2008)

Henning Fernau: ROMAN DOMINATION: a parameterized perspective. Int. J. Comput. Math. 85(1): 25-38 (2008)

Vida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008)

Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4): 541-552 (2008)

Michael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. AAIM 2008: 188-199

Henning Fernau, Daniel Raible: A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63

Henning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta: Global r-alliances and total domination. CTW 2008: 98-101

Guoqiang Bai, Henning Fernau: Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. FAW 2008: 67-78

Stefan Gulan, Henning Fernau: An Optimal Construction of Finite Automata from Regular Expressions. FSTTCS 2008: 211-222

Daniel Raible, Henning Fernau: Power Domination in O^*(1.7548ⁿ) Using Reference Search Trees. ISAAC 2008: 136-147

Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562

Stefan Gulan, Henning Fernau: Local elimination-strategies in automata for shorter regular expressions. SOFSEM (2) 2008: 46-57

Henning Fernau, Daniel Raible: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156

Henning Fernau: Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms 2008

Carlos Martín-Vide, Friedrich Otto, Henning Fernau (Eds.): Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Lecture Notes in Computer Science 5196, Springer 2008, isbn 978-3-540-88281-7

Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach. CoRR abs/0803.3531 (2008)

Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang: A Parameterized Perspective on P₂-Packings. CoRR abs/0804.0570 (2008)

Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. CoRR abs/0810.4796 (2008)

Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree. CoRR abs/0811.1875 (2008)

Henning Fernau: Programmed Grammars with Rule Queues. Int. J. Found. Comput. Sci. 18(6): 1209-1213 (2007)

Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. ITA 41(3): 243-259 (2007)

Henning Fernau: Learning tree languages from text. ITA 41(4): 351-374 (2007)

Henning Bordihn, Henning Fernau: The Degree of Parallelism. Journal of Automata, Languages and Combinatorics 12(1-2): 25-47 (2007)

Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics 12(1-2): 117-138 (2007)

Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37(4): 1077-1106 (2007)

Henning Fernau: Dynamic programming for queen domination. CTW 2007: 43-48

Daniel Raible, Henning Fernau: Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007

Jürgen Dassow, Henning Fernau: Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. LATA 2007: 249-260

Henning Fernau, Daniel Raible: Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70

Faisal N. Abu-Khzam, Henning Fernau: Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electronic Notes in Discrete Mathematics 25: 1-6 (2006)

Henning Fernau: Speeding up Exact Algorithms With High Probability. Electronic Notes in Discrete Mathematics 25: 57-59 (2006)

Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide: Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1-3): 67-81 (2006)

Henning Fernau, David Manlove: Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. ACiD 2006: 69-84

Henning Fernau: Parameterized Algorithms for Hitting Set: The Weighted Case. CIAC 2006: 332-343

Henning Fernau: edge dominating set: Efficient Enumeration-Based Exact Algorithms. IWPEC 2006: 142-153

Faisal N. Abu-Khzam, Henning Fernau: Kernels: Annotated, Proper and Induced. IWPEC 2006: 264-275

Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond: NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245

Henning Fernau: ROMAN DOMINATION: A Parameterized Perspective. SOFSEM 2006: 262-271

Henning Fernau: Parameterized Algorithms for Hitting Set: the Weighted Case. Electronic Colloquium on Computational Complexity (ECCC) 13(072) (2006)

Henning Fernau, Rudolf Freund, Markus Holzer: Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Inform. 64(1-4): 159-170 (2005)

Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005)

Henning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics. J. Graph Algorithms Appl. 9(2): 205-238 (2005)

Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston: Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58

Henning Fernau: Algorithms for Learning Regular Expressions. ALT 2005: 297-311

Henning Bordihn, Henning Fernau: The degree of parallelism. DCFS 2005: 51-62

Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121

Henning Fernau, Michael Kaufmann, Mathias Poths: Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469

Henning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics. SOFSEM 2005: 137-146

Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280

Henning Fernau: Identifying Terminal Distinguishable Languages. Ann. Math. Artif. Intell. 40(3-4): 263-282 (2004)

Pieter W. Adriaans, Henning Fernau, Colin de la Higuera, Menno van Zaanen: Introduction to the Special Issue on Grammar Induction. Grammars 7: 41-43 (2004)

Henning Fernau, Colin de la Higuera: Grammar Induction: An Invitation to Formal Language Theorists. Grammars 7: 45-55 (2004)

Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004)

Bradford Starkie, Henning Fernau: The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. ICGI 2004: 235-247

Henning Fernau: Extracting Minimum Length Document Type Definitions Is NP-Hard. ICGI 2004: 277-278

Henning Fernau, David W. Juedes: A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS 2004: 488-499

Henning Fernau: Parametric Duality: Kernel Sizes and Algorithmics. Electronic Colloquium on Computational Complexity (ECCC)(027) (2004)

Henning Fernau: A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Electronic Colloquium on Computational Complexity (ECCC)(073) (2004)

Henning Fernau: Two-Layer Planarization: Improving on Parameterized Algorithmics. Electronic Colloquium on Computational Complexity (ECCC)(078) (2004)

Henning Fernau: Education(al) matters: teaching P versus NP. Bulletin of the EATCS 80: 237-246 (2003)

Henning Fernau: Parallel Grammars: A Phenomenology. Grammars 6(1): 25-87 (2003)

Henning Fernau, Alexander Meduna: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86(5): 235-240 (2003)

Jochen Alber, Henning Fernau, Rolf Niedermeier: Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003)

Henning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. 1-3(299): 633-662 (2003)

Henning Fernau: Identification of function distinguishable languages. Theor. Comput. Sci. 290(3): 1679-1711 (2003)

Henning Fernau, Alexander Meduna: On the degree of scattered context-sensitivity. Theor. Comput. Sci. 290(3): 2121-2124 (2003)

Henning Fernau: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296(2): 225-251 (2003)

Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130

Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt: On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9

Vida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed Parameter Algorithms for one-sided crossing minimization Revisited. Graph Drawing 2003: 332-344

Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier: Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002)

Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. Journal of Automata, Languages and Combinatorics 7(4): 487-503 (2002)

Henning Fernau, Ralf Stiebe: Sequential grammars and automata with valences. Theor. Comput. Sci. 276(1-2): 377-405 (2002)

Henning Fernau: Even linear simple matrix languages: formal language properties and grammatical inference. Theor. Comput. Sci. 289(1): 425-456 (2002)

Henning Fernau: On Parameterized Enumeration. COCOON 2002: 564-573

Henning Fernau: Learning Tree Languages from Text. COLT 2002: 153-168

Henning Fernau: Fragmentation: Enhancing Identifiability. ICGI 2002: 92-105

Henning Fernau, Agnes Radl: Algorithms for Learning Function Distinguishable Regular Languages. SSPR/SPR 2002: 64-73

Henning Fernau: Graph Separator Algorithms: A Refined Analysis. WG 2002: 186-197

Pieter W. Adriaans, Henning Fernau, Menno van Zaanen (Eds.): Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings. Lecture Notes in Computer Science 2484, Springer 2002, isbn 3-540-44239-1

Henning Fernau: Parallel communicating grammar systems with terminal transmission. Acta Inf. 37(7): 511-540 (2001)

Henning Fernau, Ralf Stiebe: Valences in Lindenmayer Systems. Fundam. Inform. 45(4): 329-358 (2001)

Henning Fernau, Ludwig Staiger: Iterated Function Systems and Control Languages. Inf. Comput. 168(2): 125-143 (2001)

Henning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001)

Henning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001)

Henning Fernau, Ralf Stiebe: Valence Grammars with Target Sets. Words, Semigroups, and Transductions 2001: 129-140

Henning Fernau, Werner Kuich: Regularly controlled formal power series. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 253-265

Jochen Alber, Henning Fernau, Rolf Niedermeier: Graph Separators: A Parameterized View. COCOON 2001: 318-327

Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS 2001: 79-90

Henning Fernau, Ralf Stiebe: Valuated and Valence Grammars: An Algebraic View. Developments in Language Theory 2001: 281-292

Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272

Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier: Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243

Henning Fernau: Nonterminal Complexity of Programmed Grammars. MCU 2001: 202-213

Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122

Henning Fernau: Learning XML Grammars. MLDM 2001: 73-87

Henning Fernau: Approximative Learning of Regular Languages. SOFSEM 2001: 223-232

Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Electronic Colloquium on Computational Complexity (ECCC) 8(23) (2001)

Henning Fernau: Regulated Grammars under Leftmost Derivation. Grammars 3(1): 37-62 (2000)

Henning Fernau: Identification of Function Distinguishable Languages. ALT 2000: 116-130

Henning Fernau: Terminal distinguishable languages. AMAI 2000

Henning Fernau, Markus Holzer: External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 104-120

Henning Fernau, José M. Sempere: Permutations and Control Sets for Learning Non-regular Language Families. ICGI 2000: 75-88

Henning Fernau: k-gram Extensions of Terminal Distinguishable Languages. ICPR 2000: 2125-2128

Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier: Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110

Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999)

Jürgen Dassow, Henning Fernau, Gheorghe Paun: On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. 10(1): 61-80 (1999)

Henning Fernau, Frank Stephan: Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer. Journal of Automata, Languages and Combinatorics 4(2): 117-152 (1999)

Henning Fernau: Efficient Learning of Some Linear Matrix Languages. COCOON 1999: 221-230

Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. Developments in Language Theory 1999: 153-163

Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems 1999: 157-181

Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems 1999: 284-296

Henning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS 1999: 387-397

Henning Fernau, Dietmar Wätjen: Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. Theor. Comput. Sci. 194(1-2): 35-55 (1998)

Henning Fernau, Rudolf Freund, Markus Holzer: The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56

Henning Fernau, Ludwig Staiger: IFS and Control Languages. MFCS 1998: 740-750

Henning Fernau: Regulated Grammars with Leftmost Derivation. SOFSEM 1998: 322-331

Henning Fernau, Rudolf Freund, Markus Holzer: Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291

Henning Fernau: Unconditional Transfer in Regulated Rewriting. Acta Inf. 34(11): 837-857 (1997)

Henning Fernau: Graph-Controlled Grammars as Language Acceptors. Journal of Automata, Languages and Combinatorics 2(2): 79-92 (1997)

Henning Fernau, Markus Holzer: Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages 1997: 10-26

Henning Fernau, Rudolf Freund: Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages 1997: 95-118

Henning Fernau, Frank Stephan: How Powerful is Unconditional Transfer? - When UT meets AC. Developments in Language Theory 1997: 249-260

Henning Fernau, Markus Holzer, Rudolf Freund: Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272

Henning Fernau, Ralf Stiebe: Regulations by Valences. MFCS 1997: 239-248

Henning Fernau, Markus Holzer: Accepting Multi-Agent Systems II. Acta Cybern. 12(4): 361-380 (1996)

Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3) (1996)

Henning Fernau: Closure Properties of Ordered Languages. Bulletin of the EATCS 58 (1996)

Henning Fernau: On Grammar and Language Families. Fundam. Inform. 25(1): 17-34 (1996)

Henning Bordihn, Henning Fernau: Accepting Grammars and Systems via Context Condition Grammars. Journal of Automata, Languages and Combinatorics 1(2): 97-112 (1996)

Henning Fernau: Membership for k-Limited ET0L Languages Is Not Decidable. Journal of Automata, Languages and Combinatorics 1(4): 243-246 (1996)

Henning Fernau: Remarks on Propagating Partition-Limited ETOL Systems. J. UCS 2(11): 745-755 (1996)

Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt: Advocating Ownership. FSTTCS 1996: 286-297

Henning Fernau: On Unconditional Transfer. MFCS 1996: 348-359

Henning Fernau, Rudolf Freund: Bounded Parallelism in Array Grammars Used for Character Recognition. SSPR 1996: 40-49

Henning Fernau: Valuations, regular expressions, and fractal geometry. Appl. Algebra Eng. Commun. Comput. 7(1): 59-75 (1995)

Henning Fernau: A predicate for separating language classes. Bulletin of the EATCS 56 (1995)

Henning Fernau: A Note on Uniformly Limited ETOL Systems with Unique Interpretation. Inf. Process. Lett. 54(4): 199-204 (1995)

Henning Fernau: Valuations of Languages, with Applications to Fractal Geometry. Theor. Comput. Sci. 137(2): 177-217 (1995)

Henning Bordihn, Henning Fernau: Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208

Henning Fernau: Membership for 1-Limited ET0L Languages Is Not Decidable. Elektronische Informationsverarbeitung und Kybernetik 30(4): 191-211 (1994)

Henning Fernau, Ludwig Staiger: Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22

Henning Fernau: Adult Languages of Propagating Systems with Restricted Parallelism. Elektronische Informationsverarbeitung und Kybernetik 29(5): 249-267 (1993)

Henning Fernau: Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. Developments in Language Theory 1993: 90-101

Henning Fernau: On Function-limited Lindenmayer Systems. Elektronische Informationsverarbeitung und Kybernetik 27(1): 21-53 (1991)