| Publication | Date of Publication | Type |
|---|
| On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing | 2024-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147351 | 2024-01-15 | Paper |
| Connected search for a lazy robber | 2023-10-04 | Paper |
| Faster Property Testers in a Variation of the Bounded Degree Model | 2023-07-18 | Paper |
| GSF-locality is not sufficient for proximity-oblivious testing | 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 | 2022-06-08 | Paper |
| Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs | 2022-03-24 | Paper |
| On the tree-width of even-hole-free graphs | 2021-09-02 | Paper |
| Property Testing for Bounded Degree Databases | 2020-08-05 | Paper |
| Vapnik-Chervonenkis Dimension and Density on Johnson and Hamming Graphs | 2020-07-31 | Paper |
| A lower bound on the tree-width of graphs with irrelevant vertices | 2019-07-17 | Paper |
| On rank-width of even-hole-free graphs | 2018-11-30 | Paper |
| Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm | 2017-05-11 | Paper |
| Irrelevant vertices for the planar disjoint paths problem | 2016-11-25 | Paper |
| Planar disjoint-paths completion | 2016-10-21 | Paper |
| Linear Rank-Width of Distance-Hereditary Graphs | 2015-09-09 | Paper |
| Linear rank-width and linear clique-width of trees | 2015-06-01 | Paper |
| Obstructions for linear rank-width at most 1 | 2014-04-02 | Paper |
| Interpreting nowhere dense graph classes as a classical notion of model theory | 2014-03-25 | Paper |
| Linear Rank-Width and Linear Clique-Width of Trees | 2013-12-06 | Paper |
| Hypertree-depth and minors in hypergraphs | 2013-01-07 | Paper |
| Fast minor testing in planar graphs | 2012-11-21 | Paper |
| Planar Disjoint-Paths Completion | 2012-06-15 | Paper |
| Tree-width for first order formulae | 2012-04-03 | Paper |
| Faster parameterized algorithms for minor containment | 2011-12-07 | Paper |
| Tight Bounds for Linkages in Planar Graphs | 2011-07-06 | Paper |
| On the Boolean-Width of a Graph: Structure and Applications | 2010-11-16 | Paper |
| Fast Minor Testing in Planar Graphs | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579375 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576650 | 2010-07-30 | Paper |
| Faster Parameterized Algorithms for Minor Containment | 2010-06-22 | Paper |
| Tree-Width for First Order Formulae | 2009-11-12 | Paper |
| Tree-Related Widths of Graphs and Hypergraphs | 2009-03-16 | Paper |
| Hypertree width and related hypergraph invariants | 2007-11-21 | Paper |
| Directed tree-width examples | 2007-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5469338 | 2006-05-18 | Paper |
| Marshals, monotone marshals, and hypertree-width | 2005-02-16 | Paper |
| Monotonicity of the cops and robber game for bounded depth treewidth | N/A | Paper |
