| 2026 | DLT | On Languages Describing Large Graph Classes. | Henning Fernau, Pamela Fleischmann, Kevin Mann, Silas Cato Sacher |
| 2026 | WALCOM | How to Reconfigure Your Alliances. | Henning Fernau, Kevin Mann |
| 2025 | BTW | SMART: Self-supervised Model aligning APIs and RDF using Transformers. | Elena Valette, Tobias Zeimetz, Henning Fernau, Ralf Schenkel |
| 2025 | IWCIA | Boustrophedon Pushdown Automata for Two-Dimensional Picture Languages. | Henning Fernau, R. Jennifer Rose, Robinson Thamburaj, D. Gnanaraj Thomas |
| 2025 | SOFSEM | On Computational Completeness of Semi-Conditional Matrix Grammars. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2025 | SOFSEM | Roman Hitting Set. | Kevin Mann, Henning Fernau |
| 2025 | UC | On Time-Varying Insertion-Deletion Systems. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2024 | AAIM | Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. | Zhidan Feng, Henning Fernau, Binhai Zhu |
| 2024 | CiE | Counting Simple Rules in Semi-conditional Grammars is not Simple. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2024 | IWOCA | Perfect Roman Domination: Aspects of Enumeration and Parameterization. | Kevin Mann, Henning Fernau |
| 2024 | MCU | Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2024 | TAMC | Offensive Alliances in Signed Graphs. | Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi |
| 2023 | AAAI | Synchronization and Diversity of Solutions. | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf |
| 2023 | CIAC | Parameterizing Path Partitions. | Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N |
| 2023 | MFCS | Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2022 | ESA | Enumerating Minimal Connected Dominating Sets. | Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann |
| 2022 | FUN | The Synchronization Game on Subclasses of Automata. | Henning Fernau, Carolina Haase, Stefan Hoffmann |
| 2022 | WG | Minimal Roman Dominating Functions: Extensions and Enumeration. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2021 | CIAC | Abundant Extensions. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2021 | CIAC | Invited Talks. | Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor |
| 2021 | DLT | Properties of Graphs Specified by a Regular Language. | Volker Diekert, Henning Fernau, Petra Wolf |
| 2021 | DLT | Parsimonious Computational Completeness. | Henning Fernau |
| 2021 | FCT | The Space Complexity of Sum Labelling. | Henning Fernau, Kshitij Gajjar |
| 2021 | IJCAI | Diversity in Kemeny Rank Aggregation: A Parameterized Approach. | Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf |
| 2021 | MFCS | Order Reconfiguration Under Width Constraints. | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf |
| 2021 | SOFSEM | Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. | Martin Vu, Henning Fernau |
| 2020 | CiE | Insertion-Deletion Systems with Substitutions I. | Martin Vu, Henning Fernau |
| 2020 | MFCS | Synchronizing Deterministic Push-Down Automata Can Be Really Hard. | Henning Fernau, Petra Wolf, Tomoyuki Yamakami |
| 2020 | SOFSEM | Parameterized Dynamic Variants of Red-Blue Dominating Set. | Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau |
| 2020 | TAMC | Synchronizing Words and Monoid Factorization: A Parameterized Perspective. | Jens Bruchertseifer, Henning Fernau |
| 2019 | AAIM | Profit Parameterizations of Dominating Set. | Henning Fernau, Ulrike Stege |
| 2019 | CIAC | Extension of Vertex Cover and Independent Set in Some Classes of Graphs. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | FCT | Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | LATA | Modern Aspects of Complexity Within Formal Languages. | Henning Fernau |
| 2019 | MFCS | Computational Complexity of Synchronization under Regular Constraints. | Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf |
| 2019 | SOFSEM | On Matrix Ins-Del Systems of Small Sum-Norm. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2018 | CiE | Diminishable Parameterized Problems and Strict Polynomial Kernelization. | Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier |
| 2018 | CiE | New Nonterminal Complexity Results for Semi-conditional Grammars. | Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele |
| 2018 | MCU | Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. | Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman |
| 2018 | UC | Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2017 | IWOCA | Extremal Kernelization: A Commemorative Paper. | Henning Fernau |
| 2017 | MFCS | Combinatorial Properties and Recognition of Unit Square Visibility Graphs. | Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides |
| 2017 | TAMC | Parikh Images of Matrix Ins-Del Systems. | Henning Fernau, Lakshmanan Kuppusamy |
| 2017 | UC | Universal Matrix Insertion Grammars with Small Size. | Henning Fernau, Lakshmanan Kuppusamy, Sergey Verlan |
| 2016 | AAIM | 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, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | ICALP | On the Complexity of Grammar-Based Compression over Fixed Alphabets. | Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid |
| 2016 | ISAAC | Building Clusters with Lower-Bounded Sizes. | Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | UC | Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. | Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
| 2015 | IWCIA | Scanning Pictures the Boustrophedon Way. | Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas |
| 2015 | MCU | Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. | Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian |
| 2015 | STACS | Pattern Matching with Variables: Fast Algorithms and New Hardness Results. | Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid |
| 2015 | TAMC | Kernelization Algorithms for Packing Problems Allowing Overlaps. | Henning Fernau, Alejandro Lpez-Ortiz, Jazmn Romero |
| 2014 | CSR | Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results. | Henning Fernau, Juan Alberto Rodrguez-Velzquez |
| 2014 | ISAAC | Approximation Algorithms Inspired by Kernelization Methods. | Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau |
| 2013 | CPM | Pattern Matching with Variables: A Multivariate Complexity Analysis. | Henning Fernau, Markus L. Schmid |
| 2013 | LATA | MAT Learning of Universal Automata. | Johanna Bjrklund, Henning Fernau, Anna Kasprzik |
| 2013 | LATA | A Multivariate Analysis of Some DFA Problems. | Henning Fernau, Pinar Heggernes, Yngve Villanger |
| 2013 | UC | Array Insertion and Deletion P Systems. | Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian |
| 2012 | AAIM | Kernels for Packing and Covering Problems - (Extended Abstract). | Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang |
| 2012 | IWOCA | Saving on Phases: Parameterized Approximation for Total Vertex Cover. | Henning Fernau |
| 2011 | WAOA | Parameterized Approximation Algorithms for Hitting Set. | Ljiljana Brankovic, Henning Fernau |
| 2010 | CIAC | A Parameterized Route to Exact Puzzles: Breaking the 2 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
| 2010 | COCOON | The Curse of Connectivity: | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
| 2010 | CSR | A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. | Daniel Binkele-Raible, Henning Fernau |
| 2010 | ISAAC | Combining Two Worlds: Parameterised Approximation for Vertex Cover. | Ljiljana Brankovic, Henning Fernau |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | LATA | Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. | Christophe Costa Florncio, Henning Fernau |
| 2010 | SOFSEM | An Amortized Search Tree Analysis for | Daniel Raible, Henning Fernau |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2009 | TAMC | Searching Trees: An Essay. | Henning Fernau, Daniel Raible |
| 2009 | WG | Exact and Parameterized Algorithms for Max Internal Spanning Tree. | Henning Fernau, Serge Gaspers, Daniel Raible |
| 2008 | AAIM | Facility Location Problems: A Parameterized View. | Michael R. Fellows, Henning Fernau |
| 2008 | COCOA | A Parameterized Perspective on Packing Paths of Length Two. | Henning Fernau, Daniel Raible |
| 2008 | FAW | Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. | Guoqiang Bai, Henning Fernau |
| 2008 | ISAAC | Power Domination in O | Daniel Raible, Henning Fernau |
| 2008 | MFCS | A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. | Daniel Raible, Henning Fernau |
| 2008 | SOFSEM | Local elimination-strategies in automata for shorter regular expressions. | Stefan Gulan, Henning Fernau |
| 2008 | WALCOM | Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. | Henning Fernau, Daniel Raible |
| 2007 | LATA | Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. | Jrgen Dassow, Henning Fernau |
| 2007 | SOFSEM | Alliances in Graphs: a Complexity-Theoretic Study. | Henning Fernau, Daniel Raible |
| 2006 | CIAC | Parameterized Algorithms for Hitting Set: The Weighted Case. | Henning Fernau |
| 2006 | SOFSEM | NONBLOCKER: Parameterized Algorithmics for minimum dominating set. | Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond |
| 2006 | SOFSEM | ROMAN DOMINATION: A Parameterized Perspective. | Henning Fernau |
| 2005 | ALT | Algorithms for Learning Regular Expressions. | Henning Fernau |
| 2005 | STACS | Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia |
| 2005 | SOFSEM | Two-Layer Planarization: Improving on Parameterized Algorithmics. | Henning Fernau |
| 2004 | MFCS | A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. | Henning Fernau, David W. Juedes |
| 2003 | GD | Fixed Parameter Algorithms for one-sided crossing minimization Revisited. | Vida Dujmovic, Henning Fernau, Michael Kaufmann |
| 2002 | COCOON | On Parameterized Enumeration. | Henning Fernau |
| 2002 | COLT | Learning Tree Languages from Text. | Henning Fernau |
| 2002 | SSPR | Algorithms for Learning Function Distinguishable Regular Languages. | Henning Fernau, Agnes Radl |
| 2002 | WG | Graph Separator Algorithms: A Refined Analysis. | Henning Fernau |
| 2001 | COCOON | Graph Separators: A Parameterized View. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | DLT | Valuated and Valence Grammars: An Algebraic View. | Henning Fernau, Ralf Stiebe |
| 2001 | ICALP | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | KI | Finding Optimal Solutions to Atomix. | Falk Hffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier |
| 2001 | MCU | Nonterminal Complexity of Programmed Grammars. | Henning Fernau |
| 2001 | MFCS | 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 |
| 2001 | SOFSEM | Approximative Learning of Regular Languages. | Henning Fernau |
| 2000 | ALT | Identification of Function Distinguishable Languages. | Henning Fernau |
| 2000 | ICPR | k-gram Extensions of Terminal Distinguishable Languages. | Henning Fernau |
| 1999 | COCOON | Efficient Learning of Some Linear Matrix Languages. | Henning Fernau |
| 1999 | DLT | Decidability of code properties. | Henning Fernau, Klaus Reinhardt, Ludwig Staiger |
| 1999 | MFCS | An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. | Henning Fernau, Rolf Niedermeier |
| 1998 | MCU | The Generative Power of | Henning Fernau, Rudolf Freund, Markus Holzer |
| 1998 | MFCS | IFS and Control Languages. | Henning Fernau, Ludwig Staiger |
| 1998 | SOFSEM | Regulated Grammars with Leftmost Derivation. | Henning Fernau |
| 1998 | SSPR | Character Recognition with | Henning Fernau, Rudolf Freund, Markus Holzer |
| 1997 | DLT | Bounding resources in Cooperating Distributed Grammar Systems. | Henning Fernau, Markus Holzer, Rudolf Freund |
| 1997 | DLT | How Powerful is Unconditional Transfer? - When UT meets AC. | Henning Fernau, Frank Stephan |
| 1997 | MFCS | Regulations by Valences. | Henning Fernau, Ralf Stiebe |
| 1996 | MFCS | On Unconditional Transfer. | Henning Fernau |
| 1996 | SSPR | Bounded Parallelism in Array Grammars Used for Character Recognition. | Henning Fernau, Rudolf Freund |
| 1995 | DLT | Accepting Grammars and Systems: An Overview. | Henning Bordihn, Henning Fernau |
| 1994 | ICALP | Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. | Henning Fernau, Ludwig Staiger |
| 1993 | DLT | Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. | Henning Fernau |