| Publication | Date of Publication | Type |
|---|
Color-constrained arborescences in edge-colored digraphs
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
| Packing Arc-disjoint 4-cycles in oriented graphs | 2024-09-12 | Paper |
Packing arc-disjoint cycles in oriented graphs
Journal of Computer and System Sciences | 2024-04-09 | Paper |
Balanced substructures in bicolored graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
The complexity of contracting bipartite graphs into small cycles
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
A single exponential-time FPT algorithm for cactus contraction
Theoretical Computer Science | 2023-04-12 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
Packing arc-disjoint cycles in tournaments
Algorithmica | 2021-04-19 | Paper |
Parameterized and exact algorithms for class domination coloring
Discrete Applied Mathematics | 2021-03-25 | Paper |
| scientific article; zbMATH DE number 7278081 (Why is no real title available?) | 2020-11-25 | Paper |
Vertex deletion on split graphs: beyond 4-hitting set
Theoretical Computer Science | 2020-10-22 | Paper |
Quadratic vertex kernel for split vertex deletion
Theoretical Computer Science | 2020-08-03 | Paper |
| Packing arc-disjoint cycles in bipartite tournaments | 2020-07-22 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Vertex deletion on split graphs: beyond 4-hitting set
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Quadratic vertex kernel for split vertex deletion
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Revisiting connected vertex cover: FPT algorithms and lossy kernels
Theory of Computing Systems | 2019-09-05 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
Algorithmica | 2019-08-20 | Paper |
| An FPT algorithm for contraction to cactus | 2018-10-04 | Paper |
Dynamic parameterized problems
Algorithmica | 2018-07-26 | Paper |
Approximability of clique transversal in perfect graphs
Algorithmica | 2018-07-25 | Paper |
| Lossy kernels for graph contraction problems | 2018-04-19 | Paper |
| Dynamic Parameterized Problems | 2018-04-10 | Paper |
Parameterized and exact algorithms for class domination coloring
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Another disjoint compression algorithm for odd cycle transversal
Information Processing Letters | 2014-04-14 | Paper |
A Dirac-type characterization of \(k\)-chordal graphs
Discrete Mathematics | 2014-01-27 | Paper |
Parameterized algorithms for \((r,l)\)-partization
Journal of Graph Algorithms and Applications | 2013-03-19 | Paper |
Generalized above guarantee vertex cover and \(r\)-partization
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
