No. Title Author Year
1 A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs Jansen, Bart M. P. et al. 2019
2 On Geometric Set Cover for Orthants Bringmann, Karl et al. 2019
3 Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs Novotná, Jana et al. 2019
4 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
5 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
6 Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs Heggernes, Pinar et al. 2018
7 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
8 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
9 Polynomial Kernels for Deletion to Classes of Acyclic Digraphs Mnich, Matthias et al. 2016
10 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
11 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: 11


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