@inproceedings{332ea9ea6cb74dcfbd6eb4a3683654a8,
title = "The PACE 2017 Parameterized Algorithms and Computational Experiments challenge: The second iteration",
abstract = "In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A featured the Treewidth problem and Track B the Minimum Fill-In problem. Over 44 participants on 17 teams from 11 countries submitted their implementations to the competition.",
keywords = "Contest, FPT, Implementation challenge, Minimum fill-in, Treewidth",
author = "Holger Dell and Christian Komusiewicz and Nimrod Talmon and Mathias Weller",
note = "Publisher Copyright: {\textcopyright} 2018 Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller.; 12th International Symposium on Parameterized and Exact Computation, IPEC 2017 ; Conference date: 06-09-2017 Through 08-09-2017",
year = "2018",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.IPEC.2017.30",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Daniel Lokshtanov and Naomi Nishimura",
booktitle = "12th International Symposium on Parameterized and Exact Computation, IPEC 2017",
address = "Germany",
}