| No. |
Title |
Author |
Year |
| 1 |
PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions |
Wrochna, Marcin |
2020 |
| 2 |
The Complexity of Promise SAT on Non-Boolean Domains |
Brandts, Alex et al. |
2020 |
| 3 |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints |
Knop, Dusan et al. |
2019 |
| 4 |
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor |
Jansen, Bart M. P. et al. |
2018 |
| 5 |
Cutwidth: Obstructions and Algorithmic Aspects |
Giannopoulou, Archontia C. et al. |
2017 |
| 6 |
Edge Bipartization Faster Than 2^k |
Pilipczuk, Marcin et al. |
2017 |
| 7 |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes |
Giannopoulou, Archontia C. et al. |
2017 |
| 8 |
Tight Lower Bounds for the Complexity of Multicoloring |
Bonamy, Marthe et al. |
2017 |
| 9 |
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs |
Pilipczuk, Michal et al. |
2016 |
| 10 |
Homomorphism Reconfiguration via Homotopy |
Wrochna, Marcin |
2015 |
