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 Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs Cohen-Addad, Vincent et al. 2019
3 Improved Bounds for the Excluded-Minor Approximation of Treedepth Czerwinski, Wojciech et al. 2019
4 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
5 Packing Directed Circuits Quarter-Integrally Masarík, Tomás et al. 2019
6 An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs Karpov, Nikolai et al. 2018
7 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Nadara, Wojciech et al. 2018
8 Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set Kiljan, Krzysztof et al. 2018
9 Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation Ziobro, Michal et al. 2018
10 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
11 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
12 Subexponential Parameterized Algorithms for Graphs of Polynomial Growth Marx, Dániel et al. 2017
13 Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Chekuri, Chandra et al. 2016
14 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
15 Lower Bounds for Approximation Schemes for Closest String Cygan, Marek et al. 2016
16 On Routing Disjoint Paths in Bounded Treewidth Graphs Ene, Alina et al. 2016
17 Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs Pilipczuk, Marcin et al. 2013
18 Tight bounds for Parameterized Complexity of Cluster Editing Fomin, Fedor V. et al. 2013
19 Approximation Algorithms for Union and Intersection Covering Problems Cygan, Marek et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 19


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