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:  25

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