No. |
Title |
Author |
Year |
---|

1 |
A Parameterized Complexity View on Collapsing k-Cores |
Luo, Junjie et al. |
2019 |

2 |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals |
Eiben, Eduard et al. |
2019 |

3 |
Faster FPT Algorithm for 5-Path Vertex Cover |
Cervený, Radovan et al. |
2019 |

4 |
Cluster Editing in Multi-Layer and Temporal Graphs |
Chen, Jiehua et al. |
2018 |

5 |
Finding Secluded Places of Special Interest in Graphs |
van Bevern, René et al. |
2017 |

6 |
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) |
Giannopoulou, Archontia C. et al. |
2014 |

7 |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound |
Mnich, Matthias et al. |
2012 |