| Publication | Date of Publication | Type |
|---|
| Treelike decompositions for transductions of sparse graphs | 2024-12-06 | Paper |
| Stable graphs of bounded twin-width | 2024-12-06 | Paper |
| Model checking on interpretations of classes of bounded local cliquewidth | 2024-12-06 | Paper |
| Indiscernibles and flatness in monadically stable and monadically NIP classes | 2024-11-14 | Paper |
| Flipper games for monadically stable graph classes | 2024-11-14 | Paper |
| Canonical decompositions in monadically stable and bounded shrubdepth graph classes | 2024-11-14 | Paper |
| Algorithms and data structures for first-order logic with connectivity under vertex failures | 2024-06-24 | Paper |
| Twin-width and types | 2024-06-24 | Paper |
| Twin-width IV: ordered graphs and matrices | 2023-12-08 | Paper |
| First-Order Model Checking on Monadically Stable Graph Classes | 2023-11-30 | Paper |
| Flipper games for monadically stable graph classes | 2023-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094127 | 2022-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090476 | 2022-07-18 | Paper |
| Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes | 2022-06-28 | Paper |
| Twin-width and types | 2022-06-16 | Paper |
| Model Checking on Interpretations of Classes of Bounded Local Cliquewidth | 2022-02-25 | Paper |
| Treelike decompositions for transductions of sparse graphs | 2022-01-26 | Paper |
| Algorithms and data structures for first-order logic with connectivity under vertex failures | 2021-11-05 | Paper |
| Nondeterministic and co-nondeterministic implies deterministic, for data languages | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002812 | 2021-07-28 | Paper |
| Stable graphs of bounded twin-width | 2021-07-08 | Paper |
| Ordered graphs of bounded twin-width | 2021-02-13 | Paper |
| Uniformisations of Regular Relations Over Bi-Infinite Words | 2021-01-21 | Paper |
| Register Automata with Extrema Constraints, and an Application to Two-Variable Logic | 2021-01-21 | Paper |
| On computability and tractability for infinite sets | 2021-01-20 | Paper |
| On the number of types in sparse graphs | 2021-01-20 | Paper |
| Parameterized circuit complexity of model-checking on sparse structures | 2021-01-20 | Paper |
| First-Order Interpretations of Bounded Expansion Classes | 2020-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207051 | 2020-01-03 | Paper |
| Progressive Algorithms for Domination and Independence | 2018-11-16 | Paper |
| Entropy Bounds for Conjunctive Queries with Functional Dependencies | 2018-07-18 | Paper |
| Turing machines with atoms, constraint satisfaction problems, and descriptive complexity | 2018-04-23 | Paper |
| Locally Finite Constraint Satisfaction Problems | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636561 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601873 | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601881 | 2018-01-24 | Paper |
| LOIS: syntax and semantics | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278397 | 2017-07-19 | Paper |
| Non-Homogenizable Classes of Finite Structures | 2017-07-19 | Paper |
| Turing Machines with Atoms | 2017-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957477 | 2017-01-26 | Paper |
| On ultralimits of sparse graph classes | 2016-05-20 | Paper |
| Ramsey's theorem for colors from a metric space | 2012-11-08 | Paper |
| Languages of Profinite Words and the Limitedness Problem | 2012-11-01 | Paper |
| Deterministic automata and extensions of weak MSO | 2012-10-24 | Paper |
| Weak \(\text{MSO}+U\) over infinite trees | 2012-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113674 | 2012-01-23 | Paper |
| Energy and Mean-Payoff Games with Imperfect Information | 2010-09-03 | Paper |
| On the Topological Complexity of MSO+U and Related Automata Models | 2010-09-03 | Paper |
| Flip-width: Cops and Robber on dense graphs | N/A | Paper |
| Elementary first-order model checking for sparse graphs | N/A | Paper |
| Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes | N/A | Paper |
