No. Title Author Year
1 Resolving Infeasibility of Linear Systems: A Parameterized Approach Göke, Alexander et al. 2019
2 New Approximation Algorithms for (1,2)-TSP Adamaszek, Anna et al. 2018
3 Reachability Switching Games Fearnley, John et al. 2018
4 Combinatorial n-fold Integer Programming and Applications Knop, Dusan et al. 2017
5 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
6 Improved Bounds for Minimal Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2017
7 Voting and Bribing in Single-Exponential Time Knop, Dusan et al. 2017
8 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
9 Linear Kernels and Linear-Time Algorithms for Finding Large Cuts Etscheid, Michael et al. 2016
10 Linear-Time Recognition of Map Graphs with Outerplanar Witness Mnich, Matthias et al. 2016
11 New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness Fleszar, Krzysztof et al. 2016
12 On Routing Disjoint Paths in Bounded Treewidth Graphs Ene, Alina et al. 2016
13 Polynomial Kernels for Deletion to Classes of Acyclic Digraphs Mnich, Matthias et al. 2016
14 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
15 Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound Mnich, Matthias et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 15


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