| No. |
Title |
Author |
Year |
| 1 |
Enumerating Minimal Connected Dominating Sets |
Abu-Khzam, Faisal N. et al. |
2022 |
| 2 |
The Synchronization Game on Subclasses of Automata |
Fernau, Henning et al. |
2022 |
| 3 |
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds |
Banyassady, Bahareh et al. |
2022 |
| 4 |
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes |
Arrighi, Emmanuel et al. |
2021 |
| 5 |
Order Reconfiguration Under Width Constraints |
Arrighi, Emmanuel et al. |
2021 |
| 6 |
Synchronization of Deterministic Visibly Push-Down Automata |
Fernau, Henning et al. |
2020 |
| 7 |
Synchronizing Deterministic Push-Down Automata Can Be Really Hard |
Fernau, Henning et al. |
2020 |
| 8 |
Width Notions for Ordering-Related Problems |
Arrighi, Emmanuel et al. |
2020 |
| 9 |
Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421) |
Fernau, Henning et al. |
2019 |
| 10 |
Computational Complexity of Synchronization under Regular Constraints |
Fernau, Henning et al. |
2019 |
| 11 |
Combinatorial Properties and Recognition of Unit Square Visibility Graphs |
Casel, Katrin et al. |
2017 |
| 12 |
Building Clusters with Lower-Bounded Sizes |
Abu-Khzam, Faisal et al. |
2016 |
| 13 |
On the Complexity of Grammar-Based Compression over Fixed Alphabets |
Casel, Katrin et al. |
2016 |
| 14 |
Pattern Matching with Variables: Fast Algorithms and New Hardness Results |
Fernau, Henning et al. |
2015 |
| 15 |
On the Parameterised Complexity of String Morphism Problems |
Fernau, Henning et al. |
2013 |
| 16 |
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves |
Fernau, Henning et al. |
2009 |
| 17 |
An Optimal Construction of Finite Automata from Regular Expressions |
Gulan, Stefan et al. |
2008 |
| 18 |
Exact Elimination of Cycles in Graphs |
Raible, Daniel et al. |
2007 |
