| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On Kernels for d-Path Vertex Cover | Červený, Radovan et al. | 2022 |
| 2 | On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations | Blažej, Václav et al. | 2022 |
| 3 | A Parameterized Complexity View on Collapsing k-Cores | Luo, Junjie et al. | 2019 |
| 4 | Complexity of the Steiner Network Problem with Respect to the Number of Terminals | Eiben, Eduard et al. | 2019 |
| 5 | Faster FPT Algorithm for 5-Path Vertex Cover | Cervený, Radovan et al. | 2019 |
| 6 | Cluster Editing in Multi-Layer and Temporal Graphs | Chen, Jiehua et al. | 2018 |
| 7 | Finding Secluded Places of Special Interest in Graphs | van Bevern, René et al. | 2017 |
| 8 | Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) | Giannopoulou, Archontia C. et al. | 2014 |
| 9 | Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound | Mnich, Matthias et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |