| Publication | Date of Publication | Type |
|---|
| Structurally tractable graph classes (invited talk) | 2025-11-10 | Paper |
| Flip-width: cops and robber on dense graphs | 2025-08-15 | Paper |
| Elementary first-order model checking for sparse graphs | 2025-06-18 | Paper |
Twin-width. IV: Ordered graphs and matrices
Journal of the ACM | 2025-02-06 | Paper |
| 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
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 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 |
scientific article; zbMATH DE number 7566055 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7566055 (Why is no real title available?) | 2022-08-02 | Paper |
Progressive algorithms for domination and independence
(available as arXiv preprint) | 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 |
| First-order interpretations of bounded expansion classes | 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
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
On computability and tractability for infinite sets
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
On the number of types in sparse graphs
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Parameterized circuit complexity of model-checking on sparse structures
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
scientific article; zbMATH DE number 7147443 (Why is no real title available?)
(available as arXiv preprint) | 2020-01-03 | Paper |
Progressive Algorithms for Domination and Independence
(available as arXiv preprint) | 2018-11-16 | Paper |
Entropy bounds for conjunctive queries with functional dependencies
(available as arXiv preprint) | 2018-07-18 | Paper |
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Locally finite constraint satisfaction problems
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6862042 (Why is no real title available?) | 2018-04-19 | Paper |
scientific article; zbMATH DE number 6829362 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-24 | Paper |
| Cost functions definable by min/max automata | 2018-01-24 | Paper |
LOIS: syntax and semantics
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
| Models of \(\lambda\)-calculus and the weak MSO logic | 2017-07-19 | Paper |
Non-homogenizable classes of finite structures
(available as arXiv preprint) | 2017-07-19 | Paper |
Turing machines with atoms
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Imperative programming in sets with atoms | 2017-01-26 | Paper |
On ultralimits of sparse graph classes
The Electronic Journal of Combinatorics | 2016-05-20 | Paper |
On ultralimits of sparse graph classes
The Electronic Journal of Combinatorics | 2016-05-20 | Paper |
Ramsey's theorem for colors from a metric space
Semigroup Forum | 2012-11-08 | Paper |
Languages of profinite words and the limitedness problem
Automata, Languages, and Programming | 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 |
| Automata based verification over linearly ordered data domains | 2012-01-23 | Paper |
Energy and mean-payoff games with imperfect information
Computer Science Logic | 2010-09-03 | Paper |
On the topological complexity of MSO+U and related automata models
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Flip-width: Cops and Robber on dense graphs
(available as arXiv preprint) | N/A | Paper |
Elementary first-order model checking for sparse graphs
(available as arXiv preprint) | N/A | Paper |
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
(available as arXiv preprint) | N/A | Paper |
