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


DROPS-Home | Fulltext Search | Imprint Published by LZI