| layout | page |
|---|---|
| title | Past Challenges |
| sidebar_link | true |
| sidebar_sort_order | 3 |
The results of each PACE challenge are documented in a report that is published in the IPEC proceedings.
- PACE 2026: Maximum-Agreement Forest
(slides, challenge description) - PACE 2025: Dominating Set and Hitting Set
(slides, results, challenge description) - PACE 2024: One-sided Crossing Minimization
(official report, slides, results, challenge description) - PACE 2023: Twinwidth
(official report, slides, results, challenge description) - PACE 2022: Directed Feedback Vertex Set
(official report, slides, results, challenge description) - PACE 2021: Cluster Editing
(official report, slides, video, results, instances, challenge description) - PACE 2020: Treedepth
(official report, slides, results, instances, challenge description) - PACE 2019: Vertex Cover and Hypertree Width
(official report, slides, challenge description) - PACE 2018: Steiner Tree
(official report, slides, instances, challenge description) - PACE 2017: Treewidth and Minimum Fill-In
(official report, slides, challenge descriptions) - PACE 2016: Treewidth and Feedback Vertex Set
(official report, slides, challenge descriptions)
PACE has inspired some great papers:
- Rajesh Pandian M, Rupesh Nasre and N.S. Narayanaswamy. Accelerating Computation of Steiner Trees on GPUs. International Journal of Parallel Programming, Vol 50, pgs 152–185 (2022). [pdf] [doi] [slides] [code]
- Hisao Tamaki. Positive-instance driven dynamic programming for treewidth (ESA 2017, best paper award)
- Ben Strasser. Computing Tree Decompositions with FlowCutter: PACE 2017 Submission (arXiv:1709.08949 [cs.DS])
- Max Bannach, Sebastian Berndt and Thorsten Ehlers. Jdrasil: A Modular Library for Computing Tree Decompositions (SEA 2017)
- Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele. Turbocharging Treewidth Heuristics (IPEC 2016)