Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen

Univ.-Prof. Dr. Henning Fernau

Informatikwissenschaften, Universität Trier

Publikationen
Ergebnisse pro Seite:  100

Casel, Katrin; Fernau, Henning; Grigoriev, Alexander et al.

Combinatorial Properties and Recognition of Unit Square Visibility Graphs.

Discret. Comput. Geom. Bd. 69. H. 4. 2023 S. 937 - 980



Vu, Martin; Fernau, Henning

Insertion-Deletion with Substitutions II: About the Role of One-Sided Context.

J. Autom. Lang. Comb. Bd. 28. H. 1-3. 2023 S. 221 - 244


Fernau, Henning; Foucaud, Florent; Mann, Kevin et al.

Parameterizing Path Partitions.

CIAC. 2023 S. 187 - 201


Fernau, Henning; V. Volkov, Mikhail

Preface of the Special Issue Dedicated to Selected Papers from CSR 2020.

Theory Comput. Syst. Bd. 67. H. 2. 2023 S. 219 - 220


N. Abu-Khzam, Faisal; Fernau, Henning; Mann, Kevin

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes.

MFCS. 2023 S. 6:1 - 6:15


Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.

Synchronization and Diversity of Solutions.

AAAI. 2023 S. 11516 - 11524



N. Abu-Khzam, Faisal; Fernau, Henning; Gras, Benjamin et al.

Enumerating Minimal Connected Dominating Sets.

ESA. 2022 S. 1:1 - 1:15


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Improved descriptional complexity results on generalized forbidding grammars.

Discret. Appl. Math. Bd. 319. 2022 S. 2 - 18


Vu, Martin; Fernau, Henning

Insertion-deletion systems with substitutions I.

Comput. Bd. 11. H. 1. 2022 S. 57 - 83


N. Abu-Khzam, Faisal; Fernau, Henning; Mann, Kevin

Minimal Roman Dominating Functions: Extensions and Enumeration.

WG. 2022 S. 1 - 15


Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.

On the complexity of solution extension of optimization problems.

Theor. Comput. Sci. Bd. 904. 2022 S. 48 - 65


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the computational completeness of matrix simple semi-conditional grammars.

Inf. Comput. Bd. 284. 2022 S. 104688


Fernau, Henning; Holzer, Markus; Wolf, Petra

Preface to Klaus-Jörn Lange Festschrift.

Acta Informatica. Bd. 59. H. 4. 2022 S. 285 - 287


Diekert, Volker; Fernau, Henning; Wolf, Petra

Properties of graphs specified by a regular language.

Acta Informatica. Bd. 59. H. 4. 2022 S. 357 - 385


Fernau, Henning

Special Issue "Selected Algorithmic Papers From CSR 2020".

Algorithms. Bd. 15. H. 11. 2022 S. 426


Fernau, Henning; Bruchertseifer, Jens

Synchronizing words and monoid factorization, yielding a new parameterized complexity class?

Math. Struct. Comput. Sci. Bd. 32. H. 2. 2022 S. 189 - 215


Fernau, Henning; Haase, Carolina; Hoffmann, Stefan

The Synchronization Game on Subclasses of Automata.

FUN. 2022 S. 14:1 - 14:17


Banyassady, Bahareh; de Berg, Mark; Bringmann, Karl et al.

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.

SoCG. 2022 S. 12:1 - 12:16


Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.

Abundant Extensions.

CIAC. 2021 S. 3 - 17


Vu, Martin; Fernau, Henning

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.

SOFSEM. 2021 S. 577 - 592


Vu, Martin; Fernau, Henning

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.

Algorithms. Bd. 14. H. 5. 2021 S. 131


Monnot, Jérôme; Fernau, Henning; F. Manlove, David

Algorithmic aspects of upper edge domination.

Theor. Comput. Sci. Bd. 877. 2021 S. 46 - 57


Arrighi, Emmanuel; Fernau, Henning; Lokshtanov, Daniel et al.

Diversity in Kemeny Rank Aggregation: A Parameterized Approach.

IJCAI. 2021 S. 10 - 16


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars.

Fundam. Informaticae. Bd. 181. H. 2-3. 2021 S. 189 - 211


Fernau, Henning; T. Huber, Katharina; (Seffi) Naor, Joseph

Invited Talks.

CIAC. 2021 S. 3 - 19


Arrighi, Emmanuel; Fernau, Henning; Hoffmann, Stefan et al.

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

FSTTCS. 2021 S. 34:1 - 34:15


Casel, Katrin; Fernau, Henning; Gaspers, Serge et al.

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.

Theory Comput. Syst. Bd. 65. H. 2. 2021 S. 344 - 409


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the generative capacity of matrix insertion-deletion systems of small sum-norm.

Nat. Comput. Bd. 20. H. 4. 2021 S. 671 - 689


Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.

Order Reconfiguration Under Width Constraints.

MFCS. 2021 S. 8:1 - 8:15


Fernau, Henning

Parsimonious Computational Completeness.

DLT. 2021 S. 12 - 26


Fernau, Henning; Malcher, Andreas; Pighizzini, Giovanni

Preface to Martin Kutrib Festschrift.

Acta Informatica. Bd. 58. H. 4. 2021 S. 241 - 242


Diekert, Volker; Fernau, Henning; Wolf, Petra

Properties of Graphs Specified by a Regular Language.

DLT. 2021 S. 117 - 129


Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias

Self-Verifying Pushdown and Queue Automata.

Fundam. Informaticae. Bd. 180. H. 1-2. 2021 S. 1 - 28


Bruchertseifer, Jens; Fernau, Henning

Synchronizing series-parallel deterministic finite automata with loops and related problems.

RAIRO Theor. Informatics Appl. Bd. 55. 2021 S. 7


Fernau, Henning; Gajjar, Kshitij

The Space Complexity of Sum Labelling.

FCT. 2021 S. 230 - 244


Casel, Katrin; Dreier, Jan; Fernau, Henning et al.

Complexity of independency and cliquy trees.

Discret. Appl. Math. Bd. 272. 2020 S. 2 - 15



Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.

Diminishable parameterized problems and strict polynomial kernelization.

Comput. Bd. 9. H. 1. 2020 S. 1 - 24


Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability.

Discret. Appl. Math. Bd. 280. 2020 S. 23 - 42


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective.

Int. Conf. on Membrane Computing. 2020 S. 31 - 45


Vu, Martin; Fernau, Henning

Insertion-Deletion Systems with Substitutions I.

CiE. 2020 S. 366 - 378


Vu, Martin; Fernau, Henning

Insertion-Deletion with Substitutions II.

DCFS. 2020 S. 231 - 243


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the Power of Generalized Forbidding Insertion-Deletion Systems.

DCFS. 2020 S. 52 - 63


N. Abu-Khzam, Faisal; Bazgan, Cristina; Fernau, Henning

Parameterized Dynamic Variants of Red-Blue Dominating Set.

SOFSEM. 2020 S. 236 - 247


Fernau, Henning; Manea, Florin; Mercas, Robert et al.

Pattern Matching with Variables: Efficient Algorithms and Complexity Results.

ACM Trans. Comput. Theory. Bd. 12. H. 1. 2020 S. 6:1 - 6:37


Fernau, Henning; Wolf, Petra

Synchronization of Deterministic Visibly Push-Down Automata.

FSTTCS. 2020 S. 45:1 - 45:15


Fernau, Henning; Wolf, Petra; Yamakami, Tomoyuki

Synchronizing Deterministic Push-Down Automata Can Be Really Hard.

MFCS. 2020 S. 33:1 - 33:15


Bruchertseifer, Jens; Fernau, Henning

Synchronizing Words and Monoid Factorization: A Parameterized Perspective.

TAMC. 2020 S. 352 - 364


Arrighi, Emmanuel; Fernau, Henning; de Oliveira Oliveira, Mateus et al.

Width Notions for Ordering-Related Problems.

FSTTCS. 2020 S. 9:1 - 9:18


Bazgan, Cristina; Fernau, Henning; Tuza, Zsolt

Aspects of upper defensive alliances.

Discret. Appl. Math. Bd. 266. 2019 S. 111 - 120


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1).

Nat. Comput. Bd. 18. H. 3. 2019 S. 563 - 577


Fernau, Henning; V. Gusev, Vladimir; Hoffmann, Stefan et al.

Computational Complexity of Synchronization under Regular Constraints.

MFCS. 2019 S. 63:1 - 63:14


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Descriptional Complexity of Matrix Simple Semi-conditional Grammars.

DCFS. 2019 S. 111 - 123


Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.

FCT. 2019 S. 185 - 200


Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.

Extension of Vertex Cover and Independent Set in Some Classes of Graphs.

CIAC. 2019 S. 124 - 136


Fernau, Henning; Hoffmann, Stefan

Extensions to Minimal Synchronizing Words.

J. Autom. Lang. Comb. Bd. 24. H. 2-4. 2019 S. 287 - 307


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Improved Descriptional Complexity Results on Generalized Forbidding Grammars.

CALDAM. 2019 S. 174 - 188


Chen, Jianer; Fernau, Henning; Shaw, Peter et al.

Kernels for packing and covering problems.

Theor. Comput. Sci. Bd. 790. 2019 S. 152 - 166


Fernau, Henning

Modern Aspects of Complexity Within Formal Languages.

LATA. 2019 S. 3 - 30


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On Matrix Ins-Del Systems of Small Sum-Norm.

SOFSEM. 2019 S. 192 - 205


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On path-controlled insertion-deletion systems.

Acta Informatica. Bd. 56. H. 1. 2019 S. 35 - 59


Fernau, Henning; Stege, Ulrike

Profit Parameterizations of Dominating Set.

AAIM. 2019 S. 108 - 120


Fernau, Henning; Vu, Martin

Regulated Tree Automata.

DCFS. 2019 S. 124 - 136


Bruchertseifer, Jens; Fernau, Henning

Synchronizing series-parallel automata with loops.

NCMA. 2019 S. 63 - 78


N. Abu-Khzam, Faisal; Bazgan, Cristina; Casel, Katrin et al.

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework.

Algorithmica. Bd. 80. H. 9. 2018 S. 2517 - 2550


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems.

UCNC. 2018 S. 86 - 100


Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.

Diminishable Parameterized Problems and Strict Polynomial Kernelization.

CiE. 2018 S. 161 - 171


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Investigations on the power of matrix insertion-deletion systems with small sizes.

Natural Computing. Bd. 17. H. 2. 2018 S. 249 - 269


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.

MCU. 2018 S. 88 - 104


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus

New Nonterminal Complexity Results for Semi-conditional Grammars.

CiE. 2018 S. 172 - 182


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.

RAIRO - Theor. Inf. and Applic. Bd. 52. H. 1. 2018 S. 1 - 21


Fernau, Henning; A. Rodríguez-Velázquez, Juan

On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results.

Discrete Applied Mathematics. Bd. 236. 2018 S. 183 - 202


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Properties of Language Classes Between Linear and Context-Free.

Journal of Automata, Languages and Combinatorics. Bd. 23. H. 4. 2018 S. 329 - 360


Fernau, Henning; Manea, Florin; Mercas, Robert et al.

Revisiting Shinohara's algorithm for computing descriptive patterns.

Theor. Comput. Sci. Bd. 733. 2018 S. 44 - 54


Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.

Simple picture processing based on finite automata and regular grammars.

J. Comput. Syst. Sci. Bd. 95. 2018 S. 232 - 258


N. Abu-Khzam, Faisal; Fernau, Henning; Uehara, Ryuhei

Special Issue on Reconfiguration Problems.

Algorithms. Bd. 11. H. 11. 2018 S. 187


Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.

The many facets of upper domination.

Theor. Comput. Sci. Bd. 717. 2018 S. 2 - 25


Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.

Characterization and complexity results on jumping finite automata.

Theor. Comput. Sci. Bd. 679. 2017 S. 31 - 52


Casel, Katrin; Fernau, Henning; Grigoriev, Alexander et al.

Combinatorial Properties and Recognition of Unit Square Visibility Graphs.

MFCS. 2017 S. 30:1 - 30:15


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.

CIAA. 2017 S. 89 - 100


Alhazov, Artiom; Fernau, Henning; Freund, Rudolf et al.

Contextual array grammars with matrix control, regular control languages, and tissue P systems control.

Theor. Comput. Sci. Bd. 682. 2017 S. 5 - 21


Fernau, Henning

Extremal Kernelization: A Commemorative Paper.

IWOCA. 2017 S. 24 - 36


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.

DCFS. 2017 S. 128 - 139


Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.

Fundam. Inform. Bd. 155. H. 1-2. 2017 S. 209 - 232


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.

Theor. Comput. Sci. Bd. 682. 2017 S. 100 - 121


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.

Journal of Automata, Languages and Combinatorics. Bd. 22. H. 1-3. 2017 S. 61 - 92


Fernau, Henning; Kuppusamy, Lakshmanan

Parikh Images of Matrix Ins-Del Systems.

TAMC. 2017 S. 201 - 215


Fernau, Henning; Krebs, Andreas

Problems on Finite Automata and the Exponential Time Hypothesis.

Algorithms. Bd. 10. H. 1. 2017 S. 24


Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.

Regular grammars for array languages.

NCMA. 2017 S. 119 - 134


Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias

Self-verifying pushdown automata.

NCMA. 2017 S. 103 - 117


Fernau, Henning; Kuppusamy, Lakshmanan; Verlan, Sergey

Universal Matrix Insertion Grammars with Small Size.

UCNC. 2017 S. 182 - 193


Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

AAIM. 2016 S. 113 - 124


Fernau, Henning

An Essay on General Grammars.

Journal of Automata, Languages and Combinatorics. Bd. 21. H. 1-2. 2016 S. 69 - 92


N. Abu-Khzam, Faisal; Bazgan, Cristina; Casel, Katrin et al.

Building Clusters with Lower-Bounded Sizes.

ISAAC. 2016 S. 4:1 - 4:13


Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.

Contextual Array Grammars with Matrix and Regular Control.

DCFS. 2016 S. 98 - 110


N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.

Data reductions and combinatorial bounds for improved approximation algorithms.

J. Comput. Syst. Sci. Bd. 82. H. 3. 2016 S. 503 - 520


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.

DCFS. 2016 S. 111 - 125


Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.

Diminishable Parameterized Problems and Strict Polynomial Kernelization.

CoRR. Bd. abs/1611.03739. 2016