Our research covers many aspects of Theoretical Computer Science, focussing on: efficient graph algorithms, parameterized algorithms and complexity, approximation algorithms and complexity, formal languages and grammar induction.

A good first impression is obtained by browsing through our publications.

In the following, you can find a list of papers of members of our research group of this year. Regarding previous years, we refer to the menu to the left. For complete lists of publications, we refer to the homepages of each of the group members.

Accepted for publication in journals:

• Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides. Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discrete & Computational Geometry

• Martin Vu, Henning Fernau. Insertion-Deletion With Substitutions II: About The Role of One-Sided Context. Journal of Automata, Languages and Combinatorics

• Henning Fernau, Kshitij Gajjar. The Space Complexity of Sum Labelling.Theory of Computing Systems

Accepted for publication in conferences:

• Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf. Synchronization and Diversity of Solutions. AAAI 2023

• Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao. Parameterizing Path Partitions. CIAC 2023

Further recent publications