Manuel Ronhaar. ManuelRonhaar/searchsPACE (Software). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@misc{dagstuhl-artifact-28289,
title = {{ManuelRonhaar/searchsPACE}},
author = {Ronhaar, Manuel},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:fd72f0b27dedf01da66ee63683d1c48a47c63d86}{\texttt{swh:1:dir:fd72f0b27dedf01da66ee63683d1c48a47c63d86}} (visited on 2026-11-20)},
url = {https://github.com/ManuelRonhaar/searchsPACE},
doi = {10.4230/artifacts.28289},
}
Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)
Manuel Ronhaar. PACE Solver Description: Simulated Annealing for the Maximum Agreement Forest Problem. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 36:1-36:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{ronhaar:LIPIcs.IPEC.2026.36,
author = {Ronhaar, Manuel},
title = {{PACE Solver Description: Simulated Annealing for the Maximum Agreement Forest Problem}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {36:1--36:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.36},
URN = {urn:nbn:de:0030-drops-282097},
doi = {10.4230/LIPIcs.IPEC.2026.36},
annote = {Keywords: simulated annealing, column generation, maximum agreement forest, pace challenge}
}