| Publication | Date of Publication | Type |
|---|
Monotonicity of the cops and robber game for bounded depth treewidth
(available as arXiv preprint) | N/A | Paper |
Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Logical Methods in Computer Science | 2026-08-04 | Paper |
| Monotonicity of the cops and robber game for bounded depth treewidth | 2026-05-12 | Paper |
| Faster property testers in a variation of the bounded degree model | 2026-03-23 | Paper |
On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing
SIAM Journal on Computing | 2024-07-17 | Paper |
scientific article; zbMATH DE number 7788434 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Connected search for a lazy robber
Journal of Graph Theory | 2023-10-04 | Paper |
Faster Property Testers in a Variation of the Bounded Degree Model
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
GSF-locality is not sufficient for proximity-oblivious testing
(available as arXiv preprint) | 2023-07-12 | Paper |
| On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing | 2023-04-07 | Paper |
| Connected Search for a Lazy Robber | 2023-02-03 | Paper |
An explicit construction of graphs of bounded degree that are far from being Hamiltonian
Discrete Mathematics & Theoretical Computer Science | 2022-06-08 | Paper |
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
Discrete Applied Mathematics | 2022-03-24 | Paper |
On the tree-width of even-hole-free graphs
European Journal of Combinatorics | 2021-09-02 | Paper |
| Property testing for bounded degree databases | 2020-08-05 | Paper |
Vapnik-Chervonenkis Dimension and Density on Johnson and Hamming Graphs
(available as arXiv preprint) | 2020-07-31 | Paper |
A lower bound on the tree-width of graphs with irrelevant vertices
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
A lower bound on the tree-width of graphs with irrelevant vertices
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
On rank-width of (diamond, even-hole)-free graphs
(available as arXiv preprint) | 2018-11-30 | Paper |
| On rank-width of (diamond, even-hole)-free graphs | 2018-11-30 | Paper |
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
Algorithmica | 2017-05-11 | Paper |
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
Algorithmica | 2017-05-11 | Paper |
Irrelevant vertices for the planar disjoint paths problem
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Planar disjoint-paths completion
Algorithmica | 2016-10-21 | Paper |
Linear rank-width of distance-hereditary graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Linear rank-width and linear clique-width of trees
Theoretical Computer Science | 2015-06-01 | Paper |
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics | 2014-04-02 | Paper |
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics | 2014-04-02 | Paper |
Interpreting nowhere dense graph classes as a classical notion of model theory
European Journal of Combinatorics | 2014-03-25 | Paper |
Linear rank-width and linear clique-width of trees
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Hypertree-depth and minors in hypergraphs
Theoretical Computer Science | 2013-01-07 | Paper |
Fast minor testing in planar graphs
Algorithmica | 2012-11-21 | Paper |
Planar disjoint-paths completion
Parameterized and Exact Computation | 2012-06-15 | Paper |
Tree-width for first order formulae
Logical Methods in Computer Science | 2012-04-03 | Paper |
Faster parameterized algorithms for minor containment
Theoretical Computer Science | 2011-12-07 | Paper |
Tight bounds for linkages in planar graphs
Automata, Languages and Programming | 2011-07-06 | Paper |
On the Boolean-width of a graph: structure and applications
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Fast minor testing in planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764786 (Why is no real title available?) | 2010-08-06 | Paper |
| Hypertree-width and related hypergraph invariants | 2010-07-30 | Paper |
Faster parameterized algorithms for minor containment
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Tree-Width for First Order Formulae
Computer Science Logic | 2009-11-12 | Paper |
Tree-Related Widths of Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Hypertree width and related hypergraph invariants
European Journal of Combinatorics | 2007-11-21 | Paper |
Directed tree-width examples
Journal of Combinatorial Theory. Series B | 2007-08-20 | Paper |
| Width functions for hypertree decompositions | 2006-05-18 | Paper |
Marshals, monotone marshals, and hypertree-width
Journal of Graph Theory | 2005-02-16 | Paper |
