| Publication | Date of Publication | Type |
|---|
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
(available as arXiv preprint) | N/A | Paper |
A polynomial kernel for proper Helly circular-arc vertex deletion
Discrete Mathematics | 2026-08-13 | Paper |
Parameterized complexity of feedback vertex set with connectivity constraints
Journal of Computer and System Sciences | 2026-08-03 | Paper |
| Parameterized approximation for capacitated d-hitting set with hard capacities | 2026-07-03 | Paper |
| Minimum consistent subset in trees and interval graphs | 2026-06-12 | Paper |
| Tractability of packing vertex-disjoint a-paths under length constraints | 2026-05-12 | Paper |
| Satisfiability to coverage in presence of fairness, matroid, and global constraints | 2026-01-14 | Paper |
Max-SAT with cardinality constraint parameterized by the number of clauses
Theoretical Computer Science | 2025-11-10 | Paper |
| Parameterized complexity of perfectly matched sets | 2025-06-23 | Paper |
Towards transitive-free digraphs
Theoretical Computer Science | 2025-05-12 | Paper |
| An exact algorithm for knot-free vertex deletion | 2024-08-06 | Paper |
| A polynomial kernel for proper Helly circular-arc vertex deletion | 2024-05-31 | Paper |
| Max-SAT with cardinality constraint parameterized by the number of clauses | 2024-05-31 | Paper |
| Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage | 2024-05-14 | Paper |
Investigation of diabatic imparity involving asymmetric convection in two-dimensional longitudinal fins using lattice Boltzmann solver
Computers & Mathematics with Applications | 2024-04-29 | Paper |
| Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems | 2024-04-23 | Paper |
| A polynomial kernel for bipartite permutation vertex deletion | 2024-02-12 | Paper |
Partitioning subclasses of chordal graphs with few deletions
Theoretical Computer Science | 2024-01-05 | Paper |
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Partitioning subclasses of chordal graphs with few deletions
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Parameterized complexity of perfectly matched sets
Theoretical Computer Science | 2023-05-02 | Paper |
Kernelization of arc disjoint cycle packing in -bounded digraphs
Theory of Computing Systems | 2023-05-02 | Paper |
A polynomial kernel for bipartite permutation vertex deletion
Algorithmica | 2022-10-27 | Paper |
Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
Computer Science – Theory and Applications | 2022-10-19 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
Parameterized complexity of maximum edge colorable subgraph
Algorithmica | 2022-10-06 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
Parameterized complexity of \textsc{maximum edge colorable subgraph}
(available as arXiv preprint) | 2021-04-21 | Paper |
Packing arc-disjoint cycles in tournaments
Algorithmica | 2021-04-19 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
| On the complexity of Mixed Dominating Set | 2019-10-22 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
Algorithmica | 2019-08-20 | Paper |
Dynamic parameterized problems
Algorithmica | 2018-07-26 | Paper |
| Dynamic Parameterized Problems | 2018-04-10 | Paper |
| Mixed Dominating Set: a parameterized perspective | 2018-01-04 | Paper |
