Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A tight approximation algorithm for the cluster vertex deletion problem | Mathematical Programming |
| 2 | 2023 |
Polynomial-time Algorithm for Maximum Weight Independent Set on
P
6
-free Graphs | ACM Transactions on Algorithms |
| 10 | 2022 |
Faster Parameterized Algorithm for Cluster Vertex Deletion | Theory of Computing Systems |
| 7 | 2021 |
Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs | Algorithmica |
| 8 | 2020 |
Tight Running Time Lower Bounds for Vertex Deletion Problems | ACM Transactions on Computation Theory |
| 4 | 2018 |