| No. |
Title |
Author |
Year |
| 1 |
Flipper Games for Monadically Stable Graph Classes |
Gajarský, Jakub et al. |
2023 |
| 2 |
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes |
Dreier, Jan et al. |
2023 |
| 3 |
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures |
Pilipczuk, Michał et al. |
2022 |
| 4 |
Combinatorial and Algorithmic Aspects of Monadic Stability |
Dreier, Jan et al. |
2022 |
| 5 |
First-Order Logic with Connectivity Operators |
Schirrmacher, Nicole et al. |
2022 |
| 6 |
PACE Solver Description: GraPA-JAVA |
Bergenthal, Moritz et al. |
2022 |
| 7 |
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) |
Král’, Daniel et al. |
2022 |
| 8 |
Structural Properties of the First-Order Transduction Quasiorder |
Nešetřil, Jaroslav et al. |
2022 |
| 9 |
PACE Solver Description: PACA-JAVA |
Dirks, Jona et al. |
2021 |
| 10 |
Recursive Backdoors for SAT |
Mählmann, Nikolas et al. |
2021 |
| 11 |
Elimination Distance to Bounded Degree on Planar Graphs |
Lindermayr, Alexander et al. |
2020 |
| 12 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets |
Lokshtanov, Daniel et al. |
2020 |
| 13 |
Algorithmic Properties of Sparse Digraphs |
Kreutzer, Stephan et al. |
2019 |
| 14 |
Progressive Algorithms for Domination and Independence |
Fabianski, Grzegorz et al. |
2019 |
| 15 |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness |
Nadara, Wojciech et al. |
2018 |
| 16 |
First-Order Interpretations of Bounded Expansion Classes |
Gajarský, Jakub et al. |
2018 |
| 17 |
Lossy Kernels for Connected Dominating Set on Sparse Graphs |
Eiben, Eduard et al. |
2018 |
| 18 |
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs |
Eickmeyer, Kord et al. |
2017 |
| 19 |
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs |
Kreutzer, Stephan et al. |
2017 |
| 20 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 21 |
The Generalised Colouring Numbers on Classes of Bounded Expansion |
Kreutzer, Stephan et al. |
2016 |
| 22 |
Graph Searching Games and Width Measures for Directed Graphs |
Akhoondian Amiri, Saeed et al. |
2015 |
| 23 |
Characterisations of Nowhere Dense Graphs (Invited Talk) |
Grohe, Martin et al. |
2013 |
