Univ.-Prof. Dr. Henning Fernau - Publikationen

Fernau, Henning; Zhu, Binhai
Combinatorial Algorithms - 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21-24, 2025, Proceedings
Springer 2025

Fernau, Henning; Schwank, Inge; Staub, Jacqueline
Creative Mathematical Sciences Communication: 7th International Conference, CMSC 2024, Trier, Germany, October 7-10, 2024, Proceedings
Springer 2025

Arrighi, Emmanuel; Feng, Zhidan; Fernau, Henning et al.
Defensive Alliances in Signed Networks.
J. Artif. Intell. Res. Bd. 82. 2025 S. 2189 - 2232

N. Abu-Khzam, Faisal; Fernau, Henning; Gras, Benjamin et al.
Enumerating Minimal Connected Dominating Sets.
SIAM J. Discret. Math. Bd. 39. H. 2. 2025 S. 946 - 972

Mann, Kevin; Fernau, Henning
Extension Perfect Roman Domination.
CALDAM. 2025 S. 197 - 209

Feng, Zhidan; Fernau, Henning; Mann, Kevin et al.
Generalized Lettericity of Graphs.
CALDAM. 2025 S. 134 - 146

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi et al.
Matrix Forbidding Grammars.
DCFS. 2025 S. 94 - 107

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On Computational Completeness of Semi-Conditional Matrix Grammars.
SOFSEM (1). 2025 S. 270 - 283

Fernau, Henning; Foucaud, Florent; Mann, Kevin et al.
Parameterizing path partitions.
Theor. Comput. Sci. Bd. 1028. 2025 S. 115029

Mann, Kevin; Fernau, Henning
Roman Hitting Set.
SOFSEM (2). 2025 S. 142 - 156

Valette, Elena; Zeimetz, Tobias; Fernau, Henning et al.
SMART: Self-supervised Model aligning APIs and RDF using Transformers.
BTW. 2025 S. 1007 - 1017

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Counting Simple Rules in Semi-conditional Grammars is not Simple.
CiE. 2024 S. 192 - 204

Fernau, Henning
Editorial 2024: moving forwards in the electronic age.
Acta Informatica. Bd. 61. H. 4. 2024 S. 331 - 332

N. Abu-Khzam, Faisal; Fernau, Henning; Mann, Kevin
Minimal Roman Dominating Functions: Extensions and Enumeration.
Algorithmica. Bd. 86. H. 6. 2024 S. 1862 - 1887

Feng, Zhidan; Fernau, Henning; Mann, Kevin et al.
Offensive Alliances in Signed Graphs.
TAMC. 2024 S. 234 - 246

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the computational completeness of generalized forbidding matrix grammars.
Theor. Comput. Sci. Bd. 999. 2024 S. 114539

Feng, Zhidan; Fernau, Henning; Zhu, Binhai
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
AAIM (1). 2024 S. 94 - 108

Mann, Kevin; Fernau, Henning
Perfect Roman Domination: Aspects of Enumeration and Parameterization.
IWOCA. 2024 S. 354 - 368

Bazgan, Cristina; Fernau, Henning
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022.
Algorithmica. Bd. 86. H. 3. 2024 S. 695 - 696

Agrawal, Akanksha; Fernau, Henning; Kindermann, Philipp et al.
Recognizing well-dominated graphs is coNP-complete.
Inf. Process. Lett. Bd. 183. 2024 S. 106419

Fernau, Henning; Mann, Kevin
Roman Hitting Functions.
IPEC. 2024 S. 24:1 - 24:15

Fernau, Henning; Gaspers, Serge; Klasing, Ralf
SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings
Springer 2024

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms.
MCU. 2024 S. 17 - 34

Fernau, Henning; Haase, Carolina; Hoffmann, Stefan et al.
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata.
NCMA. 2024 S. 77 - 85

Casel, Katrin; Fernau, Henning; Grigoriev, Alexander et al.
Combinatorial Properties and Recognition of Unit Square Visibility Graphs.
Discret. Comput. Geom. Bd. 69. H. 4. 2023 S. 937 - 980

Fernau, Henning
Editorial 2023: changes and invariants.
Acta Informatica. Bd. 60. H. 4. 2023 S. 331 - 333

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.
Extension of some edge graph problems: Standard, parameterized and approximation complexity.
Discret. Appl. Math. Bd. 340. 2023 S. 183 - 201

Fernau, Henning; Jansen, Klaus
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings
Springer 2023

Vu, Martin; Fernau, Henning
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context.
J. Autom. Lang. Comb. Bd. 28. H. 1-3. 2023 S. 221 - 244

Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.
Order Reconfiguration under Width Constraints.
J. Graph Algorithms Appl. Bd. 27. H. 6. 2023 S. 409 - 431

Fernau, Henning; Foucaud, Florent; Mann, Kevin et al.
Parameterizing Path Partitions.
CIAC. 2023 S. 187 - 201

Fernau, Henning; V. Volkov, Mikhail
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020.
Theory Comput. Syst. Bd. 67. H. 2. 2023 S. 219 - 220

N. Abu-Khzam, Faisal; Fernau, Henning; Mann, Kevin
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes.
MFCS. 2023 S. 6:1 - 6:15

Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.
Synchronization and Diversity of Solutions.
AAAI. 2023 S. 11516 - 11524

Fernau, Henning; Wolf, Petra; Yamakami, Tomoyuki
Synchronizing deterministic push-down automata can be really hard.
Inf. Comput. Bd. 295. H. Part B. 2023 S. 105089

Fernau, Henning; Gajjar, Kshitij
The Space Complexity of Sum Labelling.
Theory Comput. Syst. Bd. 67. H. 5. 2023 S. 1026 - 1049

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
When Stars Control a Grammar's Work.
AFL. 2023 S. 96 - 111

Goergen, Kevin; Fernau, Henning; Oest, Esther et al.
All Paths Lead to Rome.
JCDCGGG. 2022 S. 228 - 256

Bazgan, Cristina; Fernau, Henning
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings
Springer 2022

N. Abu-Khzam, Faisal; Fernau, Henning; Gras, Benjamin et al.
Enumerating Minimal Connected Dominating Sets.
ESA. 2022 S. 1:1 - 1:15

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.
Improved descriptional complexity results on generalized forbidding grammars.
Discret. Appl. Math. Bd. 319. 2022 S. 2 - 18

Vu, Martin; Fernau, Henning
Insertion-deletion systems with substitutions I.
Comput. Bd. 11. H. 1. 2022 S. 57 - 83

N. Abu-Khzam, Faisal; Fernau, Henning; Mann, Kevin
Minimal Roman Dominating Functions: Extensions and Enumeration.
WG. 2022 S. 1 - 15

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.
On the complexity of solution extension of optimization problems.
Theor. Comput. Sci. Bd. 904. 2022 S. 48 - 65

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the computational completeness of matrix simple semi-conditional grammars.
Inf. Comput. Bd. 284. 2022 S. 104688

Fernau, Henning; Holzer, Markus; Wolf, Petra
Preface to Klaus-Jörn Lange Festschrift.
Acta Informatica. Bd. 59. H. 4. 2022 S. 285 - 287

Diekert, Volker; Fernau, Henning; Wolf, Petra
Properties of graphs specified by a regular language.
Acta Informatica. Bd. 59. H. 4. 2022 S. 357 - 385

Fernau, Henning
Special Issue "Selected Algorithmic Papers From CSR 2020".
Algorithms. Bd. 15. H. 11. 2022 S. 426

Fernau, Henning; Bruchertseifer, Jens
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Math. Struct. Comput. Sci. Bd. 32. H. 2. 2022 S. 189 - 215

Fernau, Henning; Haase, Carolina; Hoffmann, Stefan
The Synchronization Game on Subclasses of Automata.
FUN. 2022 S. 14:1 - 14:17

Banyassady, Bahareh; de Berg, Mark; Bringmann, Karl et al.
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.
SoCG. 2022 S. 12:1 - 12:16

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.
Abundant Extensions.
CIAC. 2021 S. 3 - 17

Vu, Martin; Fernau, Henning
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.
SOFSEM. 2021 S. 577 - 592

Vu, Martin; Fernau, Henning
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.
Algorithms. Bd. 14. H. 5. 2021 S. 131

Monnot, Jérôme; Fernau, Henning; F. Manlove, David
Algorithmic aspects of upper edge domination.
Theor. Comput. Sci. Bd. 877. 2021 S. 46 - 57

Arrighi, Emmanuel; Fernau, Henning; Lokshtanov, Daniel et al.
Diversity in Kemeny Rank Aggregation: A Parameterized Approach.
IJCAI. 2021 S. 10 - 16

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars.
Fundam. Informaticae. Bd. 181. H. 2-3. 2021 S. 189 - 211

Fernau, Henning; T. Huber, Katharina; (Seffi) Naor, Joseph
Invited Talks.
CIAC. 2021 S. 3 - 19

Arrighi, Emmanuel; Fernau, Henning; Hoffmann, Stefan et al.
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
FSTTCS. 2021 S. 34:1 - 34:15

Casel, Katrin; Fernau, Henning; Gaspers, Serge et al.
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.
Theory Comput. Syst. Bd. 65. H. 2. 2021 S. 344 - 409

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the generative capacity of matrix insertion-deletion systems of small sum-norm.
Nat. Comput. Bd. 20. H. 4. 2021 S. 671 - 689

Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.
Order Reconfiguration Under Width Constraints.
MFCS. 2021 S. 8:1 - 8:15

Fernau, Henning
Parsimonious Computational Completeness.
DLT. 2021 S. 12 - 26

Fernau, Henning; Malcher, Andreas; Pighizzini, Giovanni
Preface to Martin Kutrib Festschrift.
Acta Informatica. Bd. 58. H. 4. 2021 S. 241 - 242

Diekert, Volker; Fernau, Henning; Wolf, Petra
Properties of Graphs Specified by a Regular Language.
DLT. 2021 S. 117 - 129

Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias
Self-Verifying Pushdown and Queue Automata.
Fundam. Informaticae. Bd. 180. H. 1-2. 2021 S. 1 - 28

Bruchertseifer, Jens; Fernau, Henning
Synchronizing series-parallel deterministic finite automata with loops and related problems.
RAIRO Theor. Informatics Appl. Bd. 55. 2021 S. 1 - 24

Fernau, Henning; Gajjar, Kshitij
The Space Complexity of Sum Labelling.
FCT. 2021 S. 230 - 244

Casel, Katrin; Dreier, Jan; Fernau, Henning et al.
Complexity of independency and cliquy trees.
Discret. Appl. Math. Bd. 272. 2020 S. 2 - 15

Fernau, Henning
Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings
Springer 2020

Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.
Diminishable parameterized problems and strict polynomial kernelization.
Comput. Bd. 9. H. 1. 2020 S. 1 - 24

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability.
Discret. Appl. Math. Bd. 280. 2020 S. 23 - 42

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective.
Int. Conf. on Membrane Computing. 2020 S. 31 - 45

Vu, Martin; Fernau, Henning
Insertion-Deletion Systems with Substitutions I.
CiE. 2020 S. 366 - 378

Vu, Martin; Fernau, Henning
Insertion-Deletion with Substitutions II.
DCFS. 2020 S. 231 - 243

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the Power of Generalized Forbidding Insertion-Deletion Systems.
DCFS. 2020 S. 52 - 63

N. Abu-Khzam, Faisal; Bazgan, Cristina; Fernau, Henning
Parameterized Dynamic Variants of Red-Blue Dominating Set.
SOFSEM. 2020 S. 236 - 247

Fernau, Henning; Manea, Florin; Mercas, Robert et al.
Pattern Matching with Variables: Efficient Algorithms and Complexity Results.
ACM Trans. Comput. Theory. Bd. 12. H. 1. 2020 S. 6:1 - 6:37

Fernau, Henning; Wolf, Petra
Synchronization of Deterministic Visibly Push-Down Automata.
FSTTCS. 2020 S. 45:1 - 45:15

Fernau, Henning; Wolf, Petra; Yamakami, Tomoyuki
Synchronizing Deterministic Push-Down Automata Can Be Really Hard.
MFCS. 2020 S. 33:1 - 33:15

Bruchertseifer, Jens; Fernau, Henning
Synchronizing Words and Monoid Factorization: A Parameterized Perspective.
TAMC. 2020 S. 352 - 364

Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.
Width Notions for Ordering-Related Problems.
FSTTCS. 2020 S. 9:1 - 9:18

Bazgan, Cristina; Fernau, Henning; Tuza, Zsolt
Aspects of upper defensive alliances.
Discret. Appl. Math. Bd. 266. 2019 S. 111 - 120

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1).
Nat. Comput. Bd. 18. H. 3. 2019 S. 563 - 577

Fernau, Henning; V. Gusev, Vladimir; Hoffmann, Stefan et al.
Computational Complexity of Synchronization under Regular Constraints.
MFCS. 2019 S. 63:1 - 63:14

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Descriptional Complexity of Matrix Simple Semi-conditional Grammars.
DCFS. 2019 S. 111 - 123

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.
FCT. 2019 S. 185 - 200

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.
Extension of Vertex Cover and Independent Set in Some Classes of Graphs.
CIAC. 2019 S. 124 - 136

Fernau, Henning; Hoffmann, Stefan
Extensions to Minimal Synchronizing Words.
J. Autom. Lang. Comb. Bd. 24. H. 2-4. 2019 S. 287 - 307

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.
Improved Descriptional Complexity Results on Generalized Forbidding Grammars.
CALDAM. 2019 S. 174 - 188

Chen, Jianer; Fernau, Henning; Shaw, Peter et al.
Kernels for packing and covering problems.
Theor. Comput. Sci. Bd. 790. 2019 S. 152 - 166

Fernau, Henning
Modern Aspects of Complexity Within Formal Languages.
LATA. 2019 S. 3 - 30

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On Matrix Ins-Del Systems of Small Sum-Norm.
SOFSEM. 2019 S. 192 - 205

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On path-controlled insertion-deletion systems.
Acta Informatica. Bd. 56. H. 1. 2019 S. 35 - 59

Fernau, Henning; Stege, Ulrike
Profit Parameterizations of Dominating Set.
AAIM. 2019 S. 108 - 120

Fernau, Henning; Vu, Martin
Regulated Tree Automata.
DCFS. 2019 S. 124 - 136

Bruchertseifer, Jens; Fernau, Henning
Synchronizing series-parallel automata with loops.
NCMA. 2019 S. 63 - 78

N. Abu-Khzam, Faisal; Bazgan, Cristina; Casel, Katrin et al.
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework.
Algorithmica. Bd. 80. H. 9. 2018 S. 2517 - 2550

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems.
UCNC. 2018 S. 86 - 100

Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
CiE. 2018 S. 161 - 171

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Investigations on the power of matrix insertion-deletion systems with small sizes.
Nat. Comput. Bd. 17. H. 2. 2018 S. 249 - 269

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.
MCU. 2018 S. 88 - 104

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus
New Nonterminal Complexity Results for Semi-conditional Grammars.
CiE. 2018 S. 172 - 182

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.
RAIRO Theor. Informatics Appl. Bd. 52. H. 1. 2018 S. 1 - 21

Fernau, Henning; A. Rodríguez-Velázquez, Juan
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results.
Discret. Appl. Math. Bd. 236. 2018 S. 183 - 202

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Properties of Language Classes Between Linear and Context-Free.
J. Autom. Lang. Comb. Bd. 23. H. 4. 2018 S. 329 - 360

Fernau, Henning; Manea, Florin; Mercas, Robert et al.
Revisiting Shinohara's algorithm for computing descriptive patterns.
Theor. Comput. Sci. Bd. 733. 2018 S. 44 - 54

Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.
Simple picture processing based on finite automata and regular grammars.
J. Comput. Syst. Sci. Bd. 95. 2018 S. 232 - 258

N. Abu-Khzam, Faisal; Fernau, Henning; Uehara, Ryuhei
Special Issue on Reconfiguration Problems.
Algorithms. Bd. 11. H. 11. 2018 S. 187

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
The many facets of upper domination.
Theor. Comput. Sci. Bd. 717. 2018 S. 2 - 25

Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.
Characterization and complexity results on jumping finite automata.
Theor. Comput. Sci. Bd. 679. 2017 S. 31 - 52

Casel, Katrin; Fernau, Henning; Grigoriev, Alexander et al.
Combinatorial Properties and Recognition of Unit Square Visibility Graphs.
MFCS. 2017 S. 30:1 - 30:15

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.
CIAA. 2017 S. 89 - 100

Alhazov, Artiom; Fernau, Henning; Freund, Rudolf et al.
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci. Bd. 682. 2017 S. 5 - 21

Fernau, Henning
Extremal Kernelization: A Commemorative Paper.
IWOCA. 2017 S. 24 - 36

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.
DCFS. 2017 S. 128 - 139

Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.
Fundam. Informaticae. Bd. 155. H. 1-2. 2017 S. 209 - 232

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theor. Comput. Sci. Bd. 682. 2017 S. 100 - 121

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.
J. Autom. Lang. Comb. Bd. 22. H. 1-3. 2017 S. 61 - 92

Fernau, Henning; Kuppusamy, Lakshmanan
Parikh Images of Matrix Ins-Del Systems.
TAMC. 2017 S. 201 - 215

Fernau, Henning; Krebs, Andreas
Problems on Finite Automata and the Exponential Time Hypothesis.
Algorithms. Bd. 10. H. 1. 2017 S. 24

Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.
Regular grammars for array languages.
NCMA. 2017 S. 119 - 134

Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias
Self-verifying pushdown automata.
NCMA. 2017 S. 103 - 117

Fernau, Henning; Kuppusamy, Lakshmanan; Verlan, Sergey
Universal Matrix Insertion Grammars with Small Size.
UCNC. 2017 S. 182 - 193

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
AAIM. 2016 S. 113 - 124

Fernau, Henning
An Essay on General Grammars.
J. Autom. Lang. Comb. Bd. 21. H. 1-2. 2016 S. 69 - 92

N. Abu-Khzam, Faisal; Bazgan, Cristina; Casel, Katrin et al.
Building Clusters with Lower-Bounded Sizes.
ISAAC. 2016 S. 4:1 - 4:13

Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.
Contextual Array Grammars with Matrix and Regular Control.
DCFS. 2016 S. 98 - 110

N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.
Data reductions and combinatorial bounds for improved approximation algorithms.
J. Comput. Syst. Sci. Bd. 82. H. 3. 2016 S. 503 - 520

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.
DCFS. 2016 S. 111 - 125

Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
CoRR. Bd. abs/1611.03739. 2016

Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.
UCNC. 2016 S. 35 - 48

Fernau, Henning
Kernelization, Turing Kernels.
Encyclopedia of Algorithms. 2016 S. 1043 - 1045

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
On the Complexity Landscape of the Domination Chain.
CALDAM. 2016 S. 61 - 72

Casel, Katrin; Fernau, Henning; Gaspers, Serge et al.
On the Complexity of Grammar-Based Compression over Fixed Alphabets.
ICALP. 2016 S. 122:1 - 122:14

Fernau, Henning; L. Schmid, Markus; Villanger, Yngve
On the Parameterised Complexity of String Morphism Problems.
Theory Comput. Syst. Bd. 59. H. 1. 2016 S. 24 - 51

Fernau, Henning
Parameterized Algorithms for Drawing Graphs.
Encyclopedia of Algorithms. 2016 S. 1520 - 1525

Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.
Picture Scanning Automata.
CompIMAGE. 2016 S. 132 - 147

Björklund, Johanna; Fernau, Henning; Kasprzik, Anna
Polynomial inference of universal automata from membership and equivalence queries.
Inf. Comput. Bd. 246. 2016 S. 3 - 19

Fernau, Henning; Krebs, Andreas
Problems on Finite Automata and the Exponential Time Hypothesis.
CIAA. 2016 S. 89 - 100

Fernau, Henning
Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue.
Algorithms. Bd. 9. H. 4. 2016 S. 64

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Upper Domination: Complexity and Approximation.
IWOCA. 2016 S. 241 - 252

Casel, Katrin; Estrada-Moreno, Alejandro; Fernau, Henning et al.
Weak total resolvability in graphs.
Discuss. Math. Graph Theory. Bd. 36. H. 1. 2016 S. 185 - 210

Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
A multi-parameter analysis of hard problems on deterministic finite automata.
J. Comput. Syst. Sci. Bd. 81. H. 4. 2015 S. 747 - 765

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Algorithmic Aspects of Upper Domination.
CoRR. Bd. abs/1506.07260. 2015

Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.
Characterization and Complexity Results on Jumping Finite Automata.
CoRR. Bd. abs/1512.00482. 2015

Bermudo, Sergio; Fernau, Henning
Combinatorics for smaller kernels: The differential of a graph.
Theor. Comput. Sci. Bd. 562. 2015 S. 330 - 345

Fernau, Henning; Heggernes, Pinar; van 't Hof, Pim et al.
Computing the metric dimension for chain graphs.
Inf. Process. Lett. Bd. 115. H. 9. 2015 S. 671 - 676

Fernau, Henning; Freund, Rudolf; L. Schmid, Markus et al.
Contextual array grammars and array P systems.
Ann. Math. Artif. Intell. Bd. 75. H. 1-2. 2015 S. 5 - 26

Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus
Jumping Finite Automata: Characterizations and Complexity.
CIAA. 2015 S. 89 - 101

Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín
Kernelization Algorithms for Packing Problems Allowing Overlaps.
TAMC. 2015 S. 415 - 427

Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.
MCU. 2015 S. 61 - 78

Fernau, Henning; V. Fomin, Fedor; Philip, Geevarghese et al.
On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Theor. Comput. Sci. Bd. 565. 2015 S. 1 - 15

Fernau, Henning; L. Schmid, Markus
Pattern matching with variables: A multivariate complexity analysis.
Inf. Comput. Bd. 242. 2015 S. 287 - 305

Fernau, Henning; Manea, Florin; Mercas, Robert et al.
Pattern Matching with Variables: Fast Algorithms and New Hardness Results.
STACS. 2015 S. 302 - 315

Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.
Scanning Pictures the Boustrophedon Way.
IWCIA. 2015 S. 202 - 216

Fernau, Henning; Freund, Rudolf; Holzer, Markus
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.
Int. J. Found. Comput. Sci. Bd. 26. H. 8. 2015 S. 1167 - 1188

Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.
ACM Trans. Comput. Theory. Bd. 7. H. 3. 2015 S. 13:1 - 13:29

Binkele-Raible, Daniel; Fernau, Henning
A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph.
Discret. Math. Theor. Comput. Sci. Bd. 16. H. 1. 2014 S. 179 - 200

N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.
Approximation Algorithms Inspired by Kernelization Methods.
ISAAC. 2014 S. 479 - 490

Bermudo, Sergio; Fernau, Henning
Computing the differential of a graph: Hardness, approximability and exact algorithms.
Discret. Appl. Math. Bd. 165. 2014 S. 69 - 82

Fernau, Henning; Freund, Rudolf; Holzer, Markus
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes.
AFL. 2014 S. 246 - 260

N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms.
CoRR. Bd. abs/1409.3742. 2014

Fernau, Henning; Meister, Daniel
Digraphs of bounded elimination width.
Discret. Appl. Math. Bd. 168. 2014 S. 78 - 87

Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín
Kernelization Algorithms for Packing Problems Allowing Overlaps.
CoRR. Bd. abs/1411.6915. 2014

Gobbert, Moritz; Fernau, Henning
Latrunculi - on the complexity of Roman chess.
NCMA. 2014 S. 115 - 130

Fernau, Henning; Alberto Rodríguez-Velázquez, Juan
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results.
CSR. 2014 S. 153 - 166

Binkele-Raible, Daniel; Erdélyi, Gábor; Fernau, Henning et al.
The complexity of probabilistic lobbying.
Discret. Optim. Bd. 11. 2014 S. 1 - 21

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

Brankovic, Ljiljana; Fernau, Henning
A novel parameterised approximation algorithm for minimum vertex cover.
Theor. Comput. Sci. Bd. 511. 2013 S. 85 - 108

Fernau, Henning; Freund, Rudolf; Ivanov, Sergiu et al.
Array Insertion and Deletion P Systems.
UCNC. 2013 S. 67 - 78

Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge et al.
Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica. Bd. 65. H. 1. 2013 S. 95 - 128

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

Fernau, Henning; L. Schmid, Markus; Villanger, Yngve
On the Parameterised Complexity of String Morphism Problems.
FSTTCS. 2013 S. 55 - 66

Binkele-Raible, Daniel; Fernau, Henning
Packing paths: Recycling saves time.
Discret. Appl. Math. Bd. 161. H. 12. 2013 S. 1686 - 1698

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

Fernau, Henning; L. Schmid, Markus; G. Subramanian, K.
Two-dimensional pattern languages.
NCMA. 2013 S. 117 - 132

Binkele-Raible, Daniel; Fernau, Henning
An Exact Exponential Time Algorithm for Power Dominating Set.
Algorithmica. Bd. 63. H. 1-2. 2012 S. 323 - 346

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

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

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

Fernau, Henning; Martín-Vide, Carlos
From the Guest Editors.
J. Comput. Syst. Sci. Bd. 78. H. 6. 2012 S. 1793 - 1794

Binkele-Raible, Daniel; Fernau, Henning; V. Fomin, Fedor et al.
Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms. Bd. 8. H. 4. 2012 S. 38:1 - 38:19

Chen, Jianer; Fernau, Henning; Shaw, Peter et al.
Kernels for Packing and Covering Problems - (Extended Abstract).
FAW-AAIM. 2012 S. 199 - 211

Bermudo, Sergio; Fernau, Henning
Lower bounds on the differential of a graph.
Discret. Math. Bd. 312. H. 22. 2012 S. 3236 - 3250

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

Binkele-Raible, Daniel; Fernau, Henning
Parameterized Measure & Conquer for Problems with No Small Kernels.
Algorithmica. Bd. 64. H. 1. 2012 S. 189 - 212

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

Fernau, Henning; Kneis, Joachim; Kratsch, Dieter et al.
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci. Bd. 412. H. 45. 2011 S. 6290 - 6302

Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek et al.
Breaking the 2-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms. Bd. 9. H. 3. 2011 S. 214 - 230

N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael et al.
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.
Discret. Optim. Bd. 8. H. 1. 2011 S. 41 - 49

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

R. Fellows, Michael; Fernau, Henning
Facility location problems: A parameterized view.
Discret. Appl. Math. Bd. 159. H. 11. 2011 S. 1118 - 1130

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

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

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

N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael et al.
A Fixed-Parameter Algorithm for String-to-String Correction.
CATS. 2010 S. 31 - 38

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

Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning et al.
A Parameterized Route to Exact Puzzles: Breaking the 2-Barrier for Irredundance.
CIAC. 2010 S. 311 - 322

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

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

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

Fernau, Henning; Kaufmann, Michael; Poths, Mathias
Comparing trees via crossing minimization.
J. Comput. Syst. Sci. Bd. 76. H. 7. 2010 S. 593 - 608

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

Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge et al.
Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett. Bd. 111. H. 2. 2010 S. 64 - 67

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

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

Dediu, Adrian-Horia; Fernau, Henning; Martín-Vide, Carlos
Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings
Springer 2010

Fernau, Henning
minimum dominating set of queens: A trivial programming exercise?
Discret. Appl. Math. Bd. 158. H. 4. 2010 S. 308 - 318

Fernau, Henning
Parameterized algorithmics for -Hitting Set.
Int. J. Comput. Math. Bd. 87. H. 14. 2010 S. 3157 - 3174

Fernau, Henning
Parameterized algorithms for d-Hitting Set: The weighted case.
Theor. Comput. Sci. Bd. 411. H. 16-18. 2010 S. 1698 - 1713

Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Ranking and Drawing in Subexponential Time.
IWOCA. 2010 S. 337 - 348

Fernau, Henning; V. Fomin, Fedor; Philip, Geevarghese et al.
The Curse of Connectivity: -Total Vertex (Edge) Cover.
COCOON. 2010 S. 34 - 43

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

Fernau, Henning; Raible, Daniel
A parameterized perspective on packing paths of length two.
J. Comb. Optim. Bd. 18. H. 4. 2009 S. 319 - 341

Fernau, Henning
Algorithms for learning regular expressions from positive data.
Inf. Comput. Bd. 207. H. 4. 2009 S. 521 - 541

Fernau, Henning; Kneis, Joachim; Kratsch, Dieter et al.
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
IWPEC. 2009 S. 161 - 172

Brankovic, Ljiljana; Fernau, Henning; Kneis, Joachim et al.
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR. Bd. abs/0909.4224. 2009

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

Fernau, Henning; Gaspers, Serge; Kratsch, Dieter et al.
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
CTW. 2009 S. 205 - 209

Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.
STACS. 2009 S. 421 - 432

Fernau, Henning; Alberto Rodríguez-Velázquez, Juan; María Sigarreta, José
Offensive r-alliances in graphs.
Discret. Appl. Math. Bd. 157. H. 1. 2009 S. 177 - 182

María Sigarreta, José; Bermudo, Sergio; Fernau, Henning
On the complement graph and defensive k-alliances.
Discret. Appl. Math. Bd. 157. H. 8. 2009 S. 1687 - 1695

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

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

Erdélyi, Gábor; Fernau, Henning; Goldsmith, Judy et al.
The Complexity of Probabilistic Lobbying
CoRR. Bd. abs/0906.4431. 2009

Erdélyi, Gábor; Fernau, Henning; Goldsmith, Judy et al.
The Complexity of Probabilistic Lobbying.
ADT. 2009 S. 86 - 97

Fernau, Henning; F. Manlove, David
Vertex and edge covers with clustering properties: Complexity and algorithms.
J. Discrete Algorithms. Bd. 7. H. 2. 2009 S. 149 - 167

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

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

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

Chen, Jianer; Fernau, Henning; Ning, Dan et al.
A Parameterized Perspective on P-Packings
CoRR. Bd. abs/0804.0570. 2008

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

Fernau, Henning; F. Ryan, Joseph; A. Sugeng, Kiki
A sum labelling for the generalised friendship graph.
Discret. Math. Bd. 308. H. 5-6. 2008 S. 734 - 740

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

Fernau, Henning; Stiebe, Ralf
Blind Counter Automata on omega-Words.
Fundam. Informaticae. Bd. 83. H. 1-2. 2008 S. 51 - 64

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

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

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

Fernau, Henning; Raible, Daniel; Gaspers, Serge et al.
Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR. Bd. abs/0811.1875. 2008

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

Dujmovic, Vida; Fernau, Henning; Kaufmann, Michael
Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms. Bd. 6. H. 2. 2008 S. 313 - 323

Fernau, Henning; Alberto Rodríguez-Velázquez, Juan; María Sigarreta, José
Global -alliances and total domination.
CTW. 2008 S. 98 - 101

Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
CoRR. Bd. abs/0810.4796. 2008

Martín-Vide, Carlos; Otto, Friedrich; Fernau, Henning
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers
Springer 2008

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

Fernau, Henning
Parameterized algorithmics for linear arrangement problems.
Discret. Appl. Math. Bd. 156. H. 17. 2008 S. 3166 - 3177

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

Raible, Daniel; Fernau, Henning
Power Domination in O(1.7548) Using Reference Search Trees.
ISAAC. 2008 S. 136 - 147

Fernau, Henning
ROMAN DOMINATION: a parameterized perspective.
Int. J. Comput. Math. Bd. 85. H. 1. 2008 S. 25 - 38

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

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

Fernau, Henning; Reinhardt, Klaus; Staiger, Ludwig
Decidability of code properties.
RAIRO Theor. Informatics Appl. Bd. 41. H. 3. 2007 S. 243 - 259

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

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

Fernau, Henning
Learning tree languages from text.
RAIRO Theor. Informatics Appl. Bd. 41. H. 4. 2007 S. 351 - 374

Chen, Jianer; Fernau, Henning; A. Kanj, Iyad et al.
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
SIAM J. Comput. Bd. 37. H. 4. 2007 S. 1077 - 1106

Fernau, Henning
Programmed Grammars with Rule Queues.
Int. J. Found. Comput. Sci. Bd. 18. H. 6. 2007 S. 1209 - 1213

Fernau, Henning; Freund, Rudolf; Oswald, Marion et al.
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
J. Autom. Lang. Comb. Bd. 12. H. 1-2. 2007 S. 117 - 138

Bordihn, Henning; Fernau, Henning
The Degree of Parallelism.
J. Autom. Lang. Comb. Bd. 12. H. 1-2. 2007 S. 25 - 47

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

Bordihn, Henning; Fernau, Henning; Holzer, Markus et al.
Iterated sequential transducers as language generating devices.
Theor. Comput. Sci. Bd. 369. H. 1-3. 2006 S. 67 - 81

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

K. H. A. Dehne, Frank; R. Fellows, Michael; Fernau, Henning et al.
NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
SOFSEM. 2006 S. 237 - 245

N. Abu-Khzam, Faisal; Fernau, Henning
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.
Electron. Notes Discret. Math. Bd. 25. 2006 S. 1 - 6

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

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 Set
Electron. 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

Fernau, Henning
Parametric Duality: Kernel Sizes and Algorithmics
Electron. Colloquium Comput. Complex. Bd. TR04. H. 027. 2004

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

Fernau, Henning
Two-Layer Planarization: Improving on Parameterized Algorithmics
Electron. Colloquium Comput. Complex. Bd. TR04. H. 078. 2004

Fernau, Henning; Meduna, Alexander
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett. Bd. 86. H. 5. 2003 S. 235 - 240

Fernau, Henning
Education(al) matters: teaching P versus NP.
Bull. EATCS. Bd. 80. 2003 S. 237 - 246

Dujmovic, Vida; Fernau, Henning; Kaufmann, Michael
Fixed Parameter Algorithms for one-sided crossing minimization Revisited.
GD. 2003 S. 332 - 344

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

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

Fernau, Henning
Identification of function distinguishable languages.
Theor. Comput. Sci. Bd. 290. H. 3. 2003 S. 1679 - 1711

Fernau, Henning
Nonterminal complexity of programmed grammars.
Theor. Comput. Sci. Bd. 296. H. 2. 2003 S. 225 - 251

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

Fernau, Henning; Meduna, Alexander
On the degree of scattered context-sensitivity.
Theor. Comput. Sci. Bd. 290. H. 3. 2003 S. 2121 - 2124

Fernau, Henning; Hagerup, Torben; Nishimura, Naomi et al.
On the parameterized complexity of the generalized rush hour puzzle.
CCCG. 2003 S. 6 - 9

Fernau, Henning
Parallel Grammars: A Phenomenology.
Grammars. Bd. 6. H. 1. 2003 S. 25 - 87

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

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

Alber, Jochen; L. Bodlaender, Hans; Fernau, Henning et al.
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica. Bd. 33. H. 4. 2002 S. 461 - 493

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

W. Adriaans, Pieter; Fernau, Henning; van Zaanen, Menno
Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings
Springer 2002

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

Fernau, Henning; Holzer, Markus
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
J. Autom. Lang. Comb. Bd. 7. H. 4. 2002 S. 487 - 503

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

Fernau, Henning
On Parameterized Enumeration.
COCOON. 2002 S. 564 - 573

Fernau, Henning; Stiebe, Ralf
Sequential grammars and automata with valences.
Theor. Comput. Sci. Bd. 276. H. 1-2. 2002 S. 377 - 405

Fernau, Henning; Niedermeier, Rolf
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
J. Algorithms. Bd. 38. H. 2. 2001 S. 374 - 410

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

Hüffner, Falk; Edelkamp, Stefan; Fernau, Henning et al.
Finding Optimal Solutions to Atomix.
KI/ÖGAI. 2001 S. 229 - 243

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

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

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

Fernau, Henning; Staiger, Ludwig
Iterated Function Systems and Control Languages.
Inf. Comput. Bd. 168. H. 2. 2001 S. 125 - 143

Fernau, Henning
Learning XML Grammars.
MLDM. 2001 S. 73 - 87

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

Fernau, Henning
Parallel communicating grammar systems with terminal transmission.
Acta Informatica. Bd. 37. H. 7. 2001 S. 511 - 540

Alber, Jochen; Fernau, Henning; Niedermeier, Rolf
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Electron. Colloquium Comput. Complex. Bd. TR01. H. 23. 2001

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

Alber, Jochen; Fan, Hongbing; R. Fellows, Michael et al.
Refined Search Tree Technique for DOMINATING SET on Planar Graphs.
MFCS. 2001 S. 111 - 122

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

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

Fernau, Henning; Stiebe, Ralf
Valences in Lindenmayer Systems.
Fundam. Informaticae. Bd. 45. H. 4. 2001 S. 329 - 358

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

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

Alber, Jochen; L. Bodlaender, Hans; Fernau, Henning et al.
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.
SWAT. 2000 S. 97 - 110

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

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

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

Fernau, Henning
Regulated Grammars under Leftmost Derivation.
Grammars. Bd. 3. H. 1. 2000 S. 37 - 62

Fernau, Henning
Terminal distinguishable languages.
AI&M. 2000

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

Fernau, Henning; Stephan, Frank
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.
J. Autom. Lang. Comb. Bd. 4. H. 2. 1999 S. 117 - 142

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

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

Bordihn, Henning; Fernau, Henning; Holzer, Markus
On Accepting Pure Lindenmayer Systems.
Fundam. Informaticae. Bd. 38. H. 4. 1999 S. 365 - 375

Dassow, Jürgen; Fernau, Henning; Paun, Gheorghe
On the Leftmost Derivation in Matrix Grammars.
Int. J. Found. Comput. Sci. Bd. 10. H. 1. 1999 S. 61 - 80

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

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

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

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

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

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

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

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

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

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

Fernau, Henning
Graph-Controlled Grammars as Language Acceptors.
J. Autom. Lang. Comb. Bd. 2. H. 2. 1997 S. 79 - 91

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

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

Fernau, Henning
Unconditional Transfer in Regulated Rewriting.
Acta Informatica. Bd. 34. H. 11. 1997 S. 837 - 857

Bordihn, Henning; Fernau, Henning
Accepting Grammars and Systems via Context Condition Grammars.
J. Autom. Lang. Comb. Bd. 1. H. 2. 1996 S. 97 - 112

Fernau, Henning; Holzer, Markus
Accepting Multi-Agent Systems II.
Acta Cybern. Bd. 12. H. 4. 1996 S. 361 - 379

Fernau, Henning; Holzer, Markus; Bordihn, Henning
Accepting Multi-Agent Systems.
Comput. Artif. Intell. Bd. 15. H. 2-3. 1996 S. 123 - 139

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

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

Fernau, Henning
Closure Properties of Ordered Languages.
Bull. EATCS. Bd. 58. 1996

Fernau, Henning
Membership for k-Limited ET0L Languages is not Decidable.
J. Autom. Lang. Comb. Bd. 1. H. 4. 1996 S. 243 - 245

Fernau, Henning
On Grammar and Language Families.
Fundam. Informaticae. Bd. 25. H. 1. 1996 S. 17 - 34

Fernau, Henning
On Unconditional Transfer.
MFCS. 1996 S. 348 - 359

Fernau, Henning
Remarks on Propagating Partition-Limited ETOL Systems.
J. Univers. Comput. Sci. Bd. 2. H. 11. 1996 S. 745 - 755

Fernau, Henning
A Note on Uniformly Limited ETOL Systems with Unique Interpretation.
Inf. Process. Lett. Bd. 54. H. 4. 1995 S. 199 - 204

Fernau, Henning
A predicate for separating language classes.
Bull. EATCS. Bd. 56. 1995

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

Fernau, Henning; Bordihn, Henning
Remarks on accepting parallel systems.
Int. J. Comput. Math. Bd. 56. H. 1-2. 1995 S. 51 - 67

Fernau, Henning
Valuations of Languages, with Applications to Fractal Geometry.
Theor. Comput. Sci. Bd. 137. H. 2. 1995 S. 177 - 217

Fernau, Henning
Valuations, regular expressions, and fractal geometry.
Appl. Algebra Eng. Commun. Comput. Bd. 7. H. 1. 1995 S. 59 - 75

Fernau, Henning
Iterierte Funktionen, Sprachen und Fraktale.
BI-Wiss.-Verlag 1994 S. 1 - 288

Fernau, Henning
Membership for 1-Limited ET0L Languages Is Not Decidable.
J. Inf. Process. Cybern. Bd. 30. H. 4. 1994 S. 191 - 211

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

Fernau, Henning
Adult Languages of Propagating Systems with Restricted Parallelism.
J. Inf. Process. Cybern. Bd. 29. H. 5. 1993 S. 249 - 267

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

Fernau, Henning
On Function-limited Lindenmayer Systems.
J. Inf. Process. Cybern. Bd. 27. H. 1. 1991 S. 21 - 53