Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Data reductions and combinatorial bounds for improved approximation algorithms | Journal of Computer and System Sciences |
| 5 | 2016 |
A $c^k n$ 5-Approximation Algorithm for Treewidth | SIAM Journal on Computing |
| 81 | 2016 |
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion | Algorithmica |
| 17 | 2012 |
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms | Discrete Applied Mathematics |
| 22 | 2011 |
Confronting intractability via parameters | Computer Science Review |
| 5 | 2011 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Dynamic Kernels for Hitting Sets and Set Packing | Algorithmica |
| 1 | 2022 |
On approximate data reduction for the Rural Postman Problem: Theory and experiments | Networks |
| 8 | 2020 |
Diminishable parameterized problems and strict polynomial kernelization | Computability |
| 2020 | |
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem | Networks |
| 4 | 2019 |