Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Fernau
Person information
- affiliation: University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j158]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)- 2023
- [j157]Henning Fernau:
Editorial 2023: changes and invariants. Acta Informatica 60(4): 331-333 (2023) - [j156]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) - [j155]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) - [j154]Henning Fernau, Petra Wolf, Tomoyuki Yamakami:
Synchronizing deterministic push-down automata can be really hard. Inf. Comput. 295(Part B): 105089 (2023) - [j153]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) - [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] - [i43]Henning Fernau, Kshitij Gajjar:
Sum Labelling Graphs of Maximum Degree Two. CoRR abs/2301.02178 (2023) - [i42]Henning Fernau, Kevin Mann:
Hitting the Romans. CoRR abs/2302.11417 (2023) - [i41]Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf:
Defensive Alliances in Signed Networks. CoRR abs/2309.06801 (2023) - [i40]Henning Fernau, Kevin Mann:
Perfect Roman Domination and Unique Response Roman Domination. CoRR abs/2309.07018 (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]