| Publication | Date of Publication | Type |
|---|
| A (2+)-factor approximation algorithm for split vertex deletion | 2026-03-18 | Paper |
| Kernelization of counting problems | 2025-11-04 | Paper |
| Addressing bias in algorithmic solutions: exploring vertex cover and feedback vertex set | 2025-06-20 | Paper |
An exponential time parameterized algorithm for planar disjoint paths
SIAM Journal on Computing | 2025-03-27 | Paper |
Improving envy freeness up to any good guarantees through rainbow cycle number
Mathematics of Operations Research | 2025-01-28 | Paper |
| A parameterized algorithm for vertex connectivity survivable network design problem with uniform demands | 2025-01-06 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | Paper |
Parameterized approximation algorithms for weighted vertex cover
Theoretical Computer Science | 2024-11-18 | Paper |
| A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs | 2024-07-19 | Paper |
| Parameterized approximation algorithms for weighted vertex cover | 2024-05-31 | Paper |
An ETH-tight algorithm for bidirected Steiner connectivity
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788352 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788353 (Why is no real title available?) | 2024-01-15 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
Polynomial Kernel for Interval Vertex Deletion
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Erdős–Pósa property of obstructions to interval graphs
Journal of Graph Theory | 2023-10-09 | Paper |
Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
Algorithmica | 2023-06-28 | Paper |
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
ACM Transactions on Algorithms | 2023-04-26 | Paper |
A single exponential-time FPT algorithm for cactus contraction
Theoretical Computer Science | 2023-04-12 | Paper |
| On the Complexity of Recovering Incidence Matrices | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650395 (Why is no real title available?) | 2023-02-03 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Algorithmica | 2022-08-18 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
| Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number | 2022-07-21 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
Popular matching in roommates setting is NP-hard
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
ACM Transactions on Algorithms | 2022-02-16 | Paper |
| Popular matching in roommates setting is \textsf{NP}-hard | 2021-08-30 | Paper |
Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
(available as arXiv preprint) | 2021-08-04 | Paper |
| Exploring the kernelization borders for hitting cycles | 2021-08-04 | Paper |
| Quasipolynomial representation of transversal matroids with applications in parameterized complexity | 2021-06-15 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An exponential time parameterized algorithm for planar disjoint paths
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Conflict free version of covering problems on graphs: classical and parameterized
Theory of Computing Systems | 2020-08-26 | Paper |
| Erdös-Pósa Property of Obstructions to Interval Graphs | 2020-08-05 | Paper |
Linear representation of transversal matroids and gammoids parameterized by rank
Theoretical Computer Science | 2020-04-07 | Paper |
| An Erdős-Pósa theorem on neighborhoods and domination number | 2020-02-24 | Paper |
Faster graph bipartization
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Interval vertex deletion admits a polynomial kernel
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Popular matching in roommates setting is NP-hard
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Feedback vertex set inspired kernel for chordal vertex deletion
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Conflict free version of covering problems on graphs: classical and parameterized
Computer Science – Theory and Applications | 2018-11-28 | Paper |
Deterministic truncation of linear matroids
ACM Transactions on Algorithms | 2018-11-13 | Paper |
| An FPT algorithm for contraction to cactus | 2018-10-04 | 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 |
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 |
| Lossy kernels for graph contraction problems | 2018-04-19 | Paper |
| Parameterized algorithms for survivable network design with uniform demands | 2018-03-15 | Paper |
Linear representation of transversal matroids and gammoids parameterized by rank
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Hitting selected (odd) cycles
SIAM Journal on Discrete Mathematics | 2017-08-14 | Paper |
| Finding even subgraphs even faster | 2017-07-13 | Paper |
Faster exact algorithms for some terminal set problems
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Reducing rank of the adjacency matrix by graph modification
Theoretical Computer Science | 2016-11-24 | Paper |
Reducing rank of the adjacency matrix by graph modification
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Deterministic truncation of linear matroids
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithmica | 2015-06-25 | Paper |
Parameterized approximations via \(d\)-skew-symmetric multicut
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Parameterized algorithms to preserve connectivity
Automata, Languages, and Programming | 2014-07-01 | Paper |
Faster exact algorithms for some terminal set problems
Parameterized and Exact Computation | 2013-12-10 | Paper |
A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
Theory of Computing Systems | 2013-12-02 | Paper |
Parameterized algorithms for even cycle transversal
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
A polynomial kernel for Feedback Arc Set on bipartite tournaments
Algorithms and Computation | 2011-12-16 | Paper |
