| No. |
Title |
Author |
Year |
| 1 |
Many Visits TSP Revisited |
Kowalik, Łukasz et al. |
2020 |
| 2 |
The Asymmetric Travelling Salesman Problem In Sparse Digraphs |
Kowalik, Łukasz et al. |
2020 |
| 3 |
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth |
Kowalik, Łukasz et al. |
2020 |
| 4 |
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
Bonnet, Édouard et al. |
2019 |
| 5 |
Tight Lower Bounds for List Edge Coloring |
Kowalik, Lukasz et al. |
2018 |
| 6 |
Improving TSP Tours Using Dynamic Programming over Tree Decompositions |
Cygan, Marek et al. |
2017 |
| 7 |
Tight Lower Bounds for the Complexity of Multicoloring |
Bonamy, Marthe et al. |
2017 |
| 8 |
On the Fine-Grained Complexity of Rainbow Coloring |
Kowalik, Lukasz et al. |
2016 |
| 9 |
Linear Kernels for Outbranching Problems in Sparse Digraphs |
Bonamy, Marthe et al. |
2015 |
| 10 |
Probably Optimal Graph Motifs |
Björklund, Andreas et al. |
2013 |
| 11 |
08431 Open Problems -- Moderately Exponential Time Algorithms |
Fomin, Fedor V. et al. |
2008 |
