| Publication | Date of Publication | Type |
|---|
Detecting $K_{2,3}$ as an induced minor (available as arXiv preprint) | N/A | Paper |
Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property (available as arXiv preprint) | N/A | Paper |
| Excluding an induced wheel minor in graphs without large induced stars | 2026-07-10 | Paper |
Linear colorings of graphs European Journal of Combinatorics | 2026-07-09 | Paper |
Treewidth versus clique number. V: Further connections with tree-independence number Journal of Graph Theory | 2026-06-11 | Paper |
Induced minor models. I: Structural properties and algorithmic consequences Journal of Computer and System Sciences | 2026-02-11 | Paper |
Linear colorings of graphs (available as arXiv preprint) | 2026-01-01 | Paper |
Faithful universal graphs for minor-closed classes SIAM Journal on Discrete Mathematics | 2026-01-01 | Paper |
Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property Discrete Mathematics | 2025-04-11 | Paper |
| Detecting \(K_{2,3}\) as an induced minor | 2025-02-28 | Paper |
Path Eccentricity and Forbidden Induced Subgraphs (available as arXiv preprint) | 2025-01-01 | Paper |
Faithful universal graphs for minor-closed classes (available as arXiv preprint) | 2025-01-01 | Paper |
Treewidth versus clique number. V. Further connections with tree-independence number (available as arXiv preprint) | 2025-01-01 | Paper |
Excluding an induced wheel minor in graphs without large induced stars (available as arXiv preprint) | 2025-01-01 | Paper |
Largest planar graphs of diameter 3 and fixed maximum degree -- connection with fractional matchings (available as arXiv preprint) | 2025-01-01 | Paper |
On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs (available as arXiv preprint) | 2025-01-01 | Paper |
On the proper interval completion problem within some chordal subclasses Discrete Mathematics | 2024-11-09 | Paper |
| Sparse graphs with bounded induced cycle packing number have logarithmic treewidth | 2024-05-14 | Paper |
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth Journal of Combinatorial Theory. Series B | 2024-05-10 | Paper |
Treewidth versus clique number: induced minors (available as arXiv preprint) | 2024-01-01 | Paper |
Sufficient conditions for polynomial-time detection of induced minors (available as arXiv preprint) | 2024-01-01 | Paper |
| On tree decompositions whose trees are minors | 2023-02-23 | Paper |
Long induced paths in minor-closed graph classes and beyond The Electronic Journal of Combinatorics | 2023-02-17 | Paper |
Long induced paths in minor-closed graph classes and beyond (available as arXiv preprint) | 2022-01-11 | Paper |