| Publication | Date of Publication | Type |
|---|
| Finding d-cuts in probe H-free graphs | 2026-02-26 | Paper |
| m-eternal domination and variants on some classes of finite and infinite graphs | 2026-02-26 | Paper |
A general theoretical framework for learning smallest interpretable models
Artificial Intelligence | 2026-01-22 | Paper |
| A tight subexponential-time algorithm for two-page book embedding | 2026-01-14 | Paper |
Independent transversals versus transversals
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Classifying subset feedback vertex set for \(H\)-free graphs
Theoretical Computer Science | 2024-06-04 | Paper |
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
European Journal of Combinatorics | 2024-01-23 | Paper |
| Bounding the Mim-Width of Hereditary Graph Classes. | 2023-11-13 | Paper |
Bounding the mim‐width of hereditary graph classes
Journal of Graph Theory | 2023-10-04 | Paper |
| Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs | 2023-08-08 | Paper |
Classifying subset feedback vertex set for H-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | 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 |
Feedback vertex set and even cycle transversal for H-free graphs: finding large block graphs
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
Computing subset transversals in \(H\)-free graphs
Theoretical Computer Science | 2022-01-18 | Paper |
scientific article; zbMATH DE number 7378380 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Algorithmica | 2020-10-12 | Paper |
Computing Subset Transversals in H-Free Graphs
(available as arXiv preprint) | 2020-05-28 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Fundamentals of Computation Theory | 2020-01-30 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Algorithmica | 2020-01-16 | Paper |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
(available as arXiv preprint) | 2019-10-11 | Paper |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
(available as arXiv preprint) | 2019-08-01 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
