| Publication | Date of Publication | Type |
|---|
| Hard problems on random graphs | 2026-03-18 | Paper |
| Pseudorandom finite models | 2026-02-27 | Paper |
| SAT backdoors: depth beats size | 2025-06-19 | Paper |
| Evaluating restricted first-order counting properties on nowhere dense classes and beyond | 2025-01-06 | Paper |
| Treelike decompositions for transductions of sparse graphs | 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 |
| Combinatorial and algorithmic aspects of monadic stability | 2024-09-11 | Paper |
| A logic-based algorithmic meta-theorem for mim-width | 2024-05-14 | Paper |
SAT backdoors: depth beats size
Journal of Computer and System Sciences | 2024-03-11 | Paper |
CSP beyond tractable constraint languages
Constraints | 2024-02-14 | Paper |
scientific article; zbMATH DE number 7788442 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| First-Order Model Checking on Monadically Stable Graph Classes | 2023-11-30 | Paper |
| Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size | 2023-10-31 | Paper |
Corrigendum to: ``Twin-width and generalized coloring numbers''
Discrete Mathematics | 2023-10-30 | Paper |
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
Logical Methods in Computer Science | 2023-08-26 | Paper |
First-Order Model-Checking in Random Graphs and Complex Networks
(available as arXiv preprint) | 2023-02-07 | Paper |
| First-Order Model Checking on Structurally Sparse Graph Classes | 2023-02-07 | Paper |
The complexity of packing edge-disjoint paths
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650219 (Why is no real title available?) | 2023-02-03 | Paper |
| Motif Counting in Preferential Attachment Graphs | 2023-02-03 | Paper |
| Combinatorial and Algorithmic Aspects of Monadic Stability | 2022-06-29 | Paper |
| Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes | 2022-06-28 | 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 |
Twin-width and generalized coloring numbers
Discrete Mathematics | 2022-01-13 | Paper |
Local structure theorems for Erdős-Rényi graphs and their algorithmic applications
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Complexity of independency and cliquy trees
Discrete Applied Mathematics | 2019-12-30 | Paper |
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
(available as arXiv preprint) | N/A | Paper |
