No. Title Author Year
1 An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs Karpov, Nikolai et al. 2018
2 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Nadara, Wojciech et al. 2018
3 Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set Kiljan, Krzysztof et al. 2018
4 Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation Ziobro, Michal et al. 2018
5 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
6 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
7 Subexponential Parameterized Algorithms for Graphs of Polynomial Growth Marx, Dániel et al. 2017
8 Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Chekuri, Chandra et al. 2016
9 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
10 Lower Bounds for Approximation Schemes for Closest String Cygan, Marek et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 14


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