21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 1-606, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@Proceedings{korhonen_et_al:LIPIcs.IPEC.2026,
title = {{LIPIcs, Volume 398, IPEC 2026, Complete Volume}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {1--606},
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},
URN = {urn:nbn:de:0030-drops-283485},
doi = {10.4230/LIPIcs.IPEC.2026},
annote = {Keywords: LIPIcs, Volume 398, IPEC 2026, Complete Volume}
}
21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{korhonen_et_al:LIPIcs.IPEC.2026.0,
author = {Korhonen, Tuukka and Lampis, Michael},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {0:i--0:xviii},
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.0},
URN = {urn:nbn:de:0030-drops-283467},
doi = {10.4230/LIPIcs.IPEC.2026.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Max Göttlicher, Lennard Hofmann, and Christoph Niederbudde. From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{gottlicher_et_al:LIPIcs.IPEC.2026.1,
author = {G\"{o}ttlicher, Max and Hofmann, Lennard and Niederbudde, Christoph},
title = {{From FPT to W\lbrackP\rbrack: Classifying Zero Forcing, Power Domination and Their Variants}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {1:1--1:16},
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.1},
URN = {urn:nbn:de:0030-drops-281748},
doi = {10.4230/LIPIcs.IPEC.2026.1},
annote = {Keywords: zero forcing, power domination, l-round PDS, k-forcing, propagation time, parameterized complexity, fixed-parameter tractability, kernelization, W\lbrackP\rbrack-hardness}
}
Anselm Haak, Arne Meier, and Raghavendra Rao B. V.. On k-Bounded Nondeterminism for Branching Programs and Circuits. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{haak_et_al:LIPIcs.IPEC.2026.2,
author = {Haak, Anselm and Meier, Arne and Rao B. V., Raghavendra},
title = {{On k-Bounded Nondeterminism for Branching Programs and Circuits}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {2:1--2:17},
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.2},
URN = {urn:nbn:de:0030-drops-281757},
doi = {10.4230/LIPIcs.IPEC.2026.2},
annote = {Keywords: Parameterised Complexity, Circuit Complexity, Branching Programs, Logspace, k-Bounded Nondeterminism}
}
DongYun Byun and Akira Matsubayashi. A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{byun_et_al:LIPIcs.IPEC.2026.3,
author = {Byun, DongYun and Matsubayashi, Akira},
title = {{A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {3:1--3:17},
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.3},
URN = {urn:nbn:de:0030-drops-281764},
doi = {10.4230/LIPIcs.IPEC.2026.3},
annote = {Keywords: disjoint paths, parameterized algorithm, treewidth, pathwidth, strongly exponential time hypothesis}
}
Leo van Iersel, Mark Jones, Jannik Schestag, Celine Scornavacca, and Mathias Weller. Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{vaniersel_et_al:LIPIcs.IPEC.2026.4,
author = {van Iersel, Leo and Jones, Mark and Schestag, Jannik and Scornavacca, Celine and Weller, Mathias},
title = {{Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {4:1--4:18},
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.4},
URN = {urn:nbn:de:0030-drops-281774},
doi = {10.4230/LIPIcs.IPEC.2026.4},
annote = {Keywords: phylogenetic diversity, phylogenetic networks, network phylogenetic diversity, algorithms, computational complexity}
}
Sarah Frenkel and Johannes Carmesin. Computing Local 2-Separators. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{frenkel_et_al:LIPIcs.IPEC.2026.5,
author = {Frenkel, Sarah and Carmesin, Johannes},
title = {{Computing Local 2-Separators}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {5:1--5:20},
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.5},
URN = {urn:nbn:de:0030-drops-281780},
doi = {10.4230/LIPIcs.IPEC.2026.5},
annote = {Keywords: Tree decomposition, graph decomposition, local separator, parallel algorithm}
}
Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, and Magnus Wahlström. Super-Linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{brakensiek_et_al:LIPIcs.IPEC.2026.6,
author = {Brakensiek, Joshua and Guruswami, Venkatesan and Jansen, Bart M. P. and Lagerkvist, Victor and Wahlstr\"{o}m, Magnus},
title = {{Super-Linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {6:1--6:17},
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.6},
URN = {urn:nbn:de:0030-drops-281792},
doi = {10.4230/LIPIcs.IPEC.2026.6},
annote = {Keywords: Constraint satisfaction problems, Non-redundancy, Kernelization, Sparsification}
}
Édouard Bonnet, Maël Dumas, and Julien Duron. Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2026.7,
author = {Bonnet, \'{E}douard and Dumas, Ma\"{e}l and Duron, Julien},
title = {{Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {7:1--7:15},
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.7},
URN = {urn:nbn:de:0030-drops-281805},
doi = {10.4230/LIPIcs.IPEC.2026.7},
annote = {Keywords: Hardness of Approximation, bounded twin-width, Maximum Independent Set, Coloring}
}
László Kozma and Junqi Tan. Exact Algorithms for Optimal Discretization. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{kozma_et_al:LIPIcs.IPEC.2026.8,
author = {Kozma, L\'{a}szl\'{o} and Tan, Junqi},
title = {{Exact Algorithms for Optimal Discretization}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {8:1--8:14},
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.8},
URN = {urn:nbn:de:0030-drops-281815},
doi = {10.4230/LIPIcs.IPEC.2026.8},
annote = {Keywords: discretization, point set, separation, exponential time}
}
Petr A. Golovach, Laure Morelle, and Daniël Paulusma. Identification to Subclasses of Chordal Graphs. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{golovach_et_al:LIPIcs.IPEC.2026.9,
author = {Golovach, Petr A. and Morelle, Laure and Paulusma, Dani\"{e}l},
title = {{Identification to Subclasses of Chordal Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {9:1--9:14},
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.9},
URN = {urn:nbn:de:0030-drops-281825},
doi = {10.4230/LIPIcs.IPEC.2026.9},
annote = {Keywords: vertex identification, chordal graph, parameterized complexity}
}
Ameet Gadekar. On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{gadekar:LIPIcs.IPEC.2026.10,
author = {Gadekar, Ameet},
title = {{On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {10:1--10:19},
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.10},
URN = {urn:nbn:de:0030-drops-281835},
doi = {10.4230/LIPIcs.IPEC.2026.10},
annote = {Keywords: Clustering, sum of radii clustering, mergeable sum of radii, parameterized approximation}
}
Manuel Lafond and Francis Sarrazin. An O^*((2+ε)^k) Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{lafond_et_al:LIPIcs.IPEC.2026.11,
author = {Lafond, Manuel and Sarrazin, Francis},
title = {{An O^*((2+\epsilon)^k) Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {11:1--11:16},
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.11},
URN = {urn:nbn:de:0030-drops-281847},
doi = {10.4230/LIPIcs.IPEC.2026.11},
annote = {Keywords: Cographs, Parameterized complexity, Graph editing, Branching algorithms, Prime graphs}
}
Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, and Krisztina Szilágyi. Not All Degree Constraints Are Created Equal When Computing Spanning Trees. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bojikian_et_al:LIPIcs.IPEC.2026.12,
author = {Bojikian, Narek and Firbas, Alexander and Ganian, Robert and Hoang, Hung P. and Szil\'{a}gyi, Krisztina},
title = {{Not All Degree Constraints Are Created Equal When Computing Spanning Trees}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {12:1--12:18},
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.12},
URN = {urn:nbn:de:0030-drops-281855},
doi = {10.4230/LIPIcs.IPEC.2026.12},
annote = {Keywords: degree-constrained spanning trees, parameterized complexity, treedepth}
}
Ruchir Bansal, Dalu Jacob, Soumen Mandal, Ashutosh Rai, and Navneet Raj. Fast Parameterized Algorithms for Matching Cut and d-Cut. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bansal_et_al:LIPIcs.IPEC.2026.13,
author = {Bansal, Ruchir and Jacob, Dalu and Mandal, Soumen and Rai, Ashutosh and Raj, Navneet},
title = {{Fast Parameterized Algorithms for Matching Cut and d-Cut}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {13:1--13:17},
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.13},
URN = {urn:nbn:de:0030-drops-281860},
doi = {10.4230/LIPIcs.IPEC.2026.13},
annote = {Keywords: Matching-Cut, d-Cut, Treewidth, Structural Parameterization, Vertex Cover}
}
Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki. Structural Parameterizations for Eternal Vertex Cover. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{misra_et_al:LIPIcs.IPEC.2026.14,
author = {Misra, Neeldhara and Ordyniak, Sebastian and Paesani, Giacomo and Rychlicki, Mateusz},
title = {{Structural Parameterizations for Eternal Vertex Cover}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {14:1--14:17},
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.14},
URN = {urn:nbn:de:0030-drops-281870},
doi = {10.4230/LIPIcs.IPEC.2026.14},
annote = {Keywords: eternal vertex cover, parameterized complexity, deletion to small components, cluster vertex deletion}
}
Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof, and Shengzhe Wang. New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{ameli_et_al:LIPIcs.IPEC.2026.15,
author = {Ameli, Afrouz Jabal and Koana, Tomohiro and Nederlof, Jesper and Wang, Shengzhe},
title = {{New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {15:1--15:16},
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.15},
URN = {urn:nbn:de:0030-drops-281885},
doi = {10.4230/LIPIcs.IPEC.2026.15},
annote = {Keywords: Strongly connected Steiner subgraph, parameterized complexity, treewidth, exact exponential time algorithms}
}
Sriram Bhyravarapu and A Mohanapriya. Eccentricity Shortest Path Is W[1]-Hard Parameterized by Distance to Spider Graphs. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bhyravarapu_et_al:LIPIcs.IPEC.2026.16,
author = {Bhyravarapu, Sriram and Mohanapriya, A},
title = {{Eccentricity Shortest Path Is W\lbrack1\rbrack-Hard Parameterized by Distance to Spider Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {16:1--16:16},
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.16},
URN = {urn:nbn:de:0030-drops-281896},
doi = {10.4230/LIPIcs.IPEC.2026.16},
annote = {Keywords: shortest path, W\lbrack1\rbrack-hard, feedback vertex set, path-width, clique-width, spider graphs, feedback edge set}
}
Kensuke Oowa and Takuro Fukunaga. Weighted Chromatic Correlation Clustering and a Parameterized Algorithm. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{oowa_et_al:LIPIcs.IPEC.2026.17,
author = {Oowa, Kensuke and Fukunaga, Takuro},
title = {{Weighted Chromatic Correlation Clustering and a Parameterized Algorithm}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {17:1--17:15},
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.17},
URN = {urn:nbn:de:0030-drops-281901},
doi = {10.4230/LIPIcs.IPEC.2026.17},
annote = {Keywords: chromatic correlation clustering, cluster editing, graph algorithms, parameterized algorithms}
}
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, and Martin Strehler. On Kernels and Leaves: Searching for Bare and Lush Trees. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{beisegel_et_al:LIPIcs.IPEC.2026.18,
author = {Beisegel, Jesse and K\"{o}hler, Ekkehard and Scheffler, Robert and Strehler, Martin},
title = {{On Kernels and Leaves: Searching for Bare and Lush Trees}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {18:1--18:18},
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.18},
URN = {urn:nbn:de:0030-drops-281918},
doi = {10.4230/LIPIcs.IPEC.2026.18},
annote = {Keywords: graph search, spanning tree, parameterized complexity, kernelization, leaves of trees}
}
Ahmed Ghazy, Jakob Greilhuber, and Tim A. Hartmann. Exploring Minimal Blocking Sets for Kernelization Lower Bounds for ℱ-Minor Deletion. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{ghazy_et_al:LIPIcs.IPEC.2026.19,
author = {Ghazy, Ahmed and Greilhuber, Jakob and Hartmann, Tim A.},
title = {{Exploring Minimal Blocking Sets for Kernelization Lower Bounds for ℱ-Minor Deletion}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {19:1--19:16},
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.19},
URN = {urn:nbn:de:0030-drops-281927},
doi = {10.4230/LIPIcs.IPEC.2026.19},
annote = {Keywords: Kernelization Lower Bounds, Minimal Blocking Sets, ℱ-Minor Deletion, Pathwidth Deletion}
}
Matthias Bentert, Eduard Eiben, Fedor V. Fomin, and Petr A. Golovach. Routing Multiple Agents Below the Sum of Distances. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bentert_et_al:LIPIcs.IPEC.2026.20,
author = {Bentert, Matthias and Eiben, Eduard and Fomin, Fedor V. and Golovach, Petr A.},
title = {{Routing Multiple Agents Below the Sum of Distances}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {20:1--20:16},
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.20},
URN = {urn:nbn:de:0030-drops-281932},
doi = {10.4230/LIPIcs.IPEC.2026.20},
annote = {Keywords: Multi-Agent Pathfinding, Parameterized Complexity, Motion Planning}
}
Yuma Tamura, Daichi Wakayama, Akira Suzuki, and Xiao Zhou. Minimum Membership Dominating Set and Its Generalization: Leafage vs. Asteroidal Number. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{tamura_et_al:LIPIcs.IPEC.2026.21,
author = {Tamura, Yuma and Wakayama, Daichi and Suzuki, Akira and Zhou, Xiao},
title = {{Minimum Membership Dominating Set and Its Generalization: Leafage vs. Asteroidal Number}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {21:1--21:18},
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.21},
URN = {urn:nbn:de:0030-drops-281943},
doi = {10.4230/LIPIcs.IPEC.2026.21},
annote = {Keywords: parameterized complexity, Minimum Membership Dominating Set, leafage, asteroidal number}
}
Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright, Michael R. Fellows, David C. Kutner, Laura Larios-Jones, Barnaby Martin, Frances Rosamond, and Ella Yates. O(n)+f(k): Truly Linear FPT. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bumpus_et_al:LIPIcs.IPEC.2026.22,
author = {Bumpus, Benjamin Merlin and Downey, Rod and Eagling-Vose, Tala and Enright, Jessica and Fellows, Michael R. and Kutner, David C. and Larios-Jones, Laura and Martin, Barnaby and Rosamond, Frances and Yates, Ella},
title = {{O(n)+f(k): Truly Linear FPT}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {22:1--22:18},
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.22},
URN = {urn:nbn:de:0030-drops-281956},
doi = {10.4230/LIPIcs.IPEC.2026.22},
annote = {Keywords: Truly Linear FPT, fixed-parameter tractability, parameterized complexity, graph algorithms, kernelization, dynamic programming}
}
Tesshu Hanaka, Hirotaka Ono, and Suguru Yamada. Set Function Maximization with Locality over Graphs. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{hanaka_et_al:LIPIcs.IPEC.2026.23,
author = {Hanaka, Tesshu and Ono, Hirotaka and Yamada, Suguru},
title = {{Set Function Maximization with Locality over Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {23:1--23:17},
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.23},
URN = {urn:nbn:de:0030-drops-281966},
doi = {10.4230/LIPIcs.IPEC.2026.23},
annote = {Keywords: Set function maximization, locality, graph algorithms}
}
Taiki Kaneda, Yasuaki Kobayashi, and Hisao Tamaki. Fast and Practical Single-Exponential Algorithms for Branchwidth. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{kaneda_et_al:LIPIcs.IPEC.2026.24,
author = {Kaneda, Taiki and Kobayashi, Yasuaki and Tamaki, Hisao},
title = {{Fast and Practical Single-Exponential Algorithms for Branchwidth}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {24:1--24:18},
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.24},
URN = {urn:nbn:de:0030-drops-281979},
doi = {10.4230/LIPIcs.IPEC.2026.24},
annote = {Keywords: Branchwidth, Computational experiment, Exact exponential algorithms, Graphs, Hypergraphs}
}
Rin Saito and Yuma Tamura. k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{saito_et_al:LIPIcs.IPEC.2026.25,
author = {Saito, Rin and Tamura, Yuma},
title = {{k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {25:1--25:15},
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.25},
URN = {urn:nbn:de:0030-drops-281986},
doi = {10.4230/LIPIcs.IPEC.2026.25},
annote = {Keywords: Graph Algorithms, Fixed-Parameter Tractability, Feedback Vertex Set}
}
Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, and Marie Diana Sieper. The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{depian_et_al:LIPIcs.IPEC.2026.26,
author = {Depian, Thomas and Fink, Simon D. and Firbas, Alexander and Ganian, Robert and N\"{o}llenburg, Martin and Sieper, Marie Diana},
title = {{The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {26:1--26:16},
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.26},
URN = {urn:nbn:de:0030-drops-281996},
doi = {10.4230/LIPIcs.IPEC.2026.26},
annote = {Keywords: vertex ordering, forbidden patterns, parameterized algorithms, polynomial hierarchy}
}
Gregor Diatzko, Félix Lasseux, and Sabine Storandt. c-Packedness Versus λ-Low-Density in Geometric Graphs: Theory and Practice. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{diatzko_et_al:LIPIcs.IPEC.2026.27,
author = {Diatzko, Gregor and Lasseux, F\'{e}lix and Storandt, Sabine},
title = {{c-Packedness Versus \lambda-Low-Density in Geometric Graphs: Theory and Practice}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {27:1--27:19},
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.27},
URN = {urn:nbn:de:0030-drops-282006},
doi = {10.4230/LIPIcs.IPEC.2026.27},
annote = {Keywords: Geometric Graph, Balanced Separator, Tree Decomposition, Distance Oracle}
}
Prafullkumar Tale. On the Hardness of Strong Metric Dimension. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{tale:LIPIcs.IPEC.2026.28,
author = {Tale, Prafullkumar},
title = {{On the Hardness of Strong Metric Dimension}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {28:1--28:17},
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.28},
URN = {urn:nbn:de:0030-drops-282010},
doi = {10.4230/LIPIcs.IPEC.2026.28},
annote = {Keywords: Strong Metric Dimension, Constant Diameter, Constant Pathwidth, Constant Feedback Vertex Set Number, NP-hardness}
}
Fedor V. Fomin, Petr A. Golovach, and Yash Hiren More. Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{fomin_et_al:LIPIcs.IPEC.2026.29,
author = {Fomin, Fedor V. and Golovach, Petr A. and More, Yash Hiren},
title = {{Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {29:1--29:16},
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.29},
URN = {urn:nbn:de:0030-drops-282022},
doi = {10.4230/LIPIcs.IPEC.2026.29},
annote = {Keywords: Ultrametrics, Hierarchical Clustering, Parameterized Complexity, Kernelization, FPT Algorithms}
}
Édouard Bonnet, Carl Feghali, and Manolis Vasilakis. Faster Parameterized Broadcasting. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2026.30,
author = {Bonnet, \'{E}douard and Feghali, Carl and Vasilakis, Manolis},
title = {{Faster Parameterized Broadcasting}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {30:1--30:16},
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.30},
URN = {urn:nbn:de:0030-drops-282037},
doi = {10.4230/LIPIcs.IPEC.2026.30},
annote = {Keywords: Parameterized Complexity, Structural Graph Parameters, Telephone Broadcast}
}
Radu Curticapean and Mingjun Liu. Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 31:1-31:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{curticapean_et_al:LIPIcs.IPEC.2026.31,
author = {Curticapean, Radu and Liu, Mingjun},
title = {{Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {31:1--31:13},
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.31},
URN = {urn:nbn:de:0030-drops-282045},
doi = {10.4230/LIPIcs.IPEC.2026.31},
annote = {Keywords: induced subgraphs, counting complexity, parameterized complexity, dichotomy, automorphism group}
}
Alexander Leonhardt, Manuel Penschuck, and Mathias Weller. The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{leonhardt_et_al:LIPIcs.IPEC.2026.32,
author = {Leonhardt, Alexander and Penschuck, Manuel and Weller, Mathias},
title = {{The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {32:1--32:18},
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.32},
URN = {urn:nbn:de:0030-drops-282053},
doi = {10.4230/LIPIcs.IPEC.2026.32},
annote = {Keywords: Phylogenetics, Maximum-Agreement Forest, Algorithm Engineering, FPT}
}
Anton Hoof and Tobias Röhr. PACE Solver Description: Maffe - A Lagrangian Approach to Maximum Agreement Forests. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 33:1-33:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{hoof_et_al:LIPIcs.IPEC.2026.33,
author = {Hoof, Anton and R\"{o}hr, Tobias},
title = {{PACE Solver Description: Maffe - A Lagrangian Approach to Maximum Agreement Forests}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {33:1--33: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.33},
URN = {urn:nbn:de:0030-drops-282066},
doi = {10.4230/LIPIcs.IPEC.2026.33},
annote = {Keywords: maximum agreement forest, phylogenetic trees, integer programming, branch-and-price, column generation, lagrangian relaxation, heuristic algorithms}
}
Johannes Varga, Enrico Iurlano, and Hai Xia. PACE Solver Description: Woodcutter, a Branch-Cut-And-Price Algorithm Computing Maximum Agreement Forests. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 34:1-34:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{varga_et_al:LIPIcs.IPEC.2026.34,
author = {Varga, Johannes and Iurlano, Enrico and Xia, Hai},
title = {{PACE Solver Description: Woodcutter, a Branch-Cut-And-Price Algorithm Computing Maximum Agreement Forests}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {34:1--34: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.34},
URN = {urn:nbn:de:0030-drops-282071},
doi = {10.4230/LIPIcs.IPEC.2026.34},
annote = {Keywords: Maximum Agreement Forest, Phylogenetics, Branch-and-Price, Column Generation, PACE Challenge}
}
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)
@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}
}
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}
}
Daniel Busch and Britta Dorn. PACE Solver Description: A Sparse Pricer for Maximum Agreement Forests. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 37:1-37:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{busch_et_al:LIPIcs.IPEC.2026.37,
author = {Busch, Daniel and Dorn, Britta},
title = {{PACE Solver Description: A Sparse Pricer for Maximum Agreement Forests}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {37:1--37: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.37},
URN = {urn:nbn:de:0030-drops-282100},
doi = {10.4230/LIPIcs.IPEC.2026.37},
annote = {Keywords: maximum agreement forest, column generation, pricing problem, weighted maximum agreement subtree, sparse dynamic programming, heuristic, PACE 2026}
}
Jakub Dziura and Tomáš Masařík. PACE Solver Description: CherryPicker, a Heuristic Solver 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. 38:1-38:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{dziura_et_al:LIPIcs.IPEC.2026.38,
author = {Dziura, Jakub and Masa\v{r}{\'\i}k, Tom\'{a}\v{s}},
title = {{PACE Solver Description: CherryPicker, a Heuristic Solver for the Maximum Agreement Forest Problem}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {38:1--38: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.38},
URN = {urn:nbn:de:0030-drops-282112},
doi = {10.4230/LIPIcs.IPEC.2026.38},
annote = {Keywords: Maximum agreement forest (MAF), iterated local search (ILS), column generation, solution with lower-bound guarantees, LP relaxation, PACE Challenge}
}
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)
@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}
}
Nicolas Bousquet, Bertrand Marchand, Arnaud Mary, and Sven Meyer. PACE Solver Description: Sherby. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 40:1-40:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bousquet_et_al:LIPIcs.IPEC.2026.40,
author = {Bousquet, Nicolas and Marchand, Bertrand and Mary, Arnaud and Meyer, Sven},
title = {{PACE Solver Description: Sherby}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {40:1--40: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.40},
URN = {urn:nbn:de:0030-drops-282138},
doi = {10.4230/LIPIcs.IPEC.2026.40},
annote = {Keywords: PACE - Maximum Agreement Forests - Maximum Satisfiability}
}
Rens Versnel. PACE Solver Description: Hitting Pair DBS and AF-DFS. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 41:1-41:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{versnel:LIPIcs.IPEC.2026.41,
author = {Versnel, Rens},
title = {{PACE Solver Description: Hitting Pair DBS and AF-DFS}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {41:1--41: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.41},
URN = {urn:nbn:de:0030-drops-282144},
doi = {10.4230/LIPIcs.IPEC.2026.41},
annote = {Keywords: Maximum agreement forest, PACE Challenge, parameterized complexity}
}