| Publication | Date of Publication | Type |
|---|
| Diverse collections in matroids and graphs | 2026-04-21 | Paper |
| A (2+)-factor approximation algorithm for split vertex deletion | 2026-03-18 | Paper |
| Addressing bias in algorithmic solutions: exploring vertex cover and feedback vertex set | 2025-06-20 | Paper |
Diverse pairs of matchings
Algorithmica | 2024-05-30 | Paper |
Diverse collections in matroids and graphs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Diverse Pairs of Matchings
(available as arXiv preprint) | 2023-11-14 | Paper |
On computing the Hamiltonian index of graphs
Theoretical Computer Science | 2023-04-20 | Paper |
On Computing the Hamiltonian Index of Graphs
Computer Science – Theory and Applications | 2022-10-19 | Paper |
scientific article; zbMATH DE number 7559420 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Disjoint stable matchings in linear time
(available as arXiv preprint) | 2022-06-08 | Paper |
Structural parameterizations of clique coloring
Algorithmica | 2022-03-25 | Paper |
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
Artificial Intelligence | 2022-03-02 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
ACM Transactions on Algorithms | 2022-02-16 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Structural Parameterizations of Clique Coloring
(available as arXiv preprint) | 2020-05-10 | Paper |
Subset feedback vertex set in chordal and split graphs
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Subset feedback vertex set in chordal and split graphs
Algorithmica | 2019-08-20 | Paper |
Point line cover: the easy kernel is essentially tight
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Point line cover: the easy kernel is essentially tight
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Finding even subgraphs even faster
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Finding even subgraphs even faster
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
SIAM Journal on Discrete Mathematics | 2018-04-18 | Paper |
| B-chromatic number: beyond NP-hardness | 2017-09-29 | Paper |
| Finding even subgraphs even faster | 2017-07-13 | Paper |
| Vertex Exponential Algorithms for Connected f-Factors | 2017-04-25 | Paper |
| Beyond Max-Cut: -extendible properties parameterized above the Poljak-Turzík bound | 2017-01-26 | Paper |
On the parameterized complexity of b-\textsc{chromatic number}
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Hitting forbidden minors: approximation and kernelization
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Using patterns to form homogeneous teams
Algorithmica | 2015-05-26 | Paper |
Minimum fill-in of sparse graphs: kernelization and approximation
Algorithmica | 2015-03-02 | Paper |
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Theoretical Computer Science | 2014-12-22 | Paper |
Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms | 2014-12-05 | Paper |
The kernelization complexity of connected domination in graphs with (no) small cycles
Algorithmica | 2014-12-02 | Paper |
A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
Journal of Computer and System Sciences | 2014-06-10 | Paper |
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery | 2014-02-19 | Paper |
Hardness of r-dominating set on graphs of diameter (r + 1)
Parameterized and Exact Computation | 2013-12-10 | Paper |
Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
Journal of Graph Theory | 2013-11-15 | Paper |
FPT algorithms for connected feedback vertex set
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
On parameterized independent feedback vertex set
Theoretical Computer Science | 2012-11-27 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2012-08-31 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | Paper |
A single-exponential FPT algorithm for the \(K _{4}\)-minor cover problem
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
Hitting forbidden minors: approximation and kernelization
(available as arXiv preprint) | 2012-01-23 | Paper |
Algorithmic aspects of dominator colorings in graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
The effect of homogeneity on the complexity of \(k\)-anonymity
Fundamentals of Computation Theory | 2011-08-19 | Paper |
On parameterized independent feedback vertex set
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Pattern-Guided Data Anonymization and Clustering
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Ranking and drawing in subexponential time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On the Kernelization Complexity of Colorful Motifs
Parameterized and Exact Computation | 2010-12-07 | Paper |
A quartic kernel for pathwidth-one vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
The curse of connectivity: \(t\)-total vertex (edge) cover
Lecture Notes in Computer Science | 2010-07-20 | Paper |
FPT algorithms for connected feedback vertex set
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Lecture Notes in Computer Science | 2009-10-29 | Paper |
