| No. |
Title |
Author |
Year |
| 1 |
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes |
Ohlmann, Pierre et al. |
2023 |
| 2 |
Flipper Games for Monadically Stable Graph Classes |
Gajarský, Jakub et al. |
2023 |
| 3 |
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes |
Dreier, Jan et al. |
2023 |
| 4 |
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures |
Pilipczuk, Michał et al. |
2022 |
| 5 |
Twin-Width and Types |
Gajarský, Jakub et al. |
2022 |
| 6 |
Progressive Algorithms for Domination and Independence |
Fabianski, Grzegorz et al. |
2019 |
| 7 |
First-Order Interpretations of Bounded Expansion Classes |
Gajarský, Jakub et al. |
2018 |
| 8 |
Entropy Bounds for Conjunctive Queries with Functional Dependencies |
Gogacz, Tomasz et al. |
2017 |
| 9 |
Cost Functions Definable by Min/Max Automata |
Colcombet, Thomas et al. |
2016 |
| 10 |
Homomorphism Problems for First-Order Definable Structures |
Klin, Bartek et al. |
2016 |
| 11 |
Models of Lambda-Calculus and the Weak MSO Logic |
Parys, Pawel et al. |
2016 |
| 12 |
Non-Homogenizable Classes of Finite Structures |
Atserias, Albert et al. |
2016 |
| 13 |
The MSO+U Theory of (N,<) Is Undecidable |
Bojanczyk, Mikolaj et al. |
2016 |
| 14 |
Imperative Programming in Sets with Atoms |
Bojanczyk, Mikolaj et al. |
2012 |
| 15 |
Weak MSO+U over infinite trees |
Bojanczyk, Mikolaj et al. |
2012 |
| 16 |
Automata based verification over linearly ordered data domains |
Segoufin, Luc et al. |
2011 |
| 17 |
Deterministic Automata and Extensions of Weak MSO |
Bojanczyk, Mikolaj et al. |
2009 |
