Search Results

Documents authored by Seiler, Jonas


Document
PACE Solver Description
PACE Solver Description: Tree-Of-Life - Branching Solver for Maximum Agreement Forests

Authors: Jonas Seiler

Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)


Abstract
This paper describes the branch-and-bound solver Tree-of-Life for the maximum-agreement-forest problem. The solver was developed as part of the Parameterized Algorithms and Computational Experiments (PACE) Challenge 2026, where it took fourth place. Notably, it is the only solver in the top 5 that does not rely on an external general-purpose solver. This article introduces several novel reduction and branching rules that significantly improve the performance of Tree-of-Life compared with state-of-the-art branch-and-bound algorithms from the literature.

Cite as

Jonas Seiler. PACE Solver Description: Tree-Of-Life - Branching Solver for Maximum Agreement Forests. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 39:1-39:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{seiler:LIPIcs.IPEC.2026.39,
  author =	{Seiler, Jonas},
  title =	{{PACE Solver Description: Tree-Of-Life - Branching Solver for Maximum Agreement Forests}},
  booktitle =	{21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
  pages =	{39:1--39: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.39},
  URN =		{urn:nbn:de:0030-drops-282126},
  doi =		{10.4230/LIPIcs.IPEC.2026.39},
  annote =	{Keywords: Maximum Agreement Forest, Exact Algorithm, Branch-and-Bound}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail