@inproceedings{29c18d2fc5214acab2a7633a4c7271dd,
title = "The PACE 2020 Parameterized Algorithms and Computational Experiments challenge: Treedepth",
abstract = "This year{\textquoteright}s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection of benchmark instances and the ranking of the participating teams. We also briefly discuss the approaches used in the submitted solvers and the differences in their performance on our benchmark dataset.",
keywords = "Computing treedepth, Contest, FPT, Implementation challenge",
author = "{\L}ukasz Kowalik and Marcin Mucha and Wojciech Nadara and Marcin Pilipczuk and Manuel Sorge and Piotr Wygocki",
note = "Publisher Copyright: {\textcopyright} {\L}ukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, and Piotr Wygocki;; 15th International Symposium on Parameterized and Exact Computation, IPEC 2020 ; Conference date: 14-12-2020 Through 18-12-2020",
year = "2020",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.IPEC.2020.37",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Yixin Cao and Marcin Pilipczuk",
booktitle = "15th International Symposium on Parameterized and Exact Computation, IPEC 2020",
address = "Germany",
}