| Publication | Date of Publication | Type |
|---|
Classes of intersection digraphs with good algorithmic properties
Journal of Graph Theory | 2024-03-25 | Paper |
Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
| Three problems on well-partitioned chordal graphs | 2023-03-22 | Paper |
Well-partitioned chordal graphs: obstruction set and disjoint paths
(available as arXiv preprint) | 2022-12-21 | Paper |
The grid theorem for vertex-minors
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
| Measuring what matters: a hybrid approach to dynamic programming with treewidth | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559376 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Lean Tree-Cut Decompositions: Obstructions and Algorithms | 2022-07-18 | Paper |
Well-partitioned chordal graphs
Discrete Mathematics | 2022-06-14 | Paper |
Rainbow independent sets on dense graph classes
Discrete Applied Mathematics | 2022-03-24 | Paper |
Tree pivot-minors and linear rank-width
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
A system of disjoint representatives of line segments with given \(k\) directions
Discrete Mathematics | 2021-09-30 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2021-08-04 | Paper |
Measuring what matters: a hybrid approach to dynamic programming with treewidth
Journal of Computer and System Sciences | 2021-07-06 | Paper |
A polynomial kernel for distance-hereditary vertex deletion
Algorithmica | 2021-06-30 | Paper |
Obstructions for bounded shrub-depth and rank-depth
Journal of Combinatorial Theory. Series B | 2021-06-18 | Paper |
Packing and covering induced subdivisions
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
A Menger-like property of tree-cut width
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Branch-depth: generalizing tree-depth of graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
The Directed Flat Wall Theorem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Erdős-Pósa property of chordless cycles and its applications
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Graphs without two vertex-disjoint \(S\)-cycles
Discrete Mathematics | 2020-08-12 | Paper |
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
(available as arXiv preprint) | 2020-08-05 | Paper |
Neighborhood complexity and kernelization for nowhere dense classes of graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width
(available as arXiv preprint) | 2020-05-27 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2020-05-27 | Paper |
Mim-width. I. Induced path problems
Discrete Applied Mathematics | 2020-04-21 | Paper |
Scattered classes of graphs
SIAM Journal on Discrete Mathematics | 2020-04-07 | Paper |
Mim-width. II. The feedback vertex set problem
Algorithmica | 2020-01-16 | Paper |
Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
On low rank-width colorings
European Journal of Combinatorics | 2019-11-28 | Paper |
Mim-width. III. Graph powers and generalized distance domination problems
Theoretical Computer Science | 2019-11-13 | Paper |
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
Algorithmica | 2019-09-10 | Paper |
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
Algorithmica | 2019-09-10 | Paper |
Digraphs of bounded width
Springer Monographs in Mathematics | 2019-03-04 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
European Journal of Combinatorics | 2018-09-07 | Paper |
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Journal of Computer and System Sciences | 2018-09-07 | Paper |
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Journal of Computer and System Sciences | 2018-09-07 | Paper |
| A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | 2018-03-21 | Paper |
| Erdős-Pósa property of chordless cycles and its applications | 2018-03-15 | Paper |
Erdős-Pósa property of chordless cycles and its applications
(available as arXiv preprint) | 2018-03-15 | Paper |
On low rank-width colorings
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
Algorithmica | 2017-10-10 | Paper |
A polynomial kernel for block graph deletion
Algorithmica | 2017-10-10 | Paper |
A polynomial kernel for block graph deletion
Algorithmica | 2017-10-10 | Paper |
| A polynomial kernel for block graph deletion | 2017-09-29 | Paper |
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
(available as arXiv preprint) | 2017-09-29 | Paper |
A polynomial kernel for distance-hereditary vertex deletion
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Packing and covering immersion-expansions of planar sub-cubic graphs
European Journal of Combinatorics | 2017-08-31 | Paper |
Packing and covering immersion-expansions of planar sub-cubic graphs
European Journal of Combinatorics | 2017-08-31 | 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 |
| Excluded vertex-minors for graphs of linear rank-width at most \(k\). | 2017-01-30 | Paper |
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
Journal of Combinatorial Theory. Series B | 2017-01-26 | Paper |
Packing and covering immersion models of planar subcubic graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Parameterized vertex deletion problems for hereditary graph classes with a block property
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Parameterized vertex deletion problems for hereditary graph classes with a block property
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Linear rank-width of distance-hereditary graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Unavoidable vertex-minors in large prime graphs
European Journal of Combinatorics | 2014-09-02 | Paper |
Excluded vertex-minors for graphs of linear rank-width at most \(k\)
European Journal of Combinatorics | 2014-09-02 | Paper |
Graphs of small rank-width are pivot-minors of graphs of small tree-width
Discrete Applied Mathematics | 2014-04-02 | Paper |
