Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2016.30
URN: urn:nbn:de:0030-drops-69310
URL: https://drops.dagstuhl.de/opus/volltexte/2017/6931/
Dell, Holger ; Husfeldt, Thore ; Jansen, Bart M. P. ; Kaski, Petteri ; Komusiewicz, Christian ; Rosamond, Frances A.
The First Parameterized Algorithms and Computational Experiments Challenge
| pdf-format: |
|
Abstract
In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge. Where did PACE come from, how did it go, who won, and what's next?
BibTeX - Entry
@InProceedings{dell_et_al:LIPIcs:2017:6931,
author = {Holger Dell and Thore Husfeldt and Bart M. P. Jansen and Petteri Kaski and Christian Komusiewicz and Frances A. Rosamond},
title = {{The First Parameterized Algorithms and Computational Experiments Challenge}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {30:1--30:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Jiong Guo and Danny Hermelin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6931},
URN = {urn:nbn:de:0030-drops-69310},
doi = {10.4230/LIPIcs.IPEC.2016.30},
annote = {Keywords: treewidth, feedback vertex set, contest, implementation challenge, FPT}
}
| Keywords: | treewidth, feedback vertex set, contest, implementation challenge, FPT | |
| Seminar: | 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) | |
| Issue date: | 2017 | |
| Date of publication: | 09.02.2017 |
