| Publication | Date of Publication | Type |
|---|
Model checking on interpretations of classes of bounded local cliquewidth
| 2024-12-06 | Paper |
Directed tangle tree-decompositions and applications
| 2024-07-19 | Paper |
Differential games, locality, and model checking for FO logic of graphs
| 2024-04-10 | Paper |
Excluding a planar matching minor in bipartite graphs
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Packing even directed circuits quarter-integrally
| 2023-11-28 | Paper |
scientific article; zbMATH DE number 7650941 (Why is no real title available?)
| 2023-02-07 | Paper |
Algorithmic properties of sparse digraphs
| 2022-07-18 | Paper |
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
| 2022-02-25 | Paper |
First-order interpretations of bounded expansion classes
| 2021-07-28 | Paper |
On zero-one and convergence laws for graphs embeddable on a fixed surface
| 2021-07-28 | Paper |
The Directed Flat Wall Theorem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
scientific article; zbMATH DE number 7297863 (Why is no real title available?)
| 2021-01-19 | Paper |
The canonical directed tree decomposition and its applications to the directed disjoint paths problem
| 2020-09-28 | Paper |
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Model-checking on ordered structures
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles
| 2020-07-23 | Paper |
Neighborhood complexity and kernelization for nowhere dense classes of graphs
| 2020-05-27 | Paper |
Current trends and new perspectives for first-order model checking (invited talk)
| 2020-05-26 | Paper |
Polynomial planar directed grid theorem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Routing with congestion in acyclic digraphs
Information Processing Letters | 2019-09-20 | Paper |
An excluded grid theorem for digraphs with forbidden minors
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Packing directed cycles through a specified vertex set
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Directed nowhere dense classes of graphs
| 2019-05-10 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Digraphs of bounded width
Springer Monographs in Mathematics | 2019-03-04 | Paper |
Coloring and covering nowhere dense graphs
SIAM Journal on Discrete Mathematics | 2018-10-31 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Deciding first-order properties of nowhere dense graphs
Journal of the ACM | 2018-05-17 | Paper |
Decomposition theorems and model-checking for the modal \(\mu\)-calculus
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 |
On Hanf-equivalence and the number of embeddings of small induced subgraphs
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 |
Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs
| 2018-04-19 | Paper |
The generalised colouring numbers on classes of bounded expansion
| 2018-03-21 | Paper |
scientific article; zbMATH DE number 6851840 (Why is no real title available?)
| 2018-03-21 | Paper |
Matching connectivity: on the structure of graphs with perfect matchings
| 2018-01-18 | Paper |
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Quantitative Monadic Second-Order Logic
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Model checking for successor-invariant first-order logic on minor-closed graph classes
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Majority colourings of digraphs
The Electronic Journal of Combinatorics | 2017-06-13 | Paper |
First-order and monadic second-order model-checking on ordered structures
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Characterisations of nowhere dense graphs (invited talk)
| 2017-02-21 | Paper |
Graph searching games and width measures for directed graphs
| 2017-01-24 | Paper |
DAG-width is PSPACE-complete
Theoretical Computer Science | 2016-11-29 | Paper |
Colouring and covering nowhere dense graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Complexity and monotonicity results for domination games
Theoretical Computer Science | 2016-04-13 | Paper |
The Erdos-Posa Property for Directed Graphs
| 2016-03-08 | Paper |
Graph operations on parity games and polynomial-time algorithms
Theoretical Computer Science | 2016-01-21 | Paper |
Directed elimination games
Discrete Applied Mathematics | 2015-12-10 | Paper |
Towards the graph minor theorems for directed graphs
Automata, Languages, and Programming | 2015-11-04 | Paper |
The directed grid theorem
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Deciding first-order properties of nowhere dense graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Digraph measures: Kelly decompositions, games, and orderings
| 2014-12-18 | Paper |
Directed Width Measures and Monotonicity of Directed Graph Searching
| 2014-08-20 | Paper |
Vertex disjoint paths in upward planar graphs
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Directed Nowhere Dense Classes of Graphs
| 2014-05-22 | Paper |
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Domination problems in nowhere-dense classes of graphs
| 2012-10-24 | Paper |
The dag-width of directed graphs
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
Linkless and flat embeddings in 3-space
Discrete \& Computational Geometry | 2012-05-22 | Paper |
On the parameterized intractability of monadic second-order logic
Logical Methods in Computer Science | 2012-04-03 | Paper |
Methods for algorithmic meta theorems
| 2012-03-02 | Paper |
Algorithmic meta-theorems
| 2011-10-05 | Paper |
Graph searching games
| 2011-10-05 | Paper |
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science | 2011-09-12 | Paper |
Operational semantics for fixed-point logics on constraint databases
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Non-regular fixed-point logics and games
| 2011-03-30 | Paper |
Extended computation tree logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
scientific article; zbMATH DE number 5764786 (Why is no real title available?)
| 2010-08-06 | Paper |
Once upon a time in the West. Determinacy, definability, and complexity of path games
| 2010-02-24 | Paper |
Distance \(d\)-domination games
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
On the Parameterised Intractability of Monadic Second-Order Logic
Computer Science Logic | 2009-11-12 | Paper |
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On Datalog vs. LFP
Automata, Languages and Programming | 2008-08-19 | Paper |
The complexity of independence-friendly fixpoint logic
| 2008-07-01 | Paper |
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science | 2008-06-24 | Paper |
Algorithmic Meta-theorems
Parameterized and Exact Computation | 2008-06-05 | Paper |
DAG-Width and Parity Games
STACS 2006 | 2008-03-19 | Paper |
Model Theory Makes Formulas Large
Automata, Languages and Programming | 2007-11-28 | Paper |
Boundedness of Monadic FO over Acyclic Structures
Automata, Languages and Programming | 2007-11-28 | Paper |
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science | 2007-07-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Backtracking games and inflationary fixed points
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
An Extension of Muchnik's Theorem
Journal Of Logic And Computation | 2005-04-29 | Paper |
Expressive equivalence of least and inflationary fixed-point logic
Annals of Pure and Applied Logic | 2004-11-18 | Paper |
scientific article; zbMATH DE number 2080477 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1948172 (Why is no real title available?)
| 2003-07-10 | Paper |
scientific article; zbMATH DE number 1841826 (Why is no real title available?)
| 2002-12-04 | Paper |
scientific article; zbMATH DE number 1424028 (Why is no real title available?)
| 2000-03-23 | Paper |
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
| N/A | Paper |
