No. Title Author Year
1 New Approximation Algorithms for (1,2)-TSP Adamaszek, Anna et al. 2018
2 Reachability Switching Games Fearnley, John et al. 2018
3 Combinatorial n-fold Integer Programming and Applications Knop, Dusan et al. 2017
4 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
5 Improved Bounds for Minimal Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2017
6 Voting and Bribing in Single-Exponential Time Knop, Dusan et al. 2017
7 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
8 Linear Kernels and Linear-Time Algorithms for Finding Large Cuts Etscheid, Michael et al. 2016
9 Linear-Time Recognition of Map Graphs with Outerplanar Witness Mnich, Matthias et al. 2016
10 New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness Fleszar, Krzysztof et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 14


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