No. |
Title |
Author |
Year |
---|

1 |
Combinatorial n-fold Integer Programming and Applications |
Knop, Dusan et al. |
2017 |

2 |
Dynamic Parameterized Problems and Algorithms |
Alman, Josh et al. |
2017 |

3 |
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments |
Mnich, Matthias et al. |
2017 |

4 |
Voting and Bribing in Single-Exponential Time |
Knop, Dusan et al. |
2017 |

5 |
A 7/3-Approximation for Feedback Vertex Sets in Tournaments |
Mnich, Matthias et al. |
2016 |

6 |
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts |
Etscheid, Michael et al. |
2016 |

7 |
Linear-Time Recognition of Map Graphs with Outerplanar Witness |
Mnich, Matthias et al. |
2016 |

8 |
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness |
Fleszar, Krzysztof et al. |
2016 |

9 |
On Routing Disjoint Paths in Bounded Treewidth Graphs |
Ene, Alina et al. |
2016 |

10 |
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs |
Mnich, Matthias et al. |
2016 |