Henning Fernau

428 papers A* 7A 5B 42C 55Misc 10Journal 225Unranked 78

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Determining Factorial Speed Fast. CoRR Zhidan Feng, Henning Fernau, Pamela Fleischmann, Philipp Kindermann, Silas Cato Sacher
2026	J	`jnl`	Enumerating minimal defensive alliances. Discret. Appl. Math. Zhidan Feng, Henning Fernau, Kevin Mann
2026	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers WG Henning Fernau, Philipp Kindermann
2026	B	`conf`	How to Reconfigure Your Alliances. WALCOM Henning Fernau, Kevin Mann
2026	J	`jnl`	LL(k) cooperating distributed grammar systems. Theor. Comput. Sci. Henning Bordihn, Henning Fernau, György Vaszil
2026	J	`jnl`	Non-simple rule counting in semi-conditional grammars. Theor. Comput. Sci. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2026	J	`jnl`	Offensive alliances in signed graphs. Theor. Comput. Sci. Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi
2026	J	`jnl`	Space separating special geffert normal form for succinct representation of star-controlled insertion-deletion systems. Acta Informatica Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2026	J	`jnl`	Width notions for ordering-related problems. J. Comput. Syst. Sci. Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
2025	C	`conf`	Boustrophedon Pushdown Automata for Two-Dimensional Picture Languages. IWCIA Henning Fernau, R. Jennifer Rose, Robinson Thamburaj, D. Gnanaraj Thomas
2025	C	`ed.`	Combinatorial Algorithms - 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21-24, 2025, Proceedings IWOCA Henning Fernau, Binhai Zhu
2025	—	`ed.`	Creative Mathematical Sciences Communication: 7th International Conference, CMSC 2024, Trier, Germany, October 7-10, 2024, Proceedings CMSC Henning Fernau, Inge Schwank, Jacqueline Staub
2025	J	`jnl`	Defensive Alliances in Signed Networks. J. Artif. Intell. Res. Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf
2025	J	`jnl`	Editorial 2025: Going Beyond 40. Acta Informatica Henning Fernau
2025	J	`jnl`	Enumerating Minimal Connected Dominating Sets. SIAM J. Discret. Math. Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2025	—	`conf`	Extension Perfect Roman Domination. CALDAM Kevin Mann, Henning Fernau
2025	—	`conf`	Generalized Lettericity of Graphs. CALDAM Zhidan Feng, Henning Fernau, Kevin Mann, Indhumathi Raman, Silas Cato Sacher
2025	J	`jnl`	How to Reconfigure Your Alliances. CoRR Henning Fernau, Kevin Mann
2025	—	`conf`	Matrix Forbidding Grammars. DCFS Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, György Vaszil
2025	—	`conf`	On Computational Completeness of Semi-Conditional Matrix Grammars. SOFSEM (1) Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2025	—	`conf`	On Time-Varying Insertion-Deletion Systems. UCNC Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2025	J	`jnl`	On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars. Comput. Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele
2025	J	`jnl`	Parameterizing path partitions. Theor. Comput. Sci. Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2025	—	`conf`	Roman Hitting Set. SOFSEM (2) Kevin Mann, Henning Fernau
2025	Misc	`conf`	SMART: Self-supervised Model aligning APIs and RDF using Transformers. BTW Elena Valette, Tobias Zeimetz, Henning Fernau, Ralf Schenkel
2025	J	`jnl`	Uniform winning strategies for the synchronization games on subclasses of finite automata. CoRR Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail V. Volkov
2024	C	`conf`	Counting Simple Rules in Semi-conditional Grammars is not Simple. CiE Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2024	J	`jnl`	Editorial 2024: moving forwards in the electronic age. Acta Informatica Henning Fernau
2024	J	`jnl`	Generalized Word-Representable Graphs. CoRR Zhidan Feng, Henning Fernau, Pamela Fleischmann, Kevin Mann, Silas Cato Sacher
2024	J	`jnl`	Minimal Roman Dominating Functions: Extensions and Enumeration. Algorithmica Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
2024	C	`conf`	Offensive Alliances in Signed Graphs. TAMC Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi
2024	J	`jnl`	On Computational Completeness of Semi-Conditional Matrix Grammars. CoRR Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2024	J	`jnl`	On the computational completeness of generalized forbidding matrix grammars. Theor. Comput. Sci. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2024	—	`conf`	Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. AAIM (1) Zhidan Feng, Henning Fernau, Binhai Zhu
2024	J	`jnl`	Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. CoRR Zhidan Feng, Henning Fernau, Binhai Zhu
2024	C	`conf`	Perfect Roman Domination: Aspects of Enumeration and Parameterization. IWOCA Kevin Mann, Henning Fernau
2024	J	`jnl`	Perfect Roman Domination: Aspects of Enumeration and Parameterization. Algorithms Kevin Mann, Henning Fernau
2024	J	`jnl`	Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Algorithmica Cristina Bazgan, Henning Fernau
2024	J	`jnl`	Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2024	B	`conf`	Roman Hitting Functions. IPEC Henning Fernau, Kevin Mann
2024	B	`ed.`	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 SOFSEM Henning Fernau, Serge Gaspers, Ralf Klasing
2024	C	`conf`	Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms. MCU Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2024	—	`conf`	Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. NCMA Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov
2023	J	`jnl`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2023	J	`jnl`	Defensive Alliances in Signed Networks. CoRR Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf
2023	J	`jnl`	Editorial 2023: changes and invariants. Acta Informatica Henning Fernau
2023	J	`jnl`	Enumerating Defensive Alliances. CoRR Zhidan Feng, Henning Fernau, Kevin Mann
2023	J	`jnl`	Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2023	B	`ed.`	Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings FCT Henning Fernau, Klaus Jansen
2023	J	`jnl`	Hitting the Romans. CoRR Henning Fernau, Kevin Mann
2023	J	`jnl`	Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. J. Autom. Lang. Comb. Martin Vu, Henning Fernau
2023	J	`jnl`	Offensive Alliances in Signed Graphs. CoRR Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi
2023	J	`jnl`	Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
2023	C	`conf`	Parameterizing Path Partitions. CIAC Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2023	J	`jnl`	Perfect Roman Domination and Unique Response Roman Domination. CoRR Henning Fernau, Kevin Mann
2023	J	`jnl`	Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst. Henning Fernau, Mikhail V. Volkov
2023	B	`conf`	Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
2023	J	`jnl`	Sum Labelling Graphs of Maximum Degree Two. CoRR Henning Fernau, Kshitij Gajjar
2023	A*	`conf`	Synchronization and Diversity of Solutions. AAAI Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
2023	J	`jnl`	Synchronizing deterministic push-down automata can be really hard. Inf. Comput. Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2023	J	`jnl`	The Space Complexity of Sum Labelling. Theory Comput. Syst. Henning Fernau, Kshitij Gajjar
2023	—	`conf`	When Stars Control a Grammar's Work. AFL Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2022	—	`conf`	All Paths Lead to Rome. JCDCGGG Kevin Goergen, Henning Fernau, Esther Oest, Petra Wolf
2022	J	`jnl`	All Paths Lead to Rome. CoRR Kevin Goergen, Henning Fernau, Esther Oest, Petra Wolf
2022	C	`ed.`	Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings IWOCA Cristina Bazgan, Henning Fernau
2022	J	`jnl`	Enumerating Connected Dominating Sets. CoRR Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2022	A	`conf`	Enumerating Minimal Connected Dominating Sets. ESA Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann
2022	J	`jnl`	Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
2022	J	`jnl`	Insertion-deletion systems with substitutions I. Comput. Martin Vu, Henning Fernau
2022	B	`conf`	Minimal Roman Dominating Functions: Extensions and Enumeration. WG Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
2022	J	`jnl`	Minimal Roman Dominating Functions: Extensions and Enumeration. CoRR Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
2022	J	`jnl`	On the complexity of solution extension of optimization problems. Theor. Comput. Sci. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2022	J	`jnl`	On the computational completeness of matrix simple semi-conditional grammars. Inf. Comput. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2022	J	`jnl`	Parameterizing Path Partitions. CoRR Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2022	J	`jnl`	Preface to Klaus-Jörn Lange Festschrift. Acta Informatica Henning Fernau, Markus Holzer, Petra Wolf
2022	J	`jnl`	Properties of graphs specified by a regular language. Acta Informatica Volker Diekert, Henning Fernau, Petra Wolf
2022	J	`jnl`	Recognizing well-dominated graphs is coNP-complete. CoRR Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2022	J	`jnl`	Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. CoRR Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
2022	J	`jnl`	Special Issue "Selected Algorithmic Papers From CSR 2020". Algorithms Henning Fernau
2022	J	`jnl`	Synchronizing words and monoid factorization, yielding a new parameterized complexity class? Math. Struct. Comput. Sci. Henning Fernau, Jens Bruchertseifer
2022	Misc	`conf`	The Synchronization Game on Subclasses of Automata. FUN Henning Fernau, Carolina Haase, Stefan Hoffmann
2022	A*	`conf`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2022	J	`jnl`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2021	C	`conf`	Abundant Extensions. CIAC Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021	B	`conf`	Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. SOFSEM Martin Vu, Henning Fernau
2021	J	`jnl`	Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. Algorithms Martin Vu, Henning Fernau
2021	J	`jnl`	Algorithmic aspects of upper edge domination. Theor. Comput. Sci. Jérôme Monnot, Henning Fernau, David F. Manlove
2021	A*	`conf`	Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
2021	J	`jnl`	Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
2021	J	`jnl`	Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR Henning Fernau, Stefan Hoffmann, Michael Wehar
2021	J	`jnl`	Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundam. Informaticae Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
2021	C	`conf`	Invited Talks. CIAC Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor
2021	—	`conf`	On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
2021	J	`jnl`	On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
2021	J	`jnl`	On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
2021	J	`jnl`	On the generative capacity of matrix insertion-deletion systems of small sum-norm. Nat. Comput. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2021	B	`conf`	Order Reconfiguration Under Width Constraints. MFCS Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
2021	C	`conf`	Parsimonious Computational Completeness. DLT Henning Fernau
2021	J	`jnl`	Preface to Martin Kutrib Festschrift. Acta Informatica Henning Fernau, Andreas Malcher, Giovanni Pighizzini
2021	C	`conf`	Properties of Graphs Specified by a Regular Language. DLT Volker Diekert, Henning Fernau, Petra Wolf
2021	J	`jnl`	Properties of Graphs Specified by a Regular Language. CoRR Volker Diekert, Henning Fernau, Petra Wolf
2021	J	`jnl`	Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae Henning Fernau, Martin Kutrib, Matthias Wendlandt
2021	J	`jnl`	Synchronizing series-parallel deterministic finite automata with loops and related problems. RAIRO Theor. Informatics Appl. Jens Bruchertseifer, Henning Fernau
2021	B	`conf`	The Space Complexity of Sum Labelling. FCT Henning Fernau, Kshitij Gajjar
2021	J	`jnl`	The Space Complexity of Sum Labelling. CoRR Henning Fernau, Kshitij Gajjar
2021	J	`jnl`	The Space Complexity of Sum Labelling. Electron. Colloquium Comput. Complex. Henning Fernau, Kshitij Gajjar
2020	J	`jnl`	Complexity of independency and cliquy trees. Discret. Appl. Math. Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
2020	Misc	`ed.`	Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings CSR Henning Fernau
2020	J	`jnl`	Diminishable parameterized problems and strict polynomial kernelization. Comput. Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
2020	—	`conf`	Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. Int. Conf. on Membrane Computing Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2020	C	`conf`	Insertion-Deletion Systems with Substitutions I. CiE Martin Vu, Henning Fernau
2020	—	`conf`	Insertion-Deletion with Substitutions II. DCFS Martin Vu, Henning Fernau
2020	—	`conf`	On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2020	B	`conf`	Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau
2020	J	`jnl`	Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
2020	J	`jnl`	Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. CoRR Petra Wolf, Henning Fernau
2020	—	`conf`	Synchronization of Deterministic Visibly Push-Down Automata. FSTTCS Henning Fernau, Petra Wolf
2020	J	`jnl`	Synchronization of Deterministic Visibly Push-Down Automata. CoRR Henning Fernau, Petra Wolf
2020	B	`conf`	Synchronizing Deterministic Push-Down Automata Can Be Really Hard. MFCS Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2020	J	`jnl`	Synchronizing Deterministic Push-Down Automata Can Be Really Hard. CoRR Henning Fernau, Petra Wolf, Tomoyuki Yamakami
2020	C	`conf`	Synchronizing Words and Monoid Factorization: A Parameterized Perspective. TAMC Jens Bruchertseifer, Henning Fernau
2020	J	`jnl`	Universal insertion grammars of size two. Theor. Comput. Sci. Sergey Verlan, Henning Fernau, Lakshmanan Kuppusamy
2020	—	`conf`	Width Notions for Ordering-Related Problems. FSTTCS Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf
2019	J	`jnl`	Aspects of upper defensive alliances. Discret. Appl. Math. Cristina Bazgan, Henning Fernau, Zsolt Tuza
2019	B	`conf`	Computational Complexity of Synchronization under Regular Constraints. MFCS Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf
2019	J	`jnl`	Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2019	—	`conf`	Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2019	B	`conf`	Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	C	`conf`	Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	J	`jnl`	Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. Henning Fernau, Stefan Hoffmann
2019	—	`conf`	Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
2019	J	`jnl`	Kernels for packing and covering problems. Theor. Comput. Sci. Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang
2019	C	`conf`	Modern Aspects of Complexity Within Formal Languages. LATA Henning Fernau
2019	B	`conf`	On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2019	J	`jnl`	On path-controlled insertion-deletion systems. Acta Informatica Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2019	C	`conf`	Profit Parameterizations of Dominating Set. AAIM Henning Fernau, Ulrike Stege
2019	—	`conf`	Regulated Tree Automata. DCFS Henning Fernau, Martin Vu
2019	—	`conf`	Synchronizing series-parallel automata with loops. NCMA Jens Bruchertseifer, Henning Fernau
2018	J	`jnl`	Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421). Dagstuhl Reports Henning Fernau, Petr A. Golovach, Marie-France Sagot
2018	J	`jnl`	Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
2018	—	`conf`	Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. UCNC Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2018	C	`conf`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2018	J	`jnl`	Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018	J	`jnl`	Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2018	C	`conf`	Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. MCU Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman
2018	C	`conf`	New Nonterminal Complexity Results for Semi-conditional Grammars. CiE Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele
2018	J	`jnl`	On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. RAIRO Theor. Informatics Appl. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2018	J	`jnl`	On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results. Discret. Appl. Math. Henning Fernau, Juan A. Rodríguez-Velázquez
2018	J	`jnl`	On the Complexity of Solution Extension of Optimization Problems. CoRR Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018	J	`jnl`	Properties of Language Classes Between Linear and Context-Free. J. Autom. Lang. Comb. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2018	J	`jnl`	Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
2018	J	`jnl`	Simple picture processing based on finite automata and regular grammars. J. Comput. Syst. Sci. Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas
2018	J	`jnl`	Special Issue on Reconfiguration Problems. Algorithms Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara
2018	J	`jnl`	The many facets of upper domination. Theor. Comput. Sci. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2017	J	`jnl`	Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
2017	B	`conf`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2017	J	`jnl`	Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
2017	C	`conf`	Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. CIAA Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2017	J	`jnl`	Contextual array grammars with matrix control, regular control languages, and tissue P systems control. Theor. Comput. Sci. Artiom Alhazov, Henning Fernau, Rudolf Freund, Sergiu Ivanov, Rani Siromoney, K. G. Subramanian
2017	C	`conf`	Extremal Kernelization: A Commemorative Paper. IWOCA Henning Fernau
2017	—	`conf`	Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. DCFS Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2017	J	`jnl`	Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. Fundam. Informaticae Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian
2017	J	`jnl`	On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. J. Autom. Lang. Comb. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2017	J	`jnl`	On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Theor. Comput. Sci. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2017	C	`conf`	Parikh Images of Matrix Ins-Del Systems. TAMC Henning Fernau, Lakshmanan Kuppusamy
2017	J	`jnl`	Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms Henning Fernau, Andreas Krebs
2017	—	`conf`	Regular grammars for array languages. NCMA Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas
2017	—	`conf`	Self-verifying pushdown automata. NCMA Henning Fernau, Martin Kutrib, Matthias Wendlandt
2017	J	`jnl`	Two-Dimensional Pattern Languages. CoRR Henning Fernau, Markus L. Schmid, K. G. Subramanian
2017	—	`conf`	Universal Matrix Insertion Grammars with Small Size. UCNC Henning Fernau, Lakshmanan Kuppusamy, Sergey Verlan
2016	C	`conf`	Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	J	`jnl`	An Essay on General Grammars. J. Autom. Lang. Comb. Henning Fernau
2016	B	`conf`	Building Clusters with Lower-Bounded Sizes. ISAAC Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
2016	—	`conf`	Contextual Array Grammars with Matrix and Regular Control. DCFS Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian
2016	J	`jnl`	Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
2016	—	`conf`	Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. DCFS Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2016	J	`jnl`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2016	—	`conf`	Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. UCNC Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
2016	—	`ch.`	Kernelization, Turing Kernels. Encyclopedia of Algorithms Henning Fernau
2016	—	`conf`	On the Complexity Landscape of the Domination Chain. CALDAM Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
2016	A*	`conf`	On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
2016	J	`jnl`	On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. Henning Fernau, Markus L. Schmid, Yngve Villanger
2016	—	`ch.`	Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms Henning Fernau
2016	—	`conf`	Picture Scanning Automata. CompIMAGE Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas
2016	J	`jnl`	Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. Johanna Björklund, Henning Fernau, Anna Kasprzik
2016	C	`conf`	Problems on Finite Automata and the Exponential Time Hypothesis. CIAA Henning Fernau, Andreas Krebs
2016	J	`jnl`	Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue. Algorithms Henning Fernau
2016	—	`conf`	Two-Dimensional Input-Revolving Automata. CompIMAGE S. James Immanuel, D. Gnanaraj Thomas, Henning Fernau, Robinson Thamburaj, Atulya K. Nagar
2016	C	`conf`	Upper Domination: Complexity and Approximation. IWOCA Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	J	`jnl`	Weak total resolvability in graphs. Discuss. Math. Graph Theory Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez
2015	J	`jnl`	A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. Henning Fernau, Pinar Heggernes, Yngve Villanger
2015	J	`jnl`	Algorithmic Aspects of Upper Domination. CoRR Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	J	`jnl`	Characterization and Complexity Results on Jumping Finite Automata. CoRR Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel
2015	J	`jnl`	Combinatorics for smaller kernels: The differential of a graph. Theor. Comput. Sci. Sergio Bermudo, Henning Fernau
2015	J	`jnl`	Computing the metric dimension for chain graphs. Inf. Process. Lett. Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
2015	J	`jnl`	Contextual array grammars and array P systems. Ann. Math. Artif. Intell. Henning Fernau, Rudolf Freund, Markus L. Schmid, K. G. Subramanian, Petra Wiederhold
2015	C	`conf`	Jumping Finite Automata: Characterizations and Complexity. CIAA Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid
2015	C	`conf`	Kernelization Algorithms for Packing Problems Allowing Overlaps. TAMC Henning Fernau, Alejandro López-Ortiz, Jazmín Romero
2015	C	`conf`	Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. MCU Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian
2015	J	`jnl`	On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2015	A	`conf`	Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
2015	J	`jnl`	Pattern matching with variables: A multivariate complexity analysis. Inf. Comput. Henning Fernau, Markus L. Schmid
2015	C	`conf`	Scanning Pictures the Boustrophedon Way. IWCIA Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas
2015	J	`jnl`	The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. Int. J. Found. Comput. Sci. Henning Fernau, Rudolf Freund, Markus Holzer
2015	J	`jnl`	Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. ACM Trans. Comput. Theory Henning Fernau, Alejandro López-Ortiz, Jazmín Romero
2014	J	`jnl`	A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. Discret. Math. Theor. Comput. Sci. Daniel Binkele-Raible, Henning Fernau
2014	J	`jnl`	A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. Henning Fernau, Juan A. Rodríguez-Velázquez
2014	B	`conf`	Approximation Algorithms Inspired by Kernelization Methods. ISAAC Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
2014	J	`jnl`	Computing the differential of a graph: Hardness, approximability and exact algorithms. Discret. Appl. Math. Sergio Bermudo, Henning Fernau
2014	—	`conf`	Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. AFL Henning Fernau, Rudolf Freund, Markus Holzer
2014	J	`jnl`	Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
2014	J	`jnl`	Digraphs of bounded elimination width. Discret. Appl. Math. Henning Fernau, Daniel Meister
2014	J	`jnl`	Kernelization Algorithms for Packing Problems Allowing Overlaps. CoRR Henning Fernau, Alejandro López-Ortiz, Jazmín Romero
2014	—	`conf`	Latrunculi - on the complexity of Roman chess. NCMA Moritz Gobbert, Henning Fernau
2014	Misc	`conf`	Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results. CSR Henning Fernau, Juan Alberto Rodríguez-Velázquez
2014	J	`jnl`	The complexity of probabilistic lobbying. Discret. Optim. Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe
2013	C	`conf`	A Multivariate Analysis of Some DFA Problems. LATA Henning Fernau, Pinar Heggernes, Yngve Villanger
2013	J	`jnl`	A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. Ljiljana Brankovic, Henning Fernau
2013	—	`conf`	Array Insertion and Deletion P Systems. UCNC Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian
2013	J	`jnl`	Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2013	C	`conf`	MAT Learning of Universal Automata. LATA Johanna Björklund, Henning Fernau, Anna Kasprzik
2013	—	`conf`	On the Parameterised Complexity of String Morphism Problems. FSTTCS Henning Fernau, Markus L. Schmid, Yngve Villanger
2013	J	`jnl`	Packing paths: Recycling saves time. Discret. Appl. Math. Daniel Binkele-Raible, Henning Fernau
2013	B	`conf`	Pattern Matching with Variables: A Multivariate Complexity Analysis. CPM Henning Fernau, Markus L. Schmid
2013	—	`conf`	Two-dimensional pattern languages. NCMA Henning Fernau, Markus L. Schmid, K. G. Subramanian
2012	J	`jnl`	An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica Daniel Binkele-Raible, Henning Fernau
2012	J	`jnl`	An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. J. Discrete Algorithms Daniel Binkele-Raible, Henning Fernau
2012	J	`jnl`	Constraint bipartite vertex cover: simpler exact algorithms and implementations. J. Comb. Optim. Guoqiang Bai, Henning Fernau
2012	—	`conf`	Cooperating Distributed Tree Automata. Languages Alive Henning Fernau
2012	J	`jnl`	From the Guest Editors. J. Comput. Syst. Sci. Henning Fernau, Carlos Martín-Vide
2012	J	`jnl`	Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2012	—	`conf`	Kernels for Packing and Covering Problems - (Extended Abstract). FAW-AAIM Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang
2012	J	`jnl`	Lower bounds on the differential of a graph. Discret. Math. Sergio Bermudo, Henning Fernau
2012	J	`jnl`	On families of categorial grammars of bounded value, their learnability and related complexity questions. Theor. Comput. Sci. Christophe Costa Florêncio, Henning Fernau
2012	J	`jnl`	Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica Daniel Binkele-Raible, Henning Fernau
2012	C	`conf`	Saving on Phases: Parameterized Approximation for Total Vertex Cover. IWOCA Henning Fernau
2011	J	`jnl`	An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2011	J	`jnl`	Breaking the 2 J. Discrete Algorithms Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discret. Optim. Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege
2011	C	`conf`	Computing the differential of a graph. CTW Sergio Bermudo, Henning Fernau
2011	J	`jnl`	Facility location problems: A parameterized view. Discret. Appl. Math. Michael R. Fellows, Henning Fernau
2011	—	`conf`	On the Expressive Power of Valences in Cooperating Distributed Grammar Systems. Computation, Cooperation, and Life Henning Fernau, Ralf Stiebe
2011	B	`conf`	Parameterized Approximation Algorithms for Hitting Set. WAOA Ljiljana Brankovic, Henning Fernau
2010	Misc	`conf`	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CSR Daniel Binkele-Raible, Henning Fernau
2010	—	`conf`	A Fixed-Parameter Algorithm for String-to-String Correction. CATS Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege
2010	C	`conf`	A Parameterized Route to Exact Puzzles: Breaking the 2 CIAC Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
2010	J	`jnl`	A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Algorithmica Henning Fernau
2010	J	`jnl`	A new upper bound for Max-2-SAT: A graph-theoretic approach. J. Discrete Algorithms Daniel Binkele-Raible, Henning Fernau
2010	B	`conf`	An Amortized Search Tree Analysis for SOFSEM Daniel Raible, Henning Fernau
2010	—	`conf`	Combining Two Worlds: Parameterised Approximation for Vertex Cover. ISAAC (1) Ljiljana Brankovic, Henning Fernau
2010	J	`jnl`	Comparing trees via crossing minimization. J. Comput. Syst. Sci. Henning Fernau, Michael Kaufmann, Mathias Poths
2010	B	`conf`	Enumerate and Measure: Improving Parameter Budget Management. IPEC Daniel Binkele-Raible, Henning Fernau
2010	J	`jnl`	Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2010	C	`conf`	Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA Christophe Costa Florêncio, Henning Fernau
2010	—	`conf`	Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. ICGI Christophe Costa Florêncio, Henning Fernau
2010	C	`ed.`	Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings LATA Adrian-Horia Dediu, Henning Fernau, Carlos Martín-Vide
2010	J	`jnl`	Parameterized algorithmics for Int. J. Comput. Math. Henning Fernau
2010	J	`jnl`	Parameterized algorithms for d-Hitting Set: The weighted case. Theor. Comput. Sci. Henning Fernau
2010	C	`conf`	Ranking and Drawing in Subexponential Time. IWOCA Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
2010	Misc	`conf`	The Curse of Connectivity: COCOON Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2010	J	`jnl`	minimum dominating set of queens: A trivial programming exercise? Discret. Appl. Math. Henning Fernau
2009	J	`jnl`	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem CoRR Daniel Raible, Henning Fernau
2009	J	`jnl`	A parameterized perspective on packing paths of length two. J. Comb. Optim. Henning Fernau, Daniel Raible
2009	J	`jnl`	Algorithms for learning regular expressions from positive data. Inf. Comput. Henning Fernau
2009	—	`conf`	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	J	`jnl`	Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	C	`conf`	Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009	B	`conf`	Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG Henning Fernau, Serge Gaspers, Daniel Raible
2009	A	`conf`	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2009	J	`jnl`	Offensive r-alliances in graphs. Discret. Appl. Math. Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta
2009	J	`jnl`	On the complement graph and defensive k-alliances. Discret. Appl. Math. José María Sigarreta, Sergio Bermudo, Henning Fernau
2009	C	`conf`	Packing Paths: Recycling Saves Time. CTW Henning Fernau, Daniel Raible
2009	C	`conf`	Searching Trees: An Essay. TAMC Henning Fernau, Daniel Raible
2009	J	`jnl`	The Complexity of Probabilistic Lobbying CoRR Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	—	`conf`	The Complexity of Probabilistic Lobbying. ADT Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	J	`jnl`	Vertex and edge covers with clustering properties: Complexity and algorithms. J. Discrete Algorithms Henning Fernau, David F. Manlove
2008	B	`conf`	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS Daniel Raible, Henning Fernau
2008	J	`jnl`	A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach CoRR Daniel Raible, Henning Fernau
2008	J	`jnl`	A Parameterized Perspective on P CoRR Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang
2008	C	`conf`	A Parameterized Perspective on Packing Paths of Length Two. COCOA Henning Fernau, Daniel Raible
2008	J	`jnl`	A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston
2008	J	`jnl`	A sum labelling for the generalised friendship graph. Discret. Math. Henning Fernau, Joseph F. Ryan, Kiki A. Sugeng
2008	—	`conf`	An Optimal Construction of Finite Automata from Regular Expressions. FSTTCS Stefan Gulan, Henning Fernau
2008	J	`jnl`	Blind Counter Automata on omega-Words. Fundam. Informaticae Henning Fernau, Ralf Stiebe
2008	J	`jnl`	Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Inf. Comput. Jürgen Dassow, Henning Fernau
2008	Misc	`conf`	Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. FAW Guoqiang Bai, Henning Fernau
2008	B	`conf`	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM Henning Fernau, Daniel Raible
2008	J	`jnl`	Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov
2008	C	`conf`	Facility Location Problems: A Parameterized View. AAIM Michael R. Fellows, Henning Fernau
2008	J	`jnl`	Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms Vida Dujmovic, Henning Fernau, Michael Kaufmann
2008	C	`conf`	Global CTW Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta
2008	J	`jnl`	Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2008	C	`ed.`	Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers LATA Carlos Martín-Vide, Friedrich Otto, Henning Fernau
2008	—	`conf`	Local elimination-strategies in automata for shorter regular expressions. SOFSEM (2) Stefan Gulan, Henning Fernau
2008	—	`ch.`	Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms Henning Fernau
2008	J	`jnl`	Parameterized algorithmics for linear arrangement problems. Discret. Appl. Math. Henning Fernau
2008	B	`conf`	Power Domination in O ISAAC Daniel Raible, Henning Fernau
2008	J	`jnl`	ROMAN DOMINATION: a parameterized perspective. Int. J. Comput. Math. Henning Fernau
2007	—	`conf`	Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) Henning Fernau, Daniel Raible
2007	C	`conf`	Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. LATA Jürgen Dassow, Henning Fernau
2007	J	`jnl`	Decidability of code properties. RAIRO Theor. Informatics Appl. Henning Fernau, Klaus Reinhardt, Ludwig Staiger
2007	C	`conf`	Dynamic programming for queen domination. CTW Henning Fernau
2007	—	`conf`	Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Daniel Raible, Henning Fernau
2007	J	`jnl`	Learning tree languages from text. RAIRO Theor. Informatics Appl. Henning Fernau
2007	J	`jnl`	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2007	J	`jnl`	Programmed Grammars with Rule Queues. Int. J. Found. Comput. Sci. Henning Fernau
2007	J	`jnl`	Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. J. Autom. Lang. Comb. Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt
2007	J	`jnl`	The Degree of Parallelism. J. Autom. Lang. Comb. Henning Bordihn, Henning Fernau
2006	J	`jnl`	Iterated sequential transducers as language generating devices. Theor. Comput. Sci. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
2006	—	`conf`	Kernels: Annotated, Proper and Induced. IWPEC Faisal N. Abu-Khzam, Henning Fernau
2006	B	`conf`	NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond
2006	J	`jnl`	Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electron. Notes Discret. Math. Faisal N. Abu-Khzam, Henning Fernau
2006	C	`conf`	Parameterized Algorithms for Hitting Set: The Weighted Case. CIAC Henning Fernau
2006	J	`jnl`	Parameterized Algorithms for Hitting Set: the Weighted Case. Electron. Colloquium Comput. Complex. Henning Fernau
2006	B	`conf`	ROMAN DOMINATION: A Parameterized Perspective. SOFSEM Henning Fernau
2006	J	`jnl`	Speeding up Exact Algorithms With High Probability. Electron. Notes Discret. Math. Henning Fernau
2006	—	`conf`	Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. ACiD Henning Fernau, David F. Manlove
2006	—	`conf`	edge dominating set: Efficient Enumeration-Based Exact Algorithms. IWPEC Henning Fernau
2005	J	`jnl`	A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2005	B	`conf`	Algorithms for Learning Regular Expressions. ALT Henning Fernau
2005	—	`conf`	Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston
2005	—	`conf`	Comparing Trees Via Crossing Minimization. FSTTCS Henning Fernau, Michael Kaufmann, Mathias Poths
2005	A	`conf`	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2005	—	`conf`	Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt
2005	J	`jnl`	Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Informaticae Henning Fernau, Rudolf Freund, Markus Holzer
2005	—	`conf`	The degree of parallelism. DCFS Henning Bordihn, Henning Fernau
2005	B	`conf`	Two-Layer Planarization: Improving on Parameterized Algorithmics. SOFSEM Henning Fernau
2005	J	`jnl`	Two-Layer Planarization: Improving on Parameterized Algorithmics. J. Graph Algorithms Appl. Henning Fernau
2004	B	`conf`	A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS Henning Fernau, David W. Juedes
2004	J	`jnl`	A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set Electron. Colloquium Comput. Complex. Henning Fernau
2004	J	`jnl`	Complexity of a {0, 1}-matrix problem. Australas. J Comb. Henning Fernau
2004	—	`conf`	Extracting Minimum Length Document Type Definitions Is NP-Hard. ICGI Henning Fernau
2004	J	`jnl`	Grammar Induction: An Invitation to Formal Language Theorists. Grammars Henning Fernau, Colin de la Higuera
2004	J	`jnl`	Identifying Terminal Distinguishable Languages. Ann. Math. Artif. Intell. Henning Fernau
2004	J	`jnl`	Introduction to the Special Issue on Grammar Induction. Grammars Pieter W. Adriaans, Henning Fernau, Colin de la Higuera, Menno van Zaanen
2004	J	`jnl`	Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms Jochen Alber, Henning Fernau, Rolf Niedermeier
2004	J	`jnl`	Parametric Duality: Kernel Sizes and Algorithmics Electron. Colloquium Comput. Complex. Henning Fernau
2004	—	`conf`	The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. ICGI Bradford Starkie, Henning Fernau
2004	J	`jnl`	Two-Layer Planarization: Improving on Parameterized Algorithmics Electron. Colloquium Comput. Complex. Henning Fernau
2003	J	`jnl`	A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. Henning Fernau, Alexander Meduna
2003	J	`jnl`	Education(al) matters: teaching P versus NP. Bull. EATCS Henning Fernau
2003	A	`conf`	Fixed Parameter Algorithms for one-sided crossing minimization Revisited. GD Vida Dujmovic, Henning Fernau, Michael Kaufmann
2003	J	`jnl`	Graph separators: a parameterized view. J. Comput. Syst. Sci. Jochen Alber, Henning Fernau, Rolf Niedermeier
2003	J	`jnl`	Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. Henning Fernau, Markus Holzer, Rudolf Freund
2003	J	`jnl`	Identification of function distinguishable languages. Theor. Comput. Sci. Henning Fernau
2003	J	`jnl`	Nonterminal complexity of programmed grammars. Theor. Comput. Sci. Henning Fernau
2003	—	`conf`	On Iterated Sequential Transducers. Grammars and Automata for String Processing Henning Bordihn, Henning Fernau, Markus Holzer
2003	J	`jnl`	On the degree of scattered context-sensitivity. Theor. Comput. Sci. Henning Fernau, Alexander Meduna
2003	—	`conf`	On the parameterized complexity of the generalized rush hour puzzle. CCCG Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
2003	J	`jnl`	Parallel Grammars: A Phenomenology. Grammars Henning Fernau
2002	—	`conf`	Algorithms for Learning Function Distinguishable Regular Languages. SSPR/SPR Henning Fernau, Agnes Radl
2002	J	`jnl`	Even linear simple matrix languages: formal language properties and grammatical inference. Theor. Comput. Sci. Henning Fernau
2002	J	`jnl`	Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
2002	—	`conf`	Fragmentation: Enhancing Identifiability. ICGI Henning Fernau
2002	—	`ed.`	Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings ICGI Pieter W. Adriaans, Henning Fernau, Menno van Zaanen
2002	B	`conf`	Graph Separator Algorithms: A Refined Analysis. WG Henning Fernau
2002	J	`jnl`	Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. J. Autom. Lang. Comb. Henning Fernau, Markus Holzer
2002	A*	`conf`	Learning Tree Languages from Text. COLT Henning Fernau
2002	Misc	`conf`	On Parameterized Enumeration. COCOON Henning Fernau
2002	J	`jnl`	Sequential grammars and automata with valences. Theor. Comput. Sci. Henning Fernau, Ralf Stiebe
2001	J	`jnl`	An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms Henning Fernau, Rolf Niedermeier
2001	B	`conf`	Approximative Learning of Regular Languages. SOFSEM Henning Fernau
2001	—	`conf`	Even Linear Simple Matrix Languages: Formal Language Aspects. DMTCS Henning Fernau
2001	—	`conf`	Finding Optimal Solutions to Atomix. KI/ÖGAI Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
2001	Misc	`conf`	Graph Separators: A Parameterized View. COCOON Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	—	`conf`	Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS Henning Fernau, Markus Holzer
2001	J	`jnl`	Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. Henning Fernau, Markus Holzer, Rudolf Freund
2001	J	`jnl`	Iterated Function Systems and Control Languages. Inf. Comput. Henning Fernau, Ludwig Staiger
2001	—	`conf`	Learning XML Grammars. MLDM Henning Fernau
2001	C	`conf`	Nonterminal Complexity of Programmed Grammars. MCU Henning Fernau
2001	J	`jnl`	Parallel communicating grammar systems with terminal transmission. Acta Informatica Henning Fernau
2001	J	`jnl`	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems Electron. Colloquium Comput. Complex. Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	A*	`conf`	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	B	`conf`	Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2001	—	`conf`	Regularly controlled formal power series. Where Mathematics, Computer Science, Linguistics and Biology Meet Henning Fernau, Werner Kuich
2001	—	`conf`	Valence Grammars with Target Sets. Words, Semigroups, and Transductions Henning Fernau, Ralf Stiebe
2001	J	`jnl`	Valences in Lindenmayer Systems. Fundam. Informaticae Henning Fernau, Ralf Stiebe
2001	C	`conf`	Valuated and Valence Grammars: An Algebraic View. Developments in Language Theory Henning Fernau, Ralf Stiebe
2000	—	`conf`	External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics Henning Fernau, Markus Holzer
2000	—	`conf`	Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
2000	B	`conf`	Identification of Function Distinguishable Languages. ALT Henning Fernau
2000	—	`conf`	Permutations and Control Sets for Learning Non-regular Language Families. ICGI Henning Fernau, José M. Sempere
2000	J	`jnl`	Regulated Grammars under Leftmost Derivation. Grammars Henning Fernau
2000	—	`conf`	Terminal distinguishable languages. AI&M Henning Fernau
2000	B	`conf`	k-gram Extensions of Terminal Distinguishable Languages. ICPR Henning Fernau
1999	B	`conf`	An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS Henning Fernau, Rolf Niedermeier
1999	J	`jnl`	Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. J. Autom. Lang. Comb. Henning Fernau, Frank Stephan
1999	C	`conf`	Decidability of code properties. Developments in Language Theory Henning Fernau, Klaus Reinhardt, Ludwig Staiger
1999	Misc	`conf`	Efficient Learning of Some Linear Matrix Languages. COCOON Henning Fernau
1999	J	`jnl`	On Accepting Pure Lindenmayer Systems. Fundam. Informaticae Henning Bordihn, Henning Fernau, Markus Holzer
1999	J	`jnl`	On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. Jürgen Dassow, Henning Fernau, Gheorghe Paun
1999	—	`conf`	Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems Henning Fernau, Rudolf Freund, Markus Holzer
1999	—	`conf`	Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems Henning Fernau, Rudolf Freund, Markus Holzer
1998	—	`conf`	Character Recognition with SSPR/SPR Henning Fernau, Rudolf Freund, Markus Holzer
1998	B	`conf`	IFS and Control Languages. MFCS Henning Fernau, Ludwig Staiger
1998	B	`conf`	Regulated Grammars with Leftmost Derivation. SOFSEM Henning Fernau
1998	J	`jnl`	Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. Theor. Comput. Sci. Henning Fernau, Dietmar Wätjen
1998	—	`conf`	The Generative Power of MCU (2) Henning Fernau, Rudolf Freund, Markus Holzer
1997	—	`conf`	Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages Henning Fernau, Rudolf Freund
1997	C	`conf`	Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory Henning Fernau, Markus Holzer, Rudolf Freund
1997	—	`conf`	Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages Henning Fernau, Markus Holzer
1997	J	`jnl`	Graph-Controlled Grammars as Language Acceptors. J. Autom. Lang. Comb. Henning Fernau
1997	C	`conf`	How Powerful is Unconditional Transfer? - When UT meets AC. Developments in Language Theory Henning Fernau, Frank Stephan
1997	B	`conf`	Regulations by Valences. MFCS Henning Fernau, Ralf Stiebe
1997	J	`jnl`	Unconditional Transfer in Regulated Rewriting. Acta Informatica Henning Fernau
1996	J	`jnl`	Accepting Grammars and Systems via Context Condition Grammars. J. Autom. Lang. Comb. Henning Bordihn, Henning Fernau
1996	J	`jnl`	Accepting Multi-Agent Systems II. Acta Cybern. Henning Fernau, Markus Holzer
1996	J	`jnl`	Accepting Multi-Agent Systems. Comput. Artif. Intell. Henning Fernau, Markus Holzer, Henning Bordihn
1996	—	`conf`	Advocating Ownership. FSTTCS Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
1996	B	`conf`	Bounded Parallelism in Array Grammars Used for Character Recognition. SSPR Henning Fernau, Rudolf Freund
1996	J	`jnl`	Closure Properties of Ordered Languages. Bull. EATCS Henning Fernau
1996	J	`jnl`	Membership for k-Limited ET0L Languages is not Decidable. J. Autom. Lang. Comb. Henning Fernau
1996	J	`jnl`	On Grammar and Language Families. Fundam. Informaticae Henning Fernau
1996	B	`conf`	On Unconditional Transfer. MFCS Henning Fernau
1996	J	`jnl`	Remarks on Propagating Partition-Limited ETOL Systems. J. Univers. Comput. Sci. Henning Fernau
1995	J	`jnl`	A Note on Uniformly Limited ETOL Systems with Unique Interpretation. Inf. Process. Lett. Henning Fernau
1995	J	`jnl`	A predicate for separating language classes. Bull. EATCS Henning Fernau
1995	C	`conf`	Accepting Grammars and Systems: An Overview. Developments in Language Theory Henning Bordihn, Henning Fernau
1995	J	`jnl`	Remarks on accepting parallel systems. Int. J. Comput. Math. Henning Fernau, Henning Bordihn
1995	J	`jnl`	Valuations of Languages, with Applications to Fractal Geometry. Theor. Comput. Sci. Henning Fernau
1995	J	`jnl`	Valuations, regular expressions, and fractal geometry. Appl. Algebra Eng. Commun. Comput. Henning Fernau
1994	—	`—`	Iterierte Funktionen, Sprachen und Fraktale. Henning Fernau
1994	J	`jnl`	Membership for 1-Limited ET0L Languages Is Not Decidable. J. Inf. Process. Cybern. Henning Fernau
1994	A*	`conf`	Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP Henning Fernau, Ludwig Staiger
1993	J	`jnl`	Adult Languages of Propagating Systems with Restricted Parallelism. J. Inf. Process. Cybern. Henning Fernau
1993	C	`conf`	Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. Developments in Language Theory Henning Fernau
1991	J	`jnl`	On Function-limited Lindenmayer Systems. J. Inf. Process. Cybern. Henning Fernau