| Publication | Date of Publication | Type |
|---|
The excluded minors for the class of spike minors
Advances in Applied Mathematics | 2026-04-13 | Paper |
Clonal cores and flexipaths in matroids
SIAM Journal on Discrete Mathematics | 2026-03-11 | Paper |
Detachable pairs in 3-connected matroids and simple 3-connected graphs
Journal of Combinatorial Theory. Series B | 2026-02-09 | Paper |
Comparing width parameters on graph classes
European Journal of Combinatorics | 2025-06-02 | Paper |
What is a 4-connected matroid?
The Electronic Journal of Combinatorics | 2025-05-06 | Paper |
The excluded minors for GF(5)-representable matroids on ten elements
Advances in Applied Mathematics | 2025-03-21 | Paper |
Computing subset vertex covers in H-free graphs
Theoretical Computer Science | 2025-02-26 | Paper |
Computing excluded minors for classes of matroids representable over partial fields
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Solving problems on generalized convex graphs via mim-width
Journal of Computer and System Sciences | 2024-01-04 | Paper |
| Bounding the Mim-Width of Hereditary Graph Classes. | 2023-11-13 | Paper |
| What is a 4-connected matroid? | 2023-10-12 | Paper |
Bounding the mim‐width of hereditary graph classes
Journal of Graph Theory | 2023-10-04 | Paper |
Excluded minors are almost fragile. II: Essential elements
Journal of Combinatorial Theory. Series B | 2023-09-19 | Paper |
The excluded minors for 2- and 3-regular matroids
Journal of Combinatorial Theory. Series B | 2023-09-19 | Paper |
Generalized spikes with circuits and cocircuits of different cardinalities
Advances in Applied Mathematics | 2023-09-14 | Paper |
| Comparing Width Parameters on Graph Classes | 2023-08-10 | Paper |
| The excluded minors for GF(5)-representable matroids on ten elements | 2023-07-27 | Paper |
| Computing Subset Vertex Covers in H-Free Graphs | 2023-07-11 | Paper |
Cyclic Matroids
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
| Computing excluded minors for classes of matroids representable over partial fields | 2023-02-25 | Paper |
| scientific article; zbMATH DE number 7650305 (Why is no real title available?) | 2023-02-03 | Paper |
Computing subset transversals in H-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Solving problems on generalized convex graphs via mim-width
(available as arXiv preprint) | 2022-03-25 | Paper |
| Computing weighted subset transversals in \(H\)-free graphs | 2022-03-25 | Paper |
Computing subset transversals in \(H\)-free graphs
Theoretical Computer Science | 2022-01-18 | Paper |
List k-colouring P_t-free graphs: a mim-width perspective
Information Processing Letters | 2021-10-19 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
Computing Weighted Subset Transversals in H-Free Graphs
(available as arXiv preprint) | 2020-07-28 | Paper |
Computing Subset Transversals in H-Free Graphs
(available as arXiv preprint) | 2020-05-28 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2020-05-27 | Paper |
| Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective | 2020-04-10 | Paper |
Excluded minors are almost fragile
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Excluded minors are almost fragile
Journal of Combinatorial Theory. Series B | 2020-01-15 | 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 |
Matroids with a cyclic arrangement of circuits and cocircuits
European Journal of Combinatorics | 2019-08-30 | Paper |
On a generalization of spikes
SIAM Journal on Discrete Mathematics | 2019-02-22 | Paper |
| Orienting edges to fight fire in graphs | 2019-01-30 | Paper |
Orienting edges to fight fire in graphs
(available as arXiv preprint) | 2019-01-30 | Paper |
Coloring Graphs with Constraints on Connectivity
Journal of Graph Theory | 2017-08-10 | Paper |
Coloring Graphs with Constraints on Connectivity
Journal of Graph Theory | 2017-08-10 | 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 |
An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
Annals of Combinatorics | 2015-05-05 | Paper |
A splitter theorem relative to a fixed basis
Annals of Combinatorics | 2014-09-04 | Paper |
