| Publication | Date of Publication | Type |
|---|
| Odd cycle transversal on \(P_5\)-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
On finding short reconfiguration sequences between independent sets
Journal of Computer and System Sciences | 2024-10-29 | Paper |
| On finding short reconfiguration sequences between independent sets | 2024-09-11 | Paper |
| Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent | 2024-07-19 | Paper |
| A polynomial kernel for proper Helly circular-arc vertex deletion | 2024-05-31 | Paper |
| Computing square colorings on bounded-treewidth and planar graphs | 2024-05-14 | Paper |
Brief Announcement: Local Problems in the SUPPORTED Model
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7803580 (Why is no real title available?) | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7803579 (Why is no real title available?) | 2024-02-12 | Paper |
The parameterized complexity of guarding almost convex polygons
Discrete & Computational Geometry | 2024-02-09 | Paper |
Parameterized complexity of minimum membership dominating set
Algorithmica | 2023-11-17 | Paper |
| On the Parameterized Complexity of Clique Elimination Distance | 2023-11-13 | Paper |
| Parameter analysis for guarding terrains | 2023-11-02 | Paper |
The Parameterized Complexity of Guarding Almost Convex Polygons.
(available as arXiv preprint) | 2023-11-02 | Paper |
Clustering what matters: optimal approximation for clustering with outliers
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Polynomial Kernel for Interval Vertex Deletion
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Recognizing well-dominated graphs is coNP-complete
Information Processing Letters | 2023-10-12 | Paper |
Erdős–Pósa property of obstructions to interval graphs
Journal of Graph Theory | 2023-10-09 | Paper |
Parameterized complexity of perfectly matched sets
Theoretical Computer Science | 2023-05-02 | Paper |
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
ACM Transactions on Algorithms | 2023-04-26 | Paper |
| scientific article; zbMATH DE number 7650305 (Why is no real title available?) | 2023-02-03 | Paper |
| Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices | 2023-02-03 | Paper |
Parameterized Analysis of Art Gallery and Terrain Guarding
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Parameterized complexity of maximum edge colorable subgraph
Algorithmica | 2022-10-06 | Paper |
| On finding short reconfiguration sequences between independent sets | 2022-09-12 | Paper |
| Distance from triviality 2.0: hybrid parameterizations | 2022-08-30 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Algorithmica | 2022-08-18 | Paper |
| Parameterized complexity of conflict-free matchings and paths | 2022-07-21 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
| Connecting the dots (with minimum crossings) | 2022-07-18 | Paper |
Parameterized complexity of minimum membership dominating set
(available as arXiv preprint) | 2022-07-13 | Paper |
A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
Parameter analysis for guarding terrains
Algorithmica | 2022-03-22 | Paper |
Fine-grained complexity of rainbow coloring and its variants
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
(available as arXiv preprint) | 2021-08-04 | Paper |
| Conflict free feedback vertex set: a parameterized dichotomy | 2021-08-04 | Paper |
| Exploring the kernelization borders for hitting cycles | 2021-08-04 | Paper |
Parameterized complexity of \textsc{maximum edge colorable subgraph}
(available as arXiv preprint) | 2021-04-21 | Paper |
Simultaneous feedback edge set: a parameterized perspective
Algorithmica | 2021-03-26 | Paper |
Paths to trees and cacti
Theoretical Computer Science | 2021-03-09 | Paper |
| scientific article; zbMATH DE number 7278081 (Why is no real title available?) | 2020-11-25 | Paper |
Parameterized complexity of happy coloring problems
Theoretical Computer Science | 2020-08-17 | Paper |
| Erdös-Pósa Property of Obstructions to Interval Graphs | 2020-08-05 | Paper |
Quadratic vertex kernel for split vertex deletion
Theoretical Computer Science | 2020-08-03 | Paper |
Path contraction faster than \(2^n\)
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
On the parameterized complexity of contraction to generalization of trees
(available as arXiv preprint) | 2020-05-27 | Paper |
| Fine-Grained Complexity of Rainbow Coloring and its Variants. | 2020-05-26 | Paper |
Parameterized complexity of conflict-free matchings and paths
Algorithmica | 2020-05-21 | Paper |
Quadratic vertex kernel for split vertex deletion
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Simultaneous feedback vertex set: a parameterized perspective
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Split contraction: the untold story
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Interval vertex deletion admits a polynomial kernel
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Parameterised algorithms for deletion to classes of DAGs
Theory of Computing Systems | 2019-09-05 | Paper |
Feedback vertex set inspired kernel for chordal vertex deletion
ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Hitting and covering partially | 2018-10-04 | Paper |
Kernelization of cycle packing with relaxed disjointness constraints
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Feedback vertex set inspired kernel for chordal vertex deletion
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| On the parameterized complexity of happy vertex coloring | 2018-06-15 | Paper |
| scientific article; zbMATH DE number 6862097 (Why is no real title available?) | 2018-04-19 | Paper |
Simultaneous feedback edge set: a parameterized perspective
(available as arXiv preprint) | 2018-04-19 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2018-04-19 | Paper |
| Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set | 2018-04-10 | Paper |
Simultaneous feedback vertex set: a parameterized perspective
(available as arXiv preprint) | 2018-01-24 | Paper |
| Critical node cut parameterized by treewidth and solution size is \(W[1\)-hard] | 2018-01-04 | Paper |
| Kernelization of cycle packing with relaxed disjointness constraints | 2017-12-19 | Paper |
Kernels for deletion to classes of acyclic digraphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Paths to trees and cacti
Lecture Notes in Computer Science | 2017-07-21 | Paper |
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Vertex Cover Gets Faster and Harder on Low Degree Graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
(available as arXiv preprint) | N/A | Paper |
