default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Fernau
Person information
- affiliation: University of Trier, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[e8]Henning Fernau
, Inge Schwank, Jacqueline Staub:
Creative Mathematical Sciences Communication: 7th International Conference, CMSC 2024, Trier, Germany, October 7-10, 2024, Proceedings. Lecture Notes in Computer Science 15229, Springer 2025, ISBN 978-3-031-73256-0 [contents]- 2024
- [j162]Cristina Bazgan, Henning Fernau:
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Algorithmica 86(3): 695-696 (2024) - [j161]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. Algorithmica 86(6): 1862-1887 (2024) - [j160]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024) - [j159]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of generalized forbidding matrix grammars. Theor. Comput. Sci. 999: 114539 (2024) - [c175]Zhidan Feng, Henning Fernau, Binhai Zhu:
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. AAIM (1) 2024: 94-108 - [c174]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Counting Simple Rules in Semi-conditional Grammars is not Simple. CiE 2024: 192-204 - [c173]Kevin Mann, Henning Fernau:
Perfect Roman Domination: Aspects of Enumeration and Parameterization. IWOCA 2024: 354-368 - [c172]Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi:
Offensive Alliances in Signed Graphs. TAMC 2024: 234-246 - [e7]Henning Fernau, Serge Gaspers, Ralf Klasing:
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. Lecture Notes in Computer Science 14519, Springer 2024, ISBN 978-3-031-52112-6 [contents] - [i47]Zhidan Feng, Henning Fernau, Binhai Zhu:
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. CoRR abs/2404.19164 (2024) - [i46]Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov:
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. CoRR abs/2409.06971 (2024) - 2023
- [j158]Henning Fernau:
Editorial 2023: changes and invariants. Acta Informatica 60(4): 331-333 (2023) - [j157]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: 183-201 (2023) - [j156]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): 937-980 (2023) - [j155]Henning Fernau, Petra Wolf, Tomoyuki Yamakami:
Synchronizing deterministic push-down automata can be really hard. Inf. Comput. 295(Part B): 105089 (2023) - [j154]Martin Vu, Henning Fernau:
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. J. Autom. Lang. Comb. 28(1-3): 221-244 (2023) - [j153]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. 27(6): 409-431 (2023) - [j152]Henning Fernau, Mikhail V. Volkov:
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst. 67(2): 219-220 (2023) - [j151]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Theory Comput. Syst. 67(5): 1026-1049 (2023) - [c171]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Synchronization and Diversity of Solutions. AAAI 2023: 11516-11524 - [c170]Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. CIAC 2023: 187-201 - [c169]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS 2023: 6:1-6:15 - [c168]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
When Stars Control a Grammar's Work. AFL 2023: 96-111 - [e6]Henning Fernau, Klaus Jansen:
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings. Lecture Notes in Computer Science 14292, Springer 2023, ISBN 978-3-031-43586-7 [contents] - [i45]Henning Fernau, Kshitij Gajjar:
Sum Labelling Graphs of Maximum Degree Two. CoRR abs/2301.02178 (2023) - [i44]Henning Fernau, Kevin Mann:
Hitting the Romans. CoRR abs/2302.11417 (2023) - [i43]Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf:
Defensive Alliances in Signed Networks. CoRR abs/2309.06801 (2023) - [i42]Henning Fernau, Kevin Mann:
Perfect Roman Domination and Unique Response Roman Domination. CoRR abs/2309.07018 (2023) - [i41]Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi:
Offensive Alliances in Signed Graphs. CoRR abs/2312.11960 (2023) - [i40]Zhidan Feng, Henning Fernau, Kevin Mann:
Enumerating Defensive Alliances. CoRR abs/2312.11963 (2023) - 2022
- [j150]Henning Fernau, Markus Holzer, Petra Wolf:
Preface to Klaus-Jörn Lange Festschrift. Acta Informatica 59(4): 285-287 (2022) - [j149]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of graphs specified by a regular language. Acta Informatica 59(4): 357-385 (2022) - [j148]Henning Fernau:
Special Issue "Selected Algorithmic Papers From CSR 2020". Algorithms 15(11): 426 (2022) - [j147]Martin Vu, Henning Fernau:
Insertion-deletion systems with substitutions I. Comput. 11(1): 57-83 (2022) - [j146]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319: 2-18 (2022) - [j145]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of matrix simple semi-conditional grammars. Inf. Comput. 284: 104688 (2022) - [j144]Henning Fernau, Jens Bruchertseifer:
Synchronizing words and monoid factorization, yielding a new parameterized complexity class? Math. Struct. Comput. Sci. 32(2): 189-215 (2022) - [j143]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: 48-65 (2022) - [c167]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: 12:1-12:16 - [c166]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Minimal Connected Dominating Sets. ESA 2022: 1:1-1:15 - [c165]Henning Fernau, Carolina Haase, Stefan Hoffmann:
The Synchronization Game on Subclasses of Automata. FUN 2022: 14:1-14:17 - [c164]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. WG 2022: 1-15 - [e5]Cristina Bazgan, Henning Fernau:
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1 [contents] - [i39]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Minimal Roman Dominating Functions: Extensions and Enumeration. CoRR abs/2204.04765 (2022) - [i38]Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Connected Dominating Sets. CoRR abs/2205.00086 (2022) - [i37]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 abs/2205.07777 (2022) - [i36]Kevin Goergen, Henning Fernau, Esther Oest, Petra Wolf:
All Paths Lead to Rome. CoRR abs/2207.09439 (2022) - [i35]Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. CoRR abs/2208.05261 (2022) - [i34]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. CoRR abs/2208.08864 (2022) - [i33]Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. CoRR abs/2212.11653 (2022) - 2021
- [j142]Henning Fernau, Andreas Malcher, Giovanni Pighizzini:
Preface to Martin Kutrib Festschrift. Acta Informatica 58(4): 241-242 (2021) - [j141]Martin Vu, Henning Fernau:
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. Algorithms 14(5): 131 (2021) - [j140]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180(1-2): 1-28 (2021) - [j139]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundam. Informaticae 181(2-3): 189-211 (2021) - [j138]Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel deterministic finite automata with loops and related problems. RAIRO Theor. Informatics Appl. 55: 1-24 (2021) - [j137]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): 344-409 (2021) - [j136]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the generative capacity of matrix insertion-deletion systems of small sum-norm. Nat. Comput. 20(4): 671-689 (2021) - [j135]Jérôme Monnot, Henning Fernau, David F. Manlove:
Algorithmic aspects of upper edge domination. Theor. Comput. Sci. 877: 46-57 (2021) - [c163]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Abundant Extensions. CIAC 2021: 3-17 - [c162]Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor:
Invited Talks. CIAC 2021: 3-19 - [c161]Henning Fernau:
Parsimonious Computational Completeness. DLT 2021: 12-26 - [c160]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of Graphs Specified by a Regular Language. DLT 2021: 117-129 - [c159]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. FCT 2021: 230-244 - [c158]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: 34:1-34:15 - [c157]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI 2021: 10-16 - [c156]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration Under Width Constraints. MFCS 2021: 8:1-8:15 - [c155]Martin Vu, Henning Fernau:
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. SOFSEM 2021: 577-592 - [i32]Volker Diekert, Henning Fernau, Petra Wolf:
Properties of Graphs Specified by a Regular Language. CoRR abs/2105.00436 (2021) - [i31]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR abs/2105.09413 (2021) - [i30]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. CoRR abs/2107.12973 (2021) - [i29]Henning Fernau, Stefan Hoffmann, Michael Wehar:
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR abs/2108.05244 (2021) - [i28]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 abs/2110.01279 (2021) - [i27]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j134]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j133]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: 2-15 (2020) - [j132]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280: 23-42 (2020) - [j131]Sergey Verlan, Henning Fernau, Lakshmanan Kuppusamy:
Universal insertion grammars of size two. Theor. Comput. Sci. 843: 153-163 (2020) - [j130]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12(1): 6:1-6:37 (2020) - [c154]Martin Vu, Henning Fernau:
Insertion-Deletion Systems with Substitutions I. CiE 2020: 366-378 - [c153]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS 2020: 52-63 - [c152]Martin Vu, Henning Fernau:
Insertion-Deletion with Substitutions II. DCFS 2020: 231-243 - [c151]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Width Notions for Ordering-Related Problems. FSTTCS 2020: 9:1-9:18 - [c150]Henning Fernau, Petra Wolf:
Synchronization of Deterministic Visibly Push-Down Automata. FSTTCS 2020: 45:1-45:15 - [c149]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. Int. Conf. on Membrane Computing 2020: 31-45 - [c148]Henning Fernau, Petra Wolf, Tomoyuki Yamakami:
Synchronizing Deterministic Push-Down Automata Can Be Really Hard. MFCS 2020: 33:1-33:15 - [c147]Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau:
Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM 2020: 236-247 - [c146]Jens Bruchertseifer, Henning Fernau:
Synchronizing Words and Monoid Factorization: A Parameterized Perspective. TAMC 2020: 352-364 - [e4]Henning Fernau:
Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12159, Springer 2020, ISBN 978-3-030-50025-2 [contents] - [i26]Petra Wolf, Henning Fernau:
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. CoRR abs/2003.05826 (2020) - [i25]Henning Fernau, Petra Wolf:
Synchronization of Deterministic Visibly Push-Down Automata. CoRR abs/2005.01374 (2020) - [i24]Henning Fernau, Petra Wolf, Tomoyuki Yamakami:
Synchronizing Deterministic Push-Down Automata Can Be Really Hard. CoRR abs/2005.01381 (2020)
2010 – 2019
- 2019
- [j129]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On path-controlled insertion-deletion systems. Acta Informatica 56(1): 35-59 (2019) - [j128]Cristina Bazgan, Henning Fernau, Zsolt Tuza:
Aspects of upper defensive alliances. Discret. Appl. Math. 266: 111-120 (2019) - [j127]Henning Fernau, Stefan Hoffmann:
Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. 24(2-4): 287-307 (2019) - [j126]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. 18(3): 563-577 (2019) - [j125]Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang:
Kernels for packing and covering problems. Theor. Comput. Sci. 790: 152-166 (2019) - [c145]Henning Fernau, Ulrike Stege:
Profit Parameterizations of Dominating Set. AAIM 2019: 108-120 - [c144]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM 2019: 174-188 - [c143]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: 124-136 - [c142]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS 2019: 111-123 - [c141]Henning Fernau, Martin Vu:
Regulated Tree Automata. DCFS 2019: 124-136 - [c140]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: 185-200 - [c139]Henning Fernau:
Modern Aspects of Complexity Within Formal Languages. LATA 2019: 3-30 - [c138]Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf:
Computational Complexity of Synchronization under Regular Constraints. MFCS 2019: 63:1-63:14 - [c137]Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel automata with loops. NCMA 2019: 63-78 - [c136]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM 2019: 192-205 - 2018
- [j124]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80(9): 2517-2550 (2018) - [j123]Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara:
Special Issue on Reconfiguration Problems. Algorithms 11(11): 187 (2018) - [j122]Henning Fernau, Juan A. Rodríguez-Velázquez:
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results. Discret. Appl. Math. 236: 183-202 (2018) - [j121]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): 1-21 (2018) - [j120]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Properties of Language Classes Between Linear and Context-Free. J. Autom. Lang. Comb. 23(4): 329-360 (2018) - [j119]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: 232-258 (2018) - [j118]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. 17(2): 249-269 (2018) - [j117]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - [j116]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733: 44-54 (2018) - [c135]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c134]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele:
New Nonterminal Complexity Results for Semi-conditional Grammars. CiE 2018: 172-182 - [c133]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. MCU 2018: 88-104 - [c132]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. UCNC 2018: 86-100 - [i23]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
On the Complexity of Solution Extension of Optimization Problems. CoRR abs/1810.04553 (2018) - [i22]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 and generalizations. CoRR abs/1810.04629 (2018) - [i21]Henning Fernau, Petr A. Golovach, Marie-France Sagot:
Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421). Dagstuhl Reports 8(10): 63-86 (2018) - 2017
- [j115]Henning Fernau, Andreas Krebs:
Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms 10(1): 24 (2017) - [j114]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. Fundam. Informaticae 155(1-2): 209-232 (2017) - [j113]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. J. Autom. Lang. Comb. 22(1-3): 61-92 (2017) - [j112]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679: 31-52 (2017) - [j111]Artiom Alhazov, Henning Fernau, Rudolf Freund, Sergiu Ivanov, Rani Siromoney, K. G. Subramanian:
Contextual array grammars with matrix control, regular control languages, and tissue P systems control. Theor. Comput. Sci. 682: 5-21 (2017) - [j110]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Theor. Comput. Sci. 682: 100-121 (2017) - [c131]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. DCFS 2017: 128-139 - [c130]Henning Fernau:
Extremal Kernelization: A Commemorative Paper. IWOCA 2017: 24-36 - [c129]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS 2017: 30:1-30:15 - [c128]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-verifying pushdown automata. NCMA 2017: 103-117 - [c127]Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas:
Regular grammars for array languages. NCMA 2017: 119-134 - [c126]Henning Fernau, Lakshmanan Kuppusamy:
Parikh Images of Matrix Ins-Del Systems. TAMC 2017: 201-215 - [c125]Henning Fernau, Lakshmanan Kuppusamy, Sergey Verlan:
Universal Matrix Insertion Grammars with Small Size. UCNC 2017: 182-193 - [c124]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. CIAA 2017: 89-100 - [i20]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR abs/1706.05906 (2017) - [i19]Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-Dimensional Pattern Languages. CoRR abs/1707.04083 (2017) - 2016
- [j109]Henning Fernau:
Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue. Algorithms 9(4): 64 (2016) - [j108]Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Weak total resolvability in graphs. Discuss. Math. Graph Theory 36(1): 185-210 (2016) - [j107]Johanna Björklund, Henning Fernau, Anna Kasprzik:
Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246: 3-19 (2016) - [j106]Henning Fernau:
An Essay on General Grammars. J. Autom. Lang. Comb. 21(1-2): 69-92 (2016) - [j105]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3): 503-520 (2016) - [j104]Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. 59(1): 24-51 (2016) - [c123]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c122]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
On the Complexity Landscape of the Domination Chain. CALDAM 2016: 61-72 - [c121]Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas:
Picture Scanning Automata. CompIMAGE 2016: 132-147 - [c120]S. James Immanuel, D. Gnanaraj Thomas, Henning Fernau, Robinson Thamburaj, Atulya K. Nagar:
Two-Dimensional Input-Revolving Automata. CompIMAGE 2016: 148-164 - [c119]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Contextual Array Grammars with Matrix and Regular Control. DCFS 2016: 98-110 - [c118]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. DCFS 2016: 111-125 - [c117]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: 122:1-122:14 - [c116]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Building Clusters with Lower-Bounded Sizes. ISAAC 2016: 4:1-4:13 - [c115]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [c114]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. UCNC 2016: 35-48 - [c113]Henning Fernau, Andreas Krebs:
Problems on Finite Automata and the Exponential Time Hypothesis. CIAA 2016: 89-100 - [r3]Henning Fernau:
Kernelization, Turing Kernels. Encyclopedia of Algorithms 2016: 1043-1045 - [r2]Henning Fernau:
Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms 2016: 1520-1525 - [i18]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - 2015
- [j103]Henning Fernau, Rudolf Freund, Markus L. Schmid, K. G. Subramanian, Petra Wiederhold:
Contextual array grammars and array P systems. Ann. Math. Artif. Intell. 75(1-2): 5-26 (2015) - [j102]Henning Fernau, Markus L. Schmid:
Pattern matching with variables: A multivariate complexity analysis. Inf. Comput. 242: 287-305 (2015) - [j101]Henning Fernau, Rudolf Freund, Markus Holzer:
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. Int. J. Found. Comput. Sci. 26(8): 1167-1188 (2015) - [j100]Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei:
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9): 671-676 (2015) - [j99]Henning Fernau, Pinar Heggernes, Yngve Villanger:
A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81(4): 747-765 (2015) - [j98]Sergio Bermudo, Henning Fernau:
Combinatorics for smaller kernels: The differential of a graph. Theor. Comput. Sci. 562: 330-345 (2015) - [j97]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. 565: 1-15 (2015) - [j96]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. ACM Trans. Comput. Theory 7(3): 13:1-13:29 (2015) - [c112]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, D. Gnanaraj Thomas:
Scanning Pictures the Boustrophedon Way. IWCIA 2015: 202-216 - [c111]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. MCU 2015: 61-78 - [c110]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS 2015: 302-315 - [c109]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. TAMC 2015: 415-427 - [c108]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid:
Jumping Finite Automata: Characterizations and Complexity. CIAA 2015: 89-101 - [i17]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination. CoRR abs/1506.07260 (2015) - [i16]Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and Complexity Results on Jumping Finite Automata. CoRR abs/1512.00482 (2015) - 2014
- [j95]Sergio Bermudo, Henning Fernau:
Computing the differential of a graph: Hardness, approximability and exact algorithms. Discret. Appl. Math. 165: 69-82 (2014) - [j94]Henning Fernau, Daniel Meister:
Digraphs of bounded elimination width. Discret. Appl. Math. 168: 78-87 (2014) - [j93]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe:
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014) - [j92]Daniel Binkele-Raible, Henning Fernau:
A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. Discret. Math. Theor. Comput. Sci. 16(1): 179-200 (2014) - [j91]Henning Fernau, Juan A. Rodríguez-Velázquez:
A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. 2(1): 70-86 (2014) - [c107]Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results. CSR 2014: 153-166 - [c106]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Approximation Algorithms Inspired by Kernelization Methods. ISAAC 2014: 479-490 - [c105]Moritz Gobbert, Henning Fernau:
Latrunculi - on the complexity of Roman chess. NCMA 2014: 115-130 - [c104]Henning Fernau, Rudolf Freund, Markus Holzer:
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. AFL 2014: 246-260 - [i15]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR abs/1409.3742 (2014) - [i14]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. CoRR abs/1411.6915 (2014) - 2013
- [j90]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013) - [j89]Daniel Binkele-Raible, Henning Fernau:
Packing paths: Recycling saves time. Discret. Appl. Math. 161(12): 1686-1698 (2013) - [j88]Ljiljana Brankovic, Henning Fernau:
A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. 511: 85-108 (2013) - [c103]Henning Fernau, Markus L. Schmid:
Pattern Matching with Variables: A Multivariate Complexity Analysis. CPM 2013: 83-94 - [c102]Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. FSTTCS 2013: 55-66 - [c101]Johanna Björklund, Henning Fernau, Anna Kasprzik:
MAT Learning of Universal Automata. LATA 2013: 141-152 - [c100]Henning Fernau, Pinar Heggernes, Yngve Villanger:
A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286 - [c99]Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-dimensional pattern languages. NCMA 2013: 117-132 - [c98]Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian:
Array Insertion and Deletion P Systems. UCNC 2013: 67-78 - 2012
- [j87]Daniel Binkele-Raible, Henning Fernau:
An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63(1-2): 323-346 (2012) - [j86]Daniel Binkele-Raible, Henning Fernau:
Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica 64(1): 189-212 (2012) - [j85]Sergio Bermudo, Henning Fernau:
Lower bounds on the differential of a graph. Discret. Math. 312(22): 3236-3250 (2012) - [j84]Guoqiang Bai, Henning Fernau:
Constraint bipartite vertex cover: simpler exact algorithms and implementations. J. Comb. Optim. 23(3): 331-355 (2012) - [j83]Henning Fernau, Carlos Martín-Vide:
From the Guest Editors. J. Comput. Syst. Sci. 78(6): 1793-1794 (2012) - [j82]Daniel Binkele-Raible, Henning Fernau:
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. J. Discrete Algorithms 15: 43-55 (2012) - [j81]Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8(4): 38:1-38:19 (2012) - [j80]Christophe Costa Florêncio, Henning Fernau:
On families of categorial grammars of bounded value, their learnability and related complexity questions. Theor. Comput. Sci. 452: 21-38 (2012) - [c97]Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang:
Kernels for Packing and Covering Problems - (Extended Abstract). FAW-AAIM 2012: 199-211 - [c96]Henning Fernau:
Cooperating Distributed Tree Automata. Languages Alive 2012: 75-85 - [c95]Henning Fernau:
Saving on Phases: Parameterized Approximation for Total Vertex Cover. IWOCA 2012: 20-31 - 2011
- [j79]Michael R. Fellows, Henning Fernau:
Facility location problems: A parameterized view. Discret. Appl. Math. 159(11): 1118-1130 (2011) - [j78]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege:
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discret. Optim. 8(1): 41-49 (2011) - [j77]Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk:
Breaking the 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011) - [j76]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011) - [c94]Henning Fernau, Ralf Stiebe:
On the Expressive Power of Valences in Cooperating Distributed Grammar Systems. Computation, Cooperation, and Life 2011: 90-106 - [c93]Sergio Bermudo, Henning Fernau:
Computing the differential of a graph. CTW 2011: 68-71 - [c92]Ljiljana Brankovic, Henning Fernau:
Parameterized Approximation Algorithms for Hitting Set. WAOA 2011: 63-76 - 2010
- [j75]Henning Fernau:
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Algorithmica 57(1): 97-118 (2010) - [j74]Henning Fernau:
minimum dominating set of queens: A trivial programming exercise? Discret. Appl. Math. 158(4): 308-318 (2010) - [j73]Henning Fernau:
Parameterized algorithmics for d-Hitting Set. Int. J. Comput. Math. 87(14): 3157-3174 (2010) - [j72]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010) - [j71]Henning Fernau, Michael Kaufmann, Mathias Poths:
Comparing trees via crossing minimization. J. Comput. Syst. Sci. 76(7): 593-608 (2010) - [j70]Daniel Binkele-Raible, Henning Fernau:
A new upper bound for Max-2-SAT: A graph-theoretic approach. J. Discrete Algorithms 8(4): 388-401 (2010) - [j69]Henning Fernau:
Parameterized algorithms for d-Hitting Set: The weighted case. Theor. Comput. Sci. 411(16-18): 1698-1713 (2010) - [c91]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege:
A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010: 31-38 - [c90]Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith:
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. CIAC 2010: 311-322 - [c89]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43 - [c88]Daniel Binkele-Raible, Henning Fernau:
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CSR 2010: 328-339 - [c87]Christophe Costa Florêncio, Henning Fernau:
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. ICGI 2010: 280-283 - [c86]Ljiljana Brankovic, Henning Fernau:
Combining Two Worlds: Parameterised Approximation for Vertex Cover. ISAAC (1) 2010: 390-402 - [c85]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348 - [c84]Daniel Binkele-Raible, Henning Fernau:
Enumerate and Measure: Improving Parameter Budget Management. IPEC 2010: 38-49 - [c83]Christophe Costa Florêncio, Henning Fernau:
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA 2010: 202-213 - [c82]Daniel Raible, Henning Fernau:
An Amortized Search Tree Analysis for k-Leaf Spanning Tree. SOFSEM 2010: 672-684 - [e3]Adrian-Horia Dediu, Henning Fernau, Carlos Martín-Vide:
Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. Lecture Notes in Computer Science 6031, Springer 2010, ISBN 978-3-642-13088-5 [contents]
2000 – 2009
- 2009
- [j68]Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Offensive r-alliances in graphs. Discret. Appl. Math. 157(1): 177-182 (2009) - [j67]José María Sigarreta, Sergio Bermudo, Henning Fernau:
On the complement graph and defensive k-alliances. Discret. Appl. Math. 157(8): 1687-1695 (2009) - [j66]Henning Fernau:
Algorithms for learning regular expressions from positive data. Inf. Comput. 207(4): 521-541 (2009) - [j65]Henning Fernau, Daniel Raible:
A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4): 319-341 (2009) - [j64]Henning Fernau, David F. Manlove:
Vertex and edge covers with clustering properties: Complexity and algorithms. J. Discrete Algorithms 7(2): 149-167 (2009) - [c81]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. ADT 2009: 86-97 - [c80]Henning Fernau, Daniel Raible:
Packing Paths: Recycling Saves Time. CTW 2009: 79-83 - [c79]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible:
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209 - [c78]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172 - [c77]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432 - [c76]Henning Fernau, Daniel Raible:
Searching Trees: An Essay. TAMC 2009: 59-70 - [c75]Henning Fernau, Serge Gaspers, Daniel Raible:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111 - [i13]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009) - [i12]Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles. CoRR abs/0909.4224 (2009) - [i11]Daniel Raible, Henning Fernau:
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CoRR abs/0911.1900 (2009) - 2008
- [j63]Henning Fernau:
Parameterized algorithmics for linear arrangement problems. Discret. Appl. Math. 156(17): 3166-3177 (2008) - [j62]Henning Fernau, Joseph F. Ryan, Kiki A. Sugeng:
A sum labelling for the generalised friendship graph. Discret. Math. 308(5-6): 734-740 (2008) - [j61]Henning Fernau, Ralf Stiebe:
Blind Counter Automata on omega-Words. Fundam. Informaticae 83(1-2): 51-64 (2008) - [j60]Jürgen Dassow, Henning Fernau:
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Inf. Comput. 206(9-10): 1095-1103 (2008) - [j59]Henning Fernau:
ROMAN DOMINATION: a parameterized perspective. Int. J. Comput. Math. 85(1): 25-38 (2008) - [j58]Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008) - [j57]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4): 541-552 (2008) - [c74]Michael R. Fellows, Henning Fernau:
Facility Location Problems: A Parameterized View. AAIM 2008: 188-199 - [c73]Henning Fernau, Daniel Raible:
A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63 - [c72]Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Global r-alliances and total domination. CTW 2008: 98-101 - [c71]Guoqiang Bai, Henning Fernau:
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations. FAW 2008: 67-78 - [c70]Stefan Gulan, Henning Fernau:
An Optimal Construction of Finite Automata from Regular Expressions. FSTTCS 2008: 211-222 - [c69]Daniel Raible, Henning Fernau:
Power Domination in O*(1.7548n) Using Reference Search Trees. ISAAC 2008: 136-147 - [c68]Daniel Raible, Henning Fernau:
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562 - [c67]Stefan Gulan, Henning Fernau:
Local elimination-strategies in automata for shorter regular expressions. SOFSEM (2) 2008: 46-57 - [c66]Henning Fernau, Daniel Raible:
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156 - [e2]Carlos Martín-Vide, Friedrich Otto, Henning Fernau:
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Lecture Notes in Computer Science 5196, Springer 2008, ISBN 978-3-540-88281-7 [contents] - [r1]Henning Fernau:
Parameterized Algorithms for Drawing Graphs. Encyclopedia of Algorithms 2008 - [i10]Daniel Raible, Henning Fernau:
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach. CoRR abs/0803.3531 (2008) - [i9]Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang:
A Parameterized Perspective on P2-Packings. CoRR abs/0804.0570 (2008) - [i8]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. CoRR abs/0810.4796 (2008) - [i7]Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov:
Exact Exponential Time Algorithms for Max Internal Spanning Tree. CoRR abs/0811.1875 (2008) - 2007
- [j56]Henning Fernau:
Programmed Grammars with Rule Queues. Int. J. Found. Comput. Sci. 18(6): 1209-1213 (2007) - [j55]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. RAIRO Theor. Informatics Appl. 41(3): 243-259 (2007) - [j54]Henning Fernau:
Learning tree languages from text. RAIRO Theor. Informatics Appl. 41(4): 351-374 (2007) - [j53]Henning Bordihn, Henning Fernau:
The Degree of Parallelism. J. Autom. Lang. Comb. 12(1-2): 25-47 (2007) - [j52]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. J. Autom. Lang. Comb. 12(1-2): 117-138 (2007) - [j51]Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia:
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37(4): 1077-1106 (2007) - [c65]Henning Fernau:
Dynamic programming for queen domination. CTW 2007: 43-48 - [c64]Jürgen Dassow, Henning Fernau:
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. LATA 2007: 249-260 - [c63]Henning Fernau, Daniel Raible:
Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70 - [i6]Daniel Raible, Henning Fernau:
Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - 2006
- [j50]Faisal N. Abu-Khzam, Henning Fernau:
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electron. Notes Discret. Math. 25: 1-6 (2006) - [j49]Henning Fernau:
Speeding up Exact Algorithms With High Probability. Electron. Notes Discret. Math. 25: 57-59 (2006) - [j48]Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide:
Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1-3): 67-81 (2006) - [c62]Henning Fernau, David F. Manlove:
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. ACiD 2006: 69-84 - [c61]Henning Fernau:
Parameterized Algorithms for Hitting Set: The Weighted Case. CIAC 2006: 332-343 - [c60]Henning Fernau:
edge dominating set: Efficient Enumeration-Based Exact Algorithms. IWPEC 2006: 142-153 - [c59]Faisal N. Abu-Khzam, Henning Fernau:
Kernels: Annotated, Proper and Induced. IWPEC 2006: 264-275 - [c58]Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond:
NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245 - [c57]Henning Fernau:
ROMAN DOMINATION: A Parameterized Perspective. SOFSEM 2006: 262-271 - [i5]Henning Fernau:
Parameterized Algorithms for Hitting Set: the Weighted Case. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j47]Henning Fernau, Rudolf Freund, Markus Holzer:
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Informaticae 64(1-4): 159-170 (2005) - [j46]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005) - [j45]Henning Fernau:
Two-Layer Planarization: Improving on Parameterized Algorithmics. J. Graph Algorithms Appl. 9(2): 205-238 (2005) - [c56]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58 - [c55]Henning Fernau:
Algorithms for Learning Regular Expressions. ALT 2005: 297-311 - [c54]Henning Bordihn, Henning Fernau:
The degree of parallelism. DCFS 2005: 51-62 - [c53]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 - [c52]Henning Fernau, Michael Kaufmann, Mathias Poths:
Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469 - [c51]Henning Fernau:
Two-Layer Planarization: Improving on Parameterized Algorithmics. SOFSEM 2005: 137-146 - [c50]Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia:
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280 - 2004
- [j44]Henning Fernau:
Complexity of a {0, 1}-matrix problem. Australas. J Comb. 29: 273-300 (2004) - [j43]Henning Fernau:
Identifying Terminal Distinguishable Languages. Ann. Math. Artif. Intell. 40(3-4): 263-282 (2004) - [j42]Pieter W. Adriaans, Henning Fernau, Colin de la Higuera, Menno van Zaanen:
Introduction to the Special Issue on Grammar Induction. Grammars 7: 41-43 (2004) - [j41]Henning Fernau, Colin de la Higuera:
Grammar Induction: An Invitation to Formal Language Theorists. Grammars 7: 45-55 (2004) - [j40]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004) - [c49]Bradford Starkie, Henning Fernau:
The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. ICGI 2004: 235-247 - [c48]Henning Fernau:
Extracting Minimum Length Document Type Definitions Is NP-Hard. ICGI 2004: 277-278 - [c47]Henning Fernau, David W. Juedes:
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS 2004: 488-499 - [i4]Henning Fernau:
Parametric Duality: Kernel Sizes and Algorithmics. Electron. Colloquium Comput. Complex. TR04 (2004) - [i3]Henning Fernau:
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Electron. Colloquium Comput. Complex. TR04 (2004) - [i2]Henning Fernau:
Two-Layer Planarization: Improving on Parameterized Algorithmics. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j39]Henning Fernau:
Education(al) matters: teaching P versus NP. Bull. EATCS 80: 237-246 (2003) - [j38]Henning Fernau:
Parallel Grammars: A Phenomenology. Grammars 6(1): 25-87 (2003) - [j37]Henning Fernau, Alexander Meduna:
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86(5): 235-240 (2003) - [j36]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003) - [j35]Henning Fernau:
Identification of function distinguishable languages. Theor. Comput. Sci. 290(3): 1679-1711 (2003) - [j34]Henning Fernau, Alexander Meduna:
On the degree of scattered context-sensitivity. Theor. Comput. Sci. 290(3): 2121-2124 (2003) - [j33]Henning Fernau:
Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296(2): 225-251 (2003) - [j32]Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. 299(1-3): 633-662 (2003) - [c46]Henning Bordihn, Henning Fernau, Markus Holzer:
On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130 - [c45]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9 - [c44]Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed Parameter Algorithms for one-sided crossing minimization Revisited. GD 2003: 332-344 - 2002
- [j31]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002) - [j30]Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. J. Autom. Lang. Comb. 7(4): 487-503 (2002) - [j29]Henning Fernau, Ralf Stiebe:
Sequential grammars and automata with valences. Theor. Comput. Sci. 276(1-2): 377-405 (2002) - [j28]Henning Fernau:
Even linear simple matrix languages: formal language properties and grammatical inference. Theor. Comput. Sci. 289(1): 425-456 (2002) - [c43]Henning Fernau:
On Parameterized Enumeration. COCOON 2002: 564-573 - [c42]Henning Fernau:
Learning Tree Languages from Text. COLT 2002: 153-168 - [c41]Henning Fernau:
Fragmentation: Enhancing Identifiability. ICGI 2002: 92-105 - [c40]Henning Fernau, Agnes Radl:
Algorithms for Learning Function Distinguishable Regular Languages. SSPR/SPR 2002: 64-73 - [c39]Henning Fernau:
Graph Separator Algorithms: A Refined Analysis. WG 2002: 186-197 - [e1]Pieter W. Adriaans, Henning Fernau, Menno van Zaanen:
Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings. Lecture Notes in Computer Science 2484, Springer 2002, ISBN 3-540-44239-1 [contents] - 2001
- [j27]Henning Fernau:
Parallel communicating grammar systems with terminal transmission. Acta Informatica 37(7): 511-540 (2001) - [j26]Henning Fernau, Ralf Stiebe:
Valences in Lindenmayer Systems. Fundam. Informaticae 45(4): 329-358 (2001) - [j25]Henning Fernau, Ludwig Staiger:
Iterated Function Systems and Control Languages. Inf. Comput. 168(2): 125-143 (2001) - [j24]Henning Fernau, Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001) - [j23]Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001) - [c38]Henning Fernau, Ralf Stiebe:
Valence Grammars with Target Sets. Words, Semigroups, and Transductions 2001: 129-140 - [c37]Henning Fernau, Werner Kuich:
Regularly controlled formal power series. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 253-265 - [c36]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph Separators: A Parameterized View. COCOON 2001: 318-327 - [c35]Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS 2001: 79-90 - [c34]Henning Fernau, Ralf Stiebe:
Valuated and Valence Grammars: An Algebraic View. Developments in Language Theory 2001: 281-292 - [c33]Henning Fernau:
Even Linear Simple Matrix Languages: Formal Language Aspects. DMTCS 2001: 81-96 - [c32]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272 - [c31]Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier:
Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243 - [c30]Henning Fernau:
Nonterminal Complexity of Programmed Grammars. MCU 2001: 202-213 - [c29]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122 - [c28]Henning Fernau:
Learning XML Grammars. MLDM 2001: 73-87 - [c27]Henning Fernau:
Approximative Learning of Regular Languages. SOFSEM 2001: 223-232 - [i1]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j22]Henning Fernau:
Regulated Grammars under Leftmost Derivation. Grammars 3(1): 37-62 (2000) - [c26]Henning Fernau:
Identification of Function Distinguishable Languages. ALT 2000: 116-130 - [c25]Henning Fernau:
Terminal distinguishable languages. AI&M 2000 - [c24]Henning Fernau, Markus Holzer:
External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 104-120 - [c23]Henning Fernau, José M. Sempere:
Permutations and Control Sets for Learning Non-regular Language Families. ICGI 2000: 75-88 - [c22]Henning Fernau:
k-gram Extensions of Terminal Distinguishable Languages. ICPR 2000: 2125-2128 - [c21]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier:
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110
1990 – 1999
- 1999
- [j21]Henning Bordihn, Henning Fernau, Markus Holzer:
On Accepting Pure Lindenmayer Systems. Fundam. Informaticae 38(4): 365-375 (1999) - [j20]Jürgen Dassow, Henning Fernau, Gheorghe Paun:
On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. 10(1): 61-80 (1999) - [j19]Henning Fernau, Frank Stephan:
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. J. Autom. Lang. Comb. 4(2): 117-142 (1999) - [c20]Henning Fernau:
Efficient Learning of Some Linear Matrix Languages. COCOON 1999: 221-230 - [c19]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. Developments in Language Theory 1999: 153-163 - [c18]Henning Fernau, Rudolf Freund, Markus Holzer:
Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems 1999: 157-181 - [c17]Henning Fernau, Rudolf Freund, Markus Holzer:
Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems 1999: 284-296 - [c16]Henning Fernau, Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS 1999: 387-397 - 1998
- [j18]Henning Fernau, Dietmar Wätjen:
Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. Theor. Comput. Sci. 194(1-2): 35-55 (1998) - [c15]Henning Fernau, Rudolf Freund, Markus Holzer:
The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56 - [c14]Henning Fernau, Ludwig Staiger:
IFS and Control Languages. MFCS 1998: 740-750 - [c13]Henning Fernau:
Regulated Grammars with Leftmost Derivation. SOFSEM 1998: 322-331 - [c12]Henning Fernau, Rudolf Freund, Markus Holzer:
Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291 - 1997
- [j17]Henning Fernau:
Unconditional Transfer in Regulated Rewriting. Acta Informatica 34(11): 837-857 (1997) - [j16]Henning Fernau:
Graph-Controlled Grammars as Language Acceptors. J. Autom. Lang. Comb. 2(2): 79-91 (1997) - [c11]Henning Fernau, Markus Holzer:
Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages 1997: 10-26 - [c10]Henning Fernau, Rudolf Freund:
Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages 1997: 95-118 - [c9]Henning Fernau, Frank Stephan:
How Powerful is Unconditional Transfer? - When UT meets AC. Developments in Language Theory 1997: 249-260 - [c8]Henning Fernau, Markus Holzer, Rudolf Freund:
Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272 - [c7]Henning Fernau, Ralf Stiebe:
Regulations by Valences. MFCS 1997: 239-248 - 1996
- [j15]Henning Fernau, Markus Holzer:
Accepting Multi-Agent Systems II. Acta Cybern. 12(4): 361-379 (1996) - [j14]Henning Fernau, Markus Holzer, Henning Bordihn:
Accepting Multi-Agent Systems. Comput. Artif. Intell. 15(2-3): 123-139 (1996) - [j13]Henning Fernau:
Closure Properties of Ordered Languages. Bull. EATCS 58 (1996) - [j12]Henning Fernau:
On Grammar and Language Families. Fundam. Informaticae 25(1): 17-34 (1996) - [j11]Henning Bordihn, Henning Fernau:
Accepting Grammars and Systems via Context Condition Grammars. J. Autom. Lang. Comb. 1(2): 97-112 (1996) - [j10]Henning Fernau:
Membership for k-Limited ET0L Languages is not Decidable. J. Autom. Lang. Comb. 1(4): 243-245 (1996) - [j9]Henning Fernau:
Remarks on Propagating Partition-Limited ETOL Systems. J. Univers. Comput. Sci. 2(11): 745-755 (1996) - [c6]Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt:
Advocating Ownership. FSTTCS 1996: 286-297 - [c5]Henning Fernau:
On Unconditional Transfer. MFCS 1996: 348-359 - [c4]Henning Fernau, Rudolf Freund:
Bounded Parallelism in Array Grammars Used for Character Recognition. SSPR 1996: 40-49 - 1995
- [j8]Henning Fernau:
Valuations, regular expressions, and fractal geometry. Appl. Algebra Eng. Commun. Comput. 7(1): 59-75 (1995) - [j7]Henning Fernau:
A predicate for separating language classes. Bull. EATCS 56 (1995) - [j6]Henning Fernau, Henning Bordihn:
Remarks on accepting parallel systems. Int. J. Comput. Math. 56(1-2): 51-67 (1995) - [j5]Henning Fernau:
A Note on Uniformly Limited ETOL Systems with Unique Interpretation. Inf. Process. Lett. 54(4): 199-204 (1995) - [j4]Henning Fernau:
Valuations of Languages, with Applications to Fractal Geometry. Theor. Comput. Sci. 137(2): 177-217 (1995) - [c3]Henning Bordihn, Henning Fernau:
Accepting Grammars and Systems: An Overview. Developments in Language Theory 1995: 199-208 - 1994
- [b1]Henning Fernau:
Iterierte Funktionen, Sprachen und Fraktale. Karlsruhe Institute of Technology, Germany, BI-Wiss.-Verlag 1994, ISBN 978-3-411-17011-1, pp. 1-288 - [j3]Henning Fernau:
Membership for 1-Limited ET0L Languages Is Not Decidable. J. Inf. Process. Cybern. 30(4): 191-211 (1994) - [c2]Henning Fernau, Ludwig Staiger:
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22 - 1993
- [j2]Henning Fernau:
Adult Languages of Propagating Systems with Restricted Parallelism. J. Inf. Process. Cybern. 29(5): 249-267 (1993) - [c1]Henning Fernau:
Remarks on Adult Languages of Propagating Systems with Restricted Parallelism. Developments in Language Theory 1993: 90-101 - 1991
- [j1]Henning Fernau:
On Function-limited Lindenmayer Systems. J. Inf. Process. Cybern. 27(1): 21-53 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
