Henning Fernau

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 158

Top Venues

Karlsruhe Institute of Technology, Germany (PHD)

Education History

Karlsruhe Institute of Technology, Germany

PHD

Publications

Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183 (2024)
Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi
Offensive Alliances in Signed Graphs. CoRR (2023)
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS (2023)
Zhidan Feng, Henning Fernau, Kevin Mann
Enumerating Defensive Alliances. CoRR (2023)
Henning Fernau, Kevin Mann
Perfect Roman Domination and Unique Response Roman Domination. CoRR (2023)
Martin Vu, Henning Fernau
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. J. Autom. Lang. Comb. 28 (1-3) (2023)
Henning Fernau, Kshitij Gajjar
The Space Complexity of Sum Labelling. Theory Comput. Syst. 67 (5) (2023)
Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
Synchronization and Diversity of Solutions. AAAI (2023)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
When Stars Control a Grammar's Work. AFL (2023)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69 (4) (2023)
Henning Fernau, Kshitij Gajjar
Sum Labelling Graphs of Maximum Degree Two. CoRR (2023)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340 (2023)
Henning Fernau, Petra Wolf, Tomoyuki Yamakami
Synchronizing deterministic push-down automata can be really hard. Inf. Comput. 295 (Part B) (2023)
Henning Fernau
Editorial 2023: changes and invariants. Acta Informatica 60 (4) (2023)
Henning Fernau, Mikhail V. Volkov
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst. 67 (2) (2023)
Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. 27 (6) (2023)
Henning Fernau, Kevin Mann
Hitting the Romans. CoRR (2023)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
Parameterizing Path Partitions. CIAC (2023)
Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf
Defensive Alliances in Signed Networks. CoRR (2023)
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
Enumerating Connected Dominating Sets. CoRR (2022)
Henning Fernau, Markus Holzer, Petra Wolf
Preface to Klaus-Jörn Lange Festschrift. Acta Informatica 59 (4) (2022)
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. CoRR (2022)
Martin Vu, Henning Fernau
Insertion-deletion systems with substitutions I. Comput. 11 (1) (2022)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904 (2022)
Henning Fernau, Carolina Haase, Stefan Hoffmann
The Synchronization Game on Subclasses of Automata. FUN (2022)
Henning Fernau
Special Issue "Selected Algorithmic Papers From CSR 2020". Algorithms 15 (11) (2022)
Henning Fernau, Jens Bruchertseifer
Synchronizing words and monoid factorization, yielding a new parameterized complexity class? Math. Struct. Comput. Sci. 32 (2) (2022)
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. CoRR (2022)
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Minimal Roman Dominating Functions: Extensions and Enumeration. CoRR (2022)
Kevin Goergen, Henning Fernau, Esther Oest, Petra Wolf
All Paths Lead to Rome. CoRR (2022)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of graphs specified by a regular language. Acta Informatica 59 (4) (2022)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On the computational completeness of matrix simple semi-conditional grammars. Inf. Comput. 284 (2022)
Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR (2022)
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Minimal Roman Dominating Functions: Extensions and Enumeration. WG (2022)
Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG (2022)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
Parameterizing Path Partitions. CoRR (2022)
Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
Enumerating Minimal Connected Dominating Sets. ESA (2022)
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319 (2022)
Henning Fernau, Stefan Hoffmann, Michael Wehar
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR (2021)
Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor
Invited Talks. CIAC (2021)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of Graphs Specified by a Regular Language. DLT (2021)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of Graphs Specified by a Regular Language. CoRR (2021)
Henning Fernau, Andreas Malcher, Giovanni Pighizzini
Preface to Martin Kutrib Festschrift. Acta Informatica 58 (4) (2021)
Jérôme Monnot, Henning Fernau, David F. Manlove
Algorithmic aspects of upper edge domination. Theor. Comput. Sci. 877 (2021)
Henning Fernau, Kshitij Gajjar
The Space Complexity of Sum Labelling. FCT (2021)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Abundant Extensions. CIAC (2021)
Henning Fernau
Parsimonious Computational Completeness. DLT (2021)
Jens Bruchertseifer, Henning Fernau
Synchronizing series-parallel deterministic finite automata with loops and related problems. RAIRO Theor. Informatics Appl. 55 (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS (2021)
Martin Vu, Henning Fernau
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. SOFSEM (2021)
Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI (2021)
Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
Order Reconfiguration Under Width Constraints. MFCS (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR (2021)
Martin Vu, Henning Fernau
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. Algorithms 14 (5) (2021)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On the generative capacity of matrix insertion-deletion systems of small sum-norm. Nat. Comput. 20 (4) (2021)
Henning Fernau, Kshitij Gajjar
The Space Complexity of Sum Labelling. Electron. Colloquium Comput. Complex. 28 (2021)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65 (2) (2021)
Henning Fernau, Kshitij Gajjar
The Space Complexity of Sum Labelling. CoRR (2021)
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundam. Informaticae 181 (2-3) (2021)
Henning Fernau, Martin Kutrib, Matthias Wendlandt
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180 (1-2) (2021)
Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR (2021)
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Complexity of independency and cliquy trees. Discret. Appl. Math. 272 (2020)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280 (2020)
Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
Width Notions for Ordering-Related Problems. FSTTCS (2020)
Martin Vu, Henning Fernau
Insertion-Deletion with Substitutions II. DCFS (2020)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS (2020)
Henning Fernau, Petra Wolf
Synchronization of Deterministic Visibly Push-Down Automata. FSTTCS (2020)
Henning Fernau, Petra Wolf
Synchronization of Deterministic Visibly Push-Down Automata. CoRR (2020)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12 (1) (2020)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. Int. Conf. on Membrane Computing (2020)
Henning Fernau, Petra Wolf, Tomoyuki Yamakami
Synchronizing Deterministic Push-Down Automata Can Be Really Hard. MFCS (2020)
Henning Fernau, Petra Wolf, Tomoyuki Yamakami
Synchronizing Deterministic Push-Down Automata Can Be Really Hard. CoRR (2020)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9 (1) (2020)
Martin Vu, Henning Fernau
Insertion-Deletion Systems with Substitutions I. CiE (2020)
Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau
Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM (2020)
Sergey Verlan, Henning Fernau, Lakshmanan Kuppusamy
Universal insertion grammars of size two. Theor. Comput. Sci. 843 (2020)
Petra Wolf, Henning Fernau
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. CoRR (2020)
Jens Bruchertseifer, Henning Fernau
Synchronizing Words and Monoid Factorization: A Parameterized Perspective. TAMC (2020)
Henning Fernau
Modern Aspects of Complexity Within Formal Languages. LATA (2019)
Henning Fernau, Martin Vu
Regulated Tree Automata. DCFS (2019)
Cristina Bazgan, Henning Fernau, Zsolt Tuza
Aspects of upper defensive alliances. Discret. Appl. Math. 266 (2019)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM (2019)
Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang
Kernels for packing and covering problems. Theor. Comput. Sci. 790 (2019)
Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf
Computational Complexity of Synchronization under Regular Constraints. MFCS (2019)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. 18 (3) (2019)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On path-controlled insertion-deletion systems. Acta Informatica 56 (1) (2019)
Henning Fernau, Stefan Hoffmann
Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. 24 (2-4) (2019)
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT (2019)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC (2019)
Henning Fernau, Ulrike Stege
Profit Parameterizations of Dominating Set. AAIM (2019)
Jens Bruchertseifer, Henning Fernau
Synchronizing series-parallel automata with loops. NCMA (2019)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733 (2018)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. 17 (2) (2018)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Properties of Language Classes Between Linear and Context-Free. J. Autom. Lang. Comb. 23 (4) (2018)
Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas
Simple picture processing based on finite automata and regular grammars. J. Comput. Syst. Sci. 95 (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the Complexity of Solution Extension of Optimization Problems. CoRR (2018)
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. RAIRO Theor. Informatics Appl. 52 (1) (2018)
Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80 (9) (2018)

Henning Fernau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Henning Fernau