No. Title Author Year
1 A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots Deppert, Max et al. 2023
2 Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Bergougnoux, Benjamin et al. 2023
3 Hitting Weighted Even Cycles in Planar Graphs Göke, Alexander et al. 2021
4 Hitting Long Directed Cycles Is Fixed-Parameter Tractable Göke, Alexander et al. 2020
5 Solving Packing Problems with Few Small Items Using Rainbow Matchings Bannach, Max et al. 2020
6 Resolving Infeasibility of Linear Systems: A Parameterized Approach Göke, Alexander et al. 2019
7 New Approximation Algorithms for (1,2)-TSP Adamaszek, Anna et al. 2018
8 Reachability Switching Games Fearnley, John et al. 2018
9 Combinatorial n-fold Integer Programming and Applications Knop, Dusan et al. 2017
10 Dynamic Parameterized Problems and Algorithms Alman, Josh et al. 2017
11 Improved Bounds for Minimal Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2017
12 Voting and Bribing in Single-Exponential Time Knop, Dusan et al. 2017
13 A 7/3-Approximation for Feedback Vertex Sets in Tournaments Mnich, Matthias et al. 2016
14 Linear Kernels and Linear-Time Algorithms for Finding Large Cuts Etscheid, Michael et al. 2016
15 Linear-Time Recognition of Map Graphs with Outerplanar Witness Mnich, Matthias et al. 2016
16 New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness Fleszar, Krzysztof et al. 2016
17 On Routing Disjoint Paths in Bounded Treewidth Graphs Ene, Alina et al. 2016
18 Polynomial Kernels for Deletion to Classes of Acyclic Digraphs Mnich, Matthias et al. 2016
19 Parameterized Complexity Dichotomy for Steiner Multicut Bringmann, Karl et al. 2015
20 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: 20

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