Search Results

Documents authored by Inhetveen, Christian


Artifact
Software
Klados

Authors: Christian Inhetveen, Marcin Mennemann, Marius Maximilian Hille, Mart Hagedoorn, and Kevin Buchin


Abstract

Cite as

Christian Inhetveen, Marcin Mennemann, Marius Maximilian Hille, Mart Hagedoorn, Kevin Buchin. Klados (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@misc{dagstuhl-artifact-28342,
   title = {{Klados}}, 
   author = {Inhetveen, Christian and Mennemann, Marcin and Hille, Marius Maximilian and Hagedoorn, Mart and Buchin, Kevin},
   note = {Software, version 0.1.0., swhId: \href{https://archive.softwareheritage.org/swh:1:dir:a9cce5ef9dad61bd4c6d822add9f1e6e1f48593a;origin=https://github.com/Buchineers/klados;visit=swh:1:snp:7f1c2177a06060ade3f4ec6b55387d67240863c9;anchor=swh:1:rev:c3d2d556a979216a8ffcef7326918611060bd24d}{\texttt{swh:1:dir:a9cce5ef9dad61bd4c6d822add9f1e6e1f48593a}} (visited on 2026-11-20)},
   url = {https://klados.buchinee.rs},
   doi = {10.4230/artifacts.28342},
}
Document
PACE Solver Description
PACE Solver Description: Klados - Branch-and-Price and SAT for Rooted Maximum Agreement Forests

Authors: Christian Inhetveen, Marcin Mennemann, Marius Maximilian Hille, Mart Hagedoorn, and Kevin Buchin

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


Abstract
A maximum agreement forest cuts a set of rooted phylogenetic trees into the fewest pieces on which all trees agree. We describe Klados (κλάδος, Ancient Greek for "branch"), our exact solver for this problem in the PACE 2026 challenge. Klados shrinks the input with safe reduction rules, including a 3-2 rule for any number of trees, and then solves the rest by branch-and-price or SAT.

Cite as

Christian Inhetveen, Marcin Mennemann, Marius Maximilian Hille, Mart Hagedoorn, and Kevin Buchin. PACE Solver Description: Klados - Branch-and-Price and SAT for Rooted Maximum Agreement Forests. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 35:1-35:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{inhetveen_et_al:LIPIcs.IPEC.2026.35,
  author =	{Inhetveen, Christian and Mennemann, Marcin and Hille, Marius Maximilian and Hagedoorn, Mart and Buchin, Kevin},
  title =	{{PACE Solver Description: Klados - Branch-and-Price and SAT for Rooted Maximum Agreement Forests}},
  booktitle =	{21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
  pages =	{35:1--35:5},
  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.35},
  URN =		{urn:nbn:de:0030-drops-282080},
  doi =		{10.4230/LIPIcs.IPEC.2026.35},
  annote =	{Keywords: Rooted maximum agreement forest, branch-and-price, SAT}
}

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