No. Title Author Year
1 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
2 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
3 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
4 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
5 Polynomial Kernels for Deletion to Classes of Acyclic Digraphs Mnich, Matthias et al. 2016
6 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
7 Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs Pilipczuk, Marcin et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI