No. Title Author Year
1 An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs Karpov, Nikolai et al. 2018
2 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
3 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
4 Subexponential Parameterized Algorithms for Graphs of Polynomial Growth Marx, Dániel et al. 2017
5 Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Chekuri, Chandra et al. 2016
6 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
7 Lower Bounds for Approximation Schemes for Closest String Cygan, Marek et al. 2016
8 On Routing Disjoint Paths in Bounded Treewidth Graphs Ene, Alina et al. 2016
9 Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs Pilipczuk, Marcin et al. 2013
10 Tight bounds for Parameterized Complexity of Cluster Editing Fomin, Fedor V. et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint Published by LZI