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