On Function-limited Lindenmayer Systems. - Henning Fernau (J. Inf. Process. Cybern., 1991)

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

Adult Languages of Propagating Systems with Restricted Parallelism. - Henning Fernau (J. Inf. Process. Cybern., 1993)

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

Membership for 1-Limited ET0L Languages Is Not Decidable. - Henning Fernau (J. Inf. Process. Cybern., 1994)

Iterierte Funktionen, Sprachen und Fraktale. - Henning Fernau (BI-Wiss.-Verlag, 1994)

Accepting Grammars and Systems: An Overview. - Henning Bordihn; Henning Fernau (Developments in Language Theory, 1995)

Valuations, regular expressions, and fractal geometry. - Henning Fernau (Appl. Algebra Eng. Commun. Comput., 1995)

A predicate for separating language classes. - Henning Fernau (Bull. EATCS, 1995)

Remarks on accepting parallel systems. - Henning Fernau; Henning Bordihn (Int. J. Comput. Math., 1995)

A Note on Uniformly Limited ETOL Systems with Unique Interpretation. - Henning Fernau (Inf. Process. Lett., 1995)

Valuations of Languages, with Applications to Fractal Geometry. - Henning Fernau (Theor. Comput. Sci., 1995)

Advocating Ownership. - Henning Fernau; Klaus-Jörn Lange; Klaus Reinhardt (FSTTCS, 1996)

On Unconditional Transfer. - Henning Fernau (MFCS, 1996)

Bounded Parallelism in Array Grammars Used for Character Recognition. - Henning Fernau; Rudolf Freund (SSPR, 1996)

Accepting Multi-Agent Systems II. - Henning Fernau; Markus Holzer 001 (Acta Cybern., 1996)

Accepting Multi-Agent Systems. - Henning Fernau; Markus Holzer 001; Henning Bordihn (Comput. Artif. Intell., 1996)

Closure Properties of Ordered Languages. - Henning Fernau (Bull. EATCS, 1996)

On Grammar and Language Families. - Henning Fernau (Fundam. Informaticae, 1996)

Accepting Grammars and Systems via Context Condition Grammars. - Henning Bordihn; Henning Fernau (J. Autom. Lang. Comb., 1996)

Membership for k-Limited ET0L Languages is not Decidable. - Henning Fernau (J. Autom. Lang. Comb., 1996)

Remarks on Propagating Partition-Limited ETOL Systems. - Henning Fernau (J. Univers. Comput. Sci., 1996)

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

Conditional Context-Free Languages of Finite Index. - Henning Fernau; Markus Holzer 001 (New Trends in Formal Languages, 1997)

Bounding resources in Cooperating Distributed Grammar Systems. - Henning Fernau; Markus Holzer 001; Rudolf Freund (Developments in Language Theory, 1997)

How Powerful is Unconditional Transfer? - When UT meets AC. - Henning Fernau; Frank Stephan 001 (Developments in Language Theory, 1997)

Regulations by Valences. - Henning Fernau; Ralf Stiebe (MFCS, 1997)

Unconditional Transfer in Regulated Rewriting. - Henning Fernau (Acta Informatica, 1997)

Graph-Controlled Grammars as Language Acceptors. - Henning Fernau (J. Autom. Lang. Comb., 1997)

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

IFS and Control Languages. - Henning Fernau; Ludwig Staiger (MFCS, 1998)

Regulated Grammars with Leftmost Derivation. - Henning Fernau (SOFSEM, 1998)

Character Recognition with k-Head Finite Array Automata. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (SSPR/SPR, 1998)

Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. - Henning Fernau; Dietmar Wätjen (Theor. Comput. Sci., 1998)

Efficient Learning of Some Linear Matrix Languages. - Henning Fernau (COCOON, 1999)

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

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

On Accepting Pure Lindenmayer Systems. - Henning Bordihn; Henning Fernau; Markus Holzer 001 (Fundam. Informaticae, 1999)

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

Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. - Henning Fernau; Frank Stephan 001 (J. Autom. Lang. Comb., 1999)

Terminal distinguishable languages. - Henning Fernau (AI&M, 2000)

External Contextual and Conditional Languages. - Henning Fernau; Markus Holzer 001 (Recent Topics in Mathematical and Computational Linguistics, 2000)

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

k-gram Extensions of Terminal Distinguishable Languages. - Henning Fernau (ICPR, 2000)

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

Regulated Grammars under Leftmost Derivation. - Henning Fernau (Grammars, 2000)

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

Valence Grammars with Target Sets. - Henning Fernau; Ralf Stiebe (Words, Semigroups, and Transductions, 2001)

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

Even Linear Simple Matrix Languages: Formal Language Aspects. - Henning Fernau (DMTCS, 2001)

Finding Optimal Solutions to Atomix. - Falk Hüffner; Stefan Edelkamp; Henning Fernau; Rolf Niedermeier (KI/ÖGAI, 2001)

Learning XML Grammars. - Henning Fernau (MLDM, 2001)

Approximative Learning of Regular Languages. - Henning Fernau (SOFSEM, 2001)

Parallel communicating grammar systems with terminal transmission. - Henning Fernau (Acta Informatica, 2001)

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

Valences in Lindenmayer Systems. - Henning Fernau; Ralf Stiebe (Fundam. Informaticae, 2001)

Iterated Function Systems and Control Languages. - Henning Fernau; Ludwig Staiger (Inf. Comput., 2001)

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. - Henning Fernau; Rolf Niedermeier (J. Algorithms, 2001)

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. - Henning Fernau; Markus Holzer 001; Rudolf Freund (Theor. Comput. Sci., 2001)

On Parameterized Enumeration. - Henning Fernau (COCOON, 2002)

Fragmentation: Enhancing Identifiability. - Henning Fernau (ICGI, 2002)

Algorithms for Learning Function Distinguishable Regular Languages. - Henning Fernau; Agnes Radl (SSPR/SPR, 2002)

Graph Separator Algorithms: A Refined Analysis. - Henning Fernau (WG, 2002)

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

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. - Henning Fernau; Markus Holzer 001 (J. Autom. Lang. Comb., 2002)

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

Sequential grammars and automata with valences. - Henning Fernau; Ralf Stiebe (Theor. Comput. Sci., 2002)

On Iterated Sequential Transducers. - Henning Bordihn; Henning Fernau; Markus Holzer 001 (Grammars and Automata for String Processing, 2003)

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

Education(al) matters: teaching P versus NP. - Henning Fernau (Bull. EATCS, 2003)

Parallel Grammars: A Phenomenology. - Henning Fernau (Grammars, 2003)

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

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

Identification of function distinguishable languages. - Henning Fernau (Theor. Comput. Sci., 2003)

Nonterminal complexity of programmed grammars. - Henning Fernau (Theor. Comput. Sci., 2003)

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

On the degree of scattered context-sensitivity. - Henning Fernau; Alexander Meduna (Theor. Comput. Sci., 2003)

Extracting Minimum Length Document Type Definitions Is NP-Hard. - Henning Fernau (ICGI, 2004)

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

A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. - Henning Fernau; David W. Juedes (MFCS, 2004)

Complexity of a {0, 1}-matrix problem. - Henning Fernau (Australas. J Comb., 2004)

Identifying Terminal Distinguishable Languages. - Henning Fernau (Ann. Math. Artif. Intell., 2004)

Parametric Duality: Kernel Sizes and Algorithmics - Henning Fernau (Electron. Colloquium Comput. Complex., 2004)

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set - Henning Fernau (Electron. Colloquium Comput. Complex., 2004)

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

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

Asymptotically Faster Algorithms for Parameterized FACE COVER. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston (ACiD, 2005)

Algorithms for Learning Regular Expressions. - Henning Fernau (ALT, 2005)

Refining the Nonterminal Complexity of Graph-controlled Grammars. - Henning Fernau; Rudolf Freund; Marion Oswald; Klaus Reinhardt (DCFS, 2005)

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Fundam. Informaticae, 2005)

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

Two-Layer Planarization: Improving on Parameterized Algorithmics. - Henning Fernau (J. Graph Algorithms Appl., 2005)

Kernels: Annotated, Proper and Induced. - Faisal N. Abu-Khzam; Henning Fernau (IWPEC, 2006)

edge dominating set: Efficient Enumeration-Based Exact Algorithms. - Henning Fernau (IWPEC, 2006)

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

Parameterized Algorithms for Hitting Set: the Weighted Case. - Henning Fernau (Electron. Colloquium Comput. Complex., 2006)

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. - Faisal N. Abu-Khzam; Henning Fernau (Electron. Notes Discret. Math., 2006)

Speeding up Exact Algorithms With High Probability. - Henning Fernau (Electron. Notes Discret. Math., 2006)

Iterated sequential transducers as language generating devices. - Henning Bordihn; Henning Fernau; Markus Holzer 001; Vincenzo Manca; Carlos Martín-Vide (Theor. Comput. Sci., 2006)

Dynamic programming for queen domination. - Henning Fernau (CTW, 2007)

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

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

Programmed Grammars with Rule Queues. - Henning Fernau (Int. J. Found. Comput. Sci., 2007)

Learning tree languages from text. - Henning Fernau (RAIRO Theor. Informatics Appl., 2007)

Decidability of code properties. - Henning Fernau; Klaus Reinhardt; Ludwig Staiger (RAIRO Theor. Informatics Appl., 2007)

The Degree of Parallelism. - Henning Bordihn; Henning Fernau (J. Autom. Lang. Comb., 2007)

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. - Henning Fernau; Rudolf Freund; Marion Oswald; Klaus Reinhardt (J. Autom. Lang. Comb., 2007)

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

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

An Optimal Construction of Finite Automata from Regular Expressions. - Stefan Gulan; Henning Fernau (FSTTCS, 2008)

Power Domination in O*(1.7548n) Using Reference Search Trees. - Daniel Raible 001; Henning Fernau (ISAAC, 2008)

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

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. - Henning Fernau; Daniel Raible 001 (WALCOM, 2008)

A Parameterized Perspective on P2-Packings - Jianer Chen; Henning Fernau; Dan Ning; Daniel Raible 001; Jianxin Wang 001 (CoRR, 2008)

Exact Exponential Time Algorithms for Max Internal Spanning Tree - Henning Fernau; Daniel Raible 001; Serge Gaspers; Alexey A. Stepanov (CoRR, 2008)

Parameterized algorithmics for linear arrangement problems. - Henning Fernau (Discret. Appl. Math., 2008)

A sum labelling for the generalised friendship graph. - Henning Fernau; Joseph F. Ryan 001; Kiki A. Sugeng (Discret. Math., 2008)

Blind Counter Automata on omega-Words. - Henning Fernau; Ralf Stiebe (Fundam. Informaticae, 2008)

Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. - Jürgen Dassow; Henning Fernau (Inf. Comput., 2008)

ROMAN DOMINATION: a parameterized perspective. - Henning Fernau (Int. J. Comput. Math., 2008)

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

Fixed parameter algorithms for one-sided crossing minimization revisited. - Vida Dujmovic; Henning Fernau; Michael Kaufmann 001 (J. Discrete Algorithms, 2008)

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

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. - Henning Fernau; Serge Gaspers; Dieter Kratsch; Mathieu Liedloff; Daniel Raible 001 (CTW, 2009)

Searching Trees: An Essay. - Henning Fernau; Daniel Raible 001 (TAMC, 2009)

Exact and Parameterized Algorithms for Max Internal Spanning Tree. - Henning Fernau; Serge Gaspers; Daniel Raible 001 (WG, 2009)

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

Offensive r-alliances in graphs. - Henning Fernau; Juan Alberto Rodríguez-Velázquez; José María Sigarreta (Discret. Appl. Math., 2009)

On the complement graph and defensive k-alliances. - José María Sigarreta; Sergio Bermudo; Henning Fernau (Discret. Appl. Math., 2009)

Algorithms for learning regular expressions from positive data. - Henning Fernau (Inf. Comput., 2009)

A parameterized perspective on packing paths of length two. - Henning Fernau; Daniel Raible 001 (J. Comb. Optim., 2009)

Vertex and edge covers with clustering properties: Complexity and algorithms. - Henning Fernau; David F. Manlove (J. Discrete Algorithms, 2009)

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

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

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

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

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

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

Ranking and Drawing in Subexponential Time. - Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Matthias Mnich; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2010)

Enumerate and Measure: Improving Parameter Budget Management. - Daniel Binkele-Raible; Henning Fernau (IPEC, 2010)

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

An Amortized Search Tree Analysis for k-Leaf Spanning Tree. - Daniel Raible 001; Henning Fernau (SOFSEM, 2010)

minimum dominating set of queens: A trivial programming exercise? - Henning Fernau (Discret. Appl. Math., 2010)

Parameterized algorithmics for d-Hitting Set. - Henning Fernau (Int. J. Comput. Math., 2010)

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

Comparing trees via crossing minimization. - Henning Fernau; Michael Kaufmann 001; Mathias Poths (J. Comput. Syst. Sci., 2010)

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

Parameterized algorithms for d-Hitting Set: The weighted case. - Henning Fernau (Theor. Comput. Sci., 2010)

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

Computing the differential of a graph. - Sergio Bermudo; Henning Fernau (CTW, 2011)

Parameterized Approximation Algorithms for Hitting Set. - Ljiljana Brankovic; Henning Fernau (WAOA, 2011)

Facility location problems: A parameterized view. - Michael R. Fellows; Henning Fernau (Discret. Appl. Math., 2011)

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston; Serena Lee-Cultura; Ulrike Stege (Discret. Optim., 2011)

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

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

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

Cooperating Distributed Tree Automata. - Henning Fernau (Languages Alive, 2012)

Saving on Phases: Parameterized Approximation for Total Vertex Cover. - Henning Fernau (IWOCA, 2012)

An Exact Exponential Time Algorithm for Power Dominating Set. - Daniel Binkele-Raible; Henning Fernau (Algorithmica, 2012)

Parameterized Measure & Conquer for Problems with No Small Kernels. - Daniel Binkele-Raible; Henning Fernau (Algorithmica, 2012)

Lower bounds on the differential of a graph. - Sergio Bermudo; Henning Fernau (Discret. Math., 2012)

Constraint bipartite vertex cover: simpler exact algorithms and implementations. - Guoqiang Bai 002; Henning Fernau (J. Comb. Optim., 2012)

From the Guest Editors. - Henning Fernau; Carlos Martín-Vide (J. Comput. Syst. Sci., 2012)

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

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

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

MAT Learning of Universal Automata. - Johanna Björklund; Henning Fernau; Anna Kasprzik (LATA, 2013)

A Multivariate Analysis of Some DFA Problems. - Henning Fernau; Pinar Heggernes; Yngve Villanger (LATA, 2013)

Two-dimensional pattern languages. - Henning Fernau; Markus L. Schmid; K. G. Subramanian 001 (NCMA, 2013)

Array Insertion and Deletion P Systems. - Henning Fernau; Rudolf Freund; Sergiu Ivanov 001; Markus L. Schmid; K. G. Subramanian 001 (UCNC, 2013)

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

Packing paths: Recycling saves time. - Daniel Binkele-Raible; Henning Fernau (Discret. Appl. Math., 2013)

A novel parameterised approximation algorithm for minimum vertex cover. - Ljiljana Brankovic; Henning Fernau (Theor. Comput. Sci., 2013)

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

Approximation Algorithms Inspired by Kernelization Methods. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (ISAAC, 2014)

Latrunculi - on the complexity of Roman chess. - Moritz Gobbert; Henning Fernau (NCMA, 2014)

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (AFL, 2014)

Computing the differential of a graph: Hardness, approximability and exact algorithms. - Sergio Bermudo; Henning Fernau (Discret. Appl. Math., 2014)

Digraphs of bounded elimination width. - Henning Fernau; Daniel Meister 001 (Discret. Appl. Math., 2014)

The complexity of probabilistic lobbying. - Daniel Binkele-Raible; Gábor Erdélyi; Henning Fernau; Judy Goldsmith; Nicholas Mattei; Jörg Rothe (Discret. Optim., 2014)

A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. - Daniel Binkele-Raible; Henning Fernau (Discret. Math. Theor. Comput. Sci., 2014)

A survey on alliances and related parameters in graphs. - Henning Fernau; Juan A. Rodríguez-Velázquez (Electron. J. Graph Theory Appl., 2014)

Scanning Pictures the Boustrophedon Way. - Henning Fernau; Meenakshi Paramasivan; Markus L. Schmid; D. Gnanaraj Thomas (IWCIA, 2015)

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (MCU, 2015)

Pattern Matching with Variables: Fast Algorithms and New Hardness Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (STACS, 2015)

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

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

Contextual array grammars and array P systems. - Henning Fernau; Rudolf Freund; Markus L. Schmid; K. G. Subramanian 001; Petra Wiederhold (Ann. Math. Artif. Intell., 2015)

Algorithmic Aspects of Upper Domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (CoRR, 2015)

Pattern matching with variables: A multivariate complexity analysis. - Henning Fernau; Markus L. Schmid (Inf. Comput., 2015)

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2015)

Computing the metric dimension for chain graphs. - Henning Fernau; Pinar Heggernes; Pim van 't Hof; Daniel Meister 001; Reza Saei (Inf. Process. Lett., 2015)

A multi-parameter analysis of hard problems on deterministic finite automata. - Henning Fernau; Pinar Heggernes; Yngve Villanger (J. Comput. Syst. Sci., 2015)

Combinatorics for smaller kernels: The differential of a graph. - Sergio Bermudo; Henning Fernau (Theor. Comput. Sci., 2015)

On the parameterized complexity of vertex cover and edge cover with connectivity constraints. - Henning Fernau; Fedor V. Fomin; Geevarghese Philip; Saket Saurabh 001 (Theor. Comput. Sci., 2015)

Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. - Henning Fernau; Alejandro López-Ortiz; Jazmín Romero (ACM Trans. Comput. Theory, 2015)

Algorithmic Aspects of Upper Domination: A Parameterised Perspective. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (AAIM, 2016)

On the Complexity Landscape of the Domination Chain. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau (CALDAM, 2016)

Picture Scanning Automata. - Henning Fernau; Meenakshi Paramasivan; D. Gnanaraj Thomas (CompIMAGE, 2016)

Two-Dimensional Input-Revolving Automata. - S. James Immanuel; D. Gnanaraj Thomas; Henning Fernau; Robinson Thamburaj; Atulya K. Nagar (CompIMAGE, 2016)

Contextual Array Grammars with Matrix and Regular Control. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (DCFS, 2016)

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

On the Complexity of Grammar-Based Compression over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (ICALP, 2016)

Building Clusters with Lower-Bounded Sizes. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (ISAAC, 2016)

Upper Domination: Complexity and Approximation. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (IWOCA, 2016)

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

Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue. - Henning Fernau (Algorithms, 2016)

Weak total resolvability in graphs. - Katrin Casel; Alejandro Estrada-Moreno; Henning Fernau; Juan Alberto Rodríguez-Velázquez (Discuss. Math. Graph Theory, 2016)

Polynomial inference of universal automata from membership and equivalence queries. - Johanna Björklund; Henning Fernau; Anna Kasprzik (Inf. Comput., 2016)

An Essay on General Grammars. - Henning Fernau (J. Autom. Lang. Comb., 2016)

Data reductions and combinatorial bounds for improved approximation algorithms. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (J. Comput. Syst. Sci., 2016)

On the Parameterised Complexity of String Morphism Problems. - Henning Fernau; Markus L. Schmid; Yngve Villanger (Theory Comput. Syst., 2016)

Kernelization, Turing Kernels. - Henning Fernau (Encyclopedia of Algorithms, 2016)

Parameterized Algorithms for Drawing Graphs. - Henning Fernau (Encyclopedia of Algorithms, 2016)

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

Extremal Kernelization: A Commemorative Paper. - Henning Fernau (IWOCA, 2017)

Self-verifying pushdown automata. - Henning Fernau; Martin Kutrib; Matthias Wendlandt (NCMA, 2017)

Regular grammars for array languages. - Henning Fernau; Meenakshi Paramasivan; D. Gnanaraj Thomas (NCMA, 2017)

Parikh Images of Matrix Ins-Del Systems. - Henning Fernau; Lakshmanan Kuppusamy (TAMC, 2017)

Universal Matrix Insertion Grammars with Small Size. - Henning Fernau; Lakshmanan Kuppusamy; Sergey Verlan (UCNC, 2017)

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

Problems on Finite Automata and the Exponential Time Hypothesis. - Henning Fernau; Andreas Krebs (Algorithms, 2017)

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (Fundam. Informaticae, 2017)

On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (J. Autom. Lang. Comb., 2017)

Contextual array grammars with matrix control, regular control languages, and tissue P systems control. - Artiom Alhazov; Henning Fernau; Rudolf Freund; Sergiu Ivanov 001; Rani Siromoney; K. G. Subramanian 001 (Theor. Comput. Sci., 2017)

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Theor. Comput. Sci., 2017)

Characterization and complexity results on jumping finite automata. - Henning Fernau; Meenakshi Paramasivan; Markus L. Schmid; Vojtech Vorel (Theor. Comput. Sci., 2017)

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

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (MCU, 2018)

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

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (Algorithmica, 2018)

Special Issue on Reconfiguration Problems. - Faisal N. Abu-Khzam; Henning Fernau; Ryuhei Uehara (Algorithms, 2018)

Extension of vertex cover and independent set in some classes of graphs and generalizations. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CoRR, 2018)

Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421). - Henning Fernau; Petr A. Golovach; Marie-France Sagot (Dagstuhl Reports, 2018)

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

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (RAIRO Theor. Informatics Appl., 2018)

Properties of Language Classes Between Linear and Context-Free. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (J. Autom. Lang. Comb., 2018)

Simple picture processing based on finite automata and regular grammars. - Henning Fernau; Meenakshi Paramasivan; Markus L. Schmid; D. Gnanaraj Thomas (J. Comput. Syst. Sci., 2018)

Investigations on the power of matrix insertion-deletion systems with small sizes. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2018)

The many facets of upper domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (Theor. Comput. Sci., 2018)

Revisiting Shinohara's algorithm for computing descriptive patterns. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (Theor. Comput. Sci., 2018)

Profit Parameterizations of Dominating Set. - Henning Fernau; Ulrike Stege (AAIM, 2019)

Extension of Vertex Cover and Independent Set in Some Classes of Graphs. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2019)

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

Regulated Tree Automata. - Henning Fernau; Martin Vu (DCFS, 2019)

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (FCT, 2019)

Modern Aspects of Complexity Within Formal Languages. - Henning Fernau (LATA, 2019)

Computational Complexity of Synchronization under Regular Constraints. - Henning Fernau; Vladimir V. Gusev; Stefan Hoffmann 001; Markus Holzer 001; Mikhail V. Volkov 001; Petra Wolf 002 (MFCS, 2019)

Synchronizing series-parallel automata with loops. - Jens Bruchertseifer; Henning Fernau (NCMA, 2019)

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

On path-controlled insertion-deletion systems. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Acta Informatica, 2019)

Aspects of upper defensive alliances. - Cristina Bazgan; Henning Fernau; Zsolt Tuza (Discret. Appl. Math., 2019)

Extensions to Minimal Synchronizing Words. - Henning Fernau; Stefan Hoffmann 001 (J. Autom. Lang. Comb., 2019)

Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2019)

Kernels for packing and covering problems. - Jianer Chen; Henning Fernau; Peter Shaw 001; Jianxin Wang 001; Zhibiao Yang (Theor. Comput. Sci., 2019)

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

Insertion-Deletion with Substitutions II. - Martin Vu; Henning Fernau (DCFS, 2020)

Width Notions for Ordering-Related Problems. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2020)

Synchronization of Deterministic Visibly Push-Down Automata. - Henning Fernau; Petra Wolf 002 (FSTTCS, 2020)

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

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

Synchronizing Words and Monoid Factorization: A Parameterized Perspective. - Jens Bruchertseifer; Henning Fernau (TAMC, 2020)

Diminishable parameterized problems and strict polynomial kernelization. - Henning Fernau; Till Fluschnik; Danny Hermelin; Andreas Krebs; Hendrik Molter; Rolf Niedermeier (Comput., 2020)

Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. - Petra Wolf 002; Henning Fernau (CoRR, 2020)

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau (Discret. Appl. Math., 2020)

Complexity of independency and cliquy trees. - Katrin Casel; Jan Dreier; Henning Fernau; Moritz Gobbert; Philipp Kuinke; Fernando Sánchez Villaamil; Markus L. Schmid; Erik Jan van Leeuwen (Discret. Appl. Math., 2020)

Universal insertion grammars of size two. - Sergey Verlan; Henning Fernau; Lakshmanan Kuppusamy (Theor. Comput. Sci., 2020)

Pattern Matching with Variables: Efficient Algorithms and Complexity Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (ACM Trans. Comput. Theory, 2020)

Abundant Extensions. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2021)

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

Parsimonious Computational Completeness. - Henning Fernau (DLT, 2021)

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. - Emmanuel Arrighi; Henning Fernau; Stefan Hoffmann 001; Markus Holzer 001; Ismaël Jecker; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2021)

Diversity in Kemeny Rank Aggregation: A Parameterized Approach. - Emmanuel Arrighi; Henning Fernau; Daniel Lokshtanov; Mateus de Oliveira Oliveira; Petra Wolf 002 (IJCAI, 2021)

Preface to Martin Kutrib Festschrift. - Henning Fernau; Andreas Malcher; Giovanni Pighizzini (Acta Informatica, 2021)

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. - Martin Vu; Henning Fernau (Algorithms, 2021)

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. - Henning Fernau; Stefan Hoffmann 001; Michael Wehar (CoRR, 2021)

The Space Complexity of Sum Labelling. - Henning Fernau; Kshitij Gajjar (Electron. Colloquium Comput. Complex., 2021)

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (Fundam. Informaticae, 2021)

Self-Verifying Pushdown and Queue Automata. - Henning Fernau; Martin Kutrib; Matthias Wendlandt (Fundam. Informaticae, 2021)

Synchronizing series-parallel deterministic finite automata with loops and related problems. - Jens Bruchertseifer; Henning Fernau (RAIRO Theor. Informatics Appl., 2021)

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (Theory Comput. Syst., 2021)

On the generative capacity of matrix insertion-deletion systems of small sum-norm. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Nat. Comput., 2021)

Algorithmic aspects of upper edge domination. - Jérôme Monnot; Henning Fernau; David F. Manlove (Theor. Comput. Sci., 2021)

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. - Bahareh Banyassady; Mark de Berg; Karl Bringmann; Kevin Buchin; Henning Fernau; Dan Halperin; Irina Kostitsyna; Yoshio Okamoto; Stijn Slot (SoCG, 2022)

The Synchronization Game on Subclasses of Automata. - Henning Fernau; Carolina Haase; Stefan Hoffmann 001 (FUN, 2022)

All Paths Lead to Rome. - Kevin Goergen; Henning Fernau; Esther Oest; Petra Wolf 002 (JCDCGGG, 2022)

Properties of graphs specified by a regular language. - Volker Diekert; Henning Fernau; Petra Wolf 002 (Acta Informatica, 2022)

Preface to Klaus-Jörn Lange Festschrift. - Henning Fernau; Markus Holzer 001; Petra Wolf 002 (Acta Informatica, 2022)

Special Issue "Selected Algorithmic Papers From CSR 2020". - Henning Fernau (Algorithms, 2022)

Insertion-deletion systems with substitutions I. - Martin Vu; Henning Fernau (Comput., 2022)

Enumerating Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (CoRR, 2022)

Improved descriptional complexity results on generalized forbidding grammars. - Henning Fernau; Lakshmanan Kuppusamy; Rufus O. Oladele; Indhumathi Raman (Discret. Appl. Math., 2022)

On the computational completeness of matrix simple semi-conditional grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Inf. Comput., 2022)

Synchronizing words and monoid factorization, yielding a new parameterized complexity class? - Henning Fernau; Jens Bruchertseifer (Math. Struct. Comput. Sci., 2022)

On the complexity of solution extension of optimization problems. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Theor. Comput. Sci., 2022)

Synchronization and Diversity of Solutions. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (AAAI, 2023)

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

Sum Labelling Graphs of Maximum Degree Two. - Henning Fernau; Kshitij Gajjar (CoRR, 2023)

Hitting the Romans. - Henning Fernau; Kevin Mann (CoRR, 2023)

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

Perfect Roman Domination and Unique Response Roman Domination. - Henning Fernau; Kevin Mann (CoRR, 2023)

Enumerating Defensive Alliances. - Zhidan Feng 002; Henning Fernau; Kevin Mann (CoRR, 2023)

Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. - Martin Vu; Henning Fernau (J. Autom. Lang. Comb., 2023)

Order Reconfiguration under Width Constraints. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (J. Graph Algorithms Appl., 2023)

Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. - Henning Fernau; Mikhail V. Volkov 001 (Theory Comput. Syst., 2023)

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. - Katrin Casel; Henning Fernau; Alexander Grigoriev; Markus L. Schmid; Sue Whitesides (Discret. Comput. Geom., 2023)

Editorial 2023: changes and invariants. - Henning Fernau (Acta Informatica, 2023)

Extension of some edge graph problems: Standard, parameterized and approximation complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Discret. Appl. Math., 2023)

Synchronizing deterministic push-down automata can be really hard. - Henning Fernau; Petra Wolf 002; Tomoyuki Yamakami (Inf. Comput., 2023)

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

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

Perfect Roman Domination: Aspects of Enumeration and Parameterization. - Kevin Mann; Henning Fernau (IWOCA, 2024)

Roman Hitting Functions. - Henning Fernau; Kevin Mann (IPEC, 2024)

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

Offensive Alliances in Signed Graphs. - Zhidan Feng 002; Henning Fernau; Kevin Mann; Xingqin Qi (TAMC, 2024)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. - Henning Fernau; Carolina Haase; Stefan Hoffmann 001; Mikhail Volkov 001 (NCMA, 2024)

Generalized Word-Representable Graphs. - Zhidan Feng 002; Henning Fernau; Pamela Fleischmann; Kevin Mann; Silas Cato Sacher (CoRR, 2024)

On the computational completeness of generalized forbidding matrix grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman (Theor. Comput. Sci., 2024)

Recognizing well-dominated graphs is coNP-complete. - Akanksha Agrawal 001; Henning Fernau; Philipp Kindermann; Kevin Mann; Uéverton S. Souza (Inf. Process. Lett., 2024)

Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. - Cristina Bazgan; Henning Fernau (Algorithmica, 2024)

Minimal Roman Dominating Functions: Extensions and Enumeration. - Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann (Algorithmica, 2024)

Editorial 2024: moving forwards in the electronic age. - Henning Fernau (Acta Informatica, 2024)

SMART: Self-supervised Model aligning APIs and RDF using Transformers. - Elena Valette; Tobias Zeimetz; Henning Fernau; Ralf Schenkel (BTW, 2025)

Generalized Lettericity of Graphs. - Zhidan Feng 002; Henning Fernau; Kevin Mann; Indhumathi Raman; Silas Cato Sacher (CALDAM, 2025)

Extension Perfect Roman Domination. - Kevin Mann; Henning Fernau (CALDAM, 2025)

Matrix Forbidding Grammars. - Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman; György Vaszil (DCFS, 2025)

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

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

Defensive Alliances in Signed Networks. - Emmanuel Arrighi; Zhidan Feng 002; Henning Fernau; Kevin Mann; Xingqin Qi; Petra Wolf 002 (J. Artif. Intell. Res., 2025)

Enumerating Minimal Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (SIAM J. Discret. Math., 2025)

Parameterizing path partitions. - Henning Fernau; Florent Foucaud; Kevin Mann; Utkarsh Padariya; Rajath Rao K. N (Theor. Comput. Sci., 2025)