| Publication | Date of Publication | Type |
|---|
| Finding a highly connected Steiner subgraph and its applications | 2024-12-03 | Paper |
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms
Theoretical Computer Science | 2024-02-20 | Paper |
| Parameterized complexity of deletion to scattered graph classes | 2023-11-13 | Paper |
Deletion to scattered graph classes. I: Case of finite number of graph classes
Journal of Computer and System Sciences | 2023-08-21 | Paper |
Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
Journal of Computer and System Sciences | 2023-06-12 | Paper |
On the lossy kernelization for connected treedepth deletion set
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Constrained hitting set problem with intervals | 2023-03-30 | Paper |
| scientific article; zbMATH DE number 7650904 (Why is no real title available?) | 2023-02-07 | Paper |
\(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
Journal of Computer and System Sciences | 2023-01-06 | Paper |
Faster FPT algorithms for deletion to pairs of graph classes
(available as arXiv preprint) | 2022-05-20 | Paper |
Parameterized complexity of conflict-free set cover
Theory of Computing Systems | 2021-08-03 | Paper |
Parameterized pre-coloring extension and list coloring problems
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
On the approximate compressibility of connected vertex cover
Algorithmica | 2020-10-12 | Paper |
Tractability of König edge deletion problems
Theoretical Computer Science | 2019-11-13 | Paper |
Parameterized complexity of conflict-free set cover
Computer Science – Theory and Applications | 2019-10-22 | Paper |
Revisiting connected vertex cover: FPT algorithms and lossy kernels
Theory of Computing Systems | 2019-09-05 | Paper |
Polynomial kernels for vertex cover parameterized by small degree modulators
Theory of Computing Systems | 2019-09-05 | Paper |
FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
Frontiers in Algorithmics | 2019-04-26 | Paper |
| Structural parameterizations of dominating set variants | 2018-11-28 | Paper |
Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
Algorithmica | 2018-07-26 | Paper |
Kernelization of cycle packing with relaxed disjointness constraints
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
| Structural Parameterizations of Feedback Vertex Set | 2018-04-10 | Paper |
| Kernelization of cycle packing with relaxed disjointness constraints | 2017-12-19 | Paper |
| Kernels for structural parameterizations of vertex cover -- case of small degree modulators | 2017-09-29 | Paper |
Exact and parameterized algorithms for \((k,i)\)-coloring
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
