LIPIcs, Volume 398

21st International Symposium on Parameterized and Exact Computation (IPEC 2026)



Thumbnail PDF

Event

Editors

Tuukka Korhonen
  • University of Copenhagen, Denmark
Michael Lampis
  • Université Paris-Dauphine, PSL University, CNRS UMR7243, LAMSADE, Paris, France

Publication Details

  • published at: 2026-11-20
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
  • ISBN: 978-3-95977-456-7

Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Volume
LIPIcs, Volume 398, IPEC 2026, Complete Volume

Authors: Tuukka Korhonen and Michael Lampis


Abstract
LIPIcs, Volume 398, IPEC 2026, Complete Volume

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Tuukka Korhonen and Michael Lampis


Abstract
Front Matter, Table of Contents, Preface, Conference Organization

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants

Authors: Max Göttlicher, Lennard Hofmann, and Christoph Niederbudde


Abstract
Zero Forcing (ZF) and Power Dominating Set (PDS) mark vertices in a graph based on a common forcing process starting from a problem-specific set of initially marked vertices. ZF initially marks the selected vertices while PDS additionally marks their neighbors. In the forcing process, a marked vertex with only one unmarked neighbor may force that neighbor which then becomes marked, too. A solution marks the entire graph by exhaustive application of this rule. One variant generalizes the forcing threshold; vertices may force when they have a fixed number of k unmarked neighbors. Another variant limits propagation to a fixed number of rounds. We classify the parameterized complexity of the problem variants obtained by combining these choices of initialization, round limit and forcing threshold. We show that with appropriate choices, these variants range in parameterized complexity from fixed-parameter tractable to complete for every even layer W[2𝓁] of the W-hierarchy, and up to W[P]-complete. Our results demonstrate that small changes in any one of these three dimensions can lead to a sharp change in problem complexity.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
On k-Bounded Nondeterminism for Branching Programs and Circuits

Authors: Anselm Haak, Arne Meier, and Raghavendra Rao B. V.


Abstract
Parameterised logspace-bounded computation is characterised by classes such as para𝐋 and paraβL. Especially, paraβL serves as a natural tractable counterpart of NL. Branching programs (BPs) are a natural model for space-bounded computation, notably for their characterisation of NL and NC¹. However, branching programs did not receive much attention in the landscape of parameterised computation. We consider parameterised variants of branching programs and its equivalent models such as skew circuits and weakly skew circuits. In particular, we study the power of these models with the k-bounded nondeterminism. We obtain characterization of paraβL in terms of branching programs, skew circuits and width bounded circuits with read-once access to k-bounded choice bits. We show that the parameterised problem of model checking existential first-order formulae with unbounded arity and restricted locality for the occurrence of variables can be done by weakly skew circuits with read-once access to choice bits. We also see that going beyond read-once restrictions quickly leads to intractability by showing that paraβL with two-pass over the choice bits contains MINI-SAT. Finally, we define the class XLP consisting of all parameterised problems solvable in f(k)⋅log n space and f(k)⋅n^O(1) time and obtain a complete problem for the class.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth

Authors: DongYun Byun and Akira Matsubayashi


Abstract
The k vertex-disjoint paths problem asks whether, given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), G has k pairwise vertex-disjoint paths connecting s_i and t_i for all 1 ≤ i ≤ k. If G is undirected, then this problem is NP-complete, but there exist FPT algorithms parameterized by k. Since these algorithms involve an extremely large function on k, algorithms for restricted graphs have also been investigated. In particular, a 2^{2tw log tw + O(tw)} ⋅ n time algorithm for undirected graphs with n vertices and treewidth tw is proposed by Scheffler (Technical Report 396, TU Berlin, '94), and it is proved by Lokshtanov, Marx, and Saurabh (SIAM J. Comput. '18) that, under the ETH, there exists no 2^o(pw log pw) ⋅ n^O(1) time algorithm for either directed or undirected graphs with pathwidth pw and for k = Ω(pw⁴). It has not been known whether the lower bound also holds for a smaller k. In this paper, we prove that, for both the directed and undirected cases, there is an algorithm faster than Lokshtanov et al.’s lower bound for k = tw^o(1) by proposing a 2^O((tw+k)log k) ⋅ n time algorithm. Besides, we prove a lower bound that, under the SETH, there exists no (2-ε)^{pw log pw} ⋅ n^O(1) time algorithm for directed graphs and for a general k. This lower bound is tight because, with slight modifications, Scheffler’s algorithm runs in 2^{pw log pw + O(pw)} ⋅ n time also for directed graphs.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility

Authors: Leo van Iersel, Mark Jones, Jannik Schestag, Celine Scornavacca, and Mathias Weller


Abstract
We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural parameters that capture the deviation of a network from a tree. Our primary parameter is the scanwidth, a measure of the tree-likeness of a given directed acyclic graph. We show that a subset of taxa with maximum APD can be found in polynomial time in phylogenetic networks with scanwidth at most 2, but becomes NP-hard in networks with scanwidth at most 3. Further, we design an algorithm that computes the APD of a given set of taxa in O(2^s ⋅ n) time, given a width-s tree-extension, with n vertices of the input network. Finally, we give a linear-time algorithm for computing the APD of a given set of taxa if the network induced by these taxa is reticulation-visible. We generalize this algorithm to an FPT algorithm with respect to the maximum number of invisible reticulations of any biconnected component of the induced network, assuming the indegrees are bounded by a constant.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Computing Local 2-Separators

Authors: Sarah Frenkel and Johannes Carmesin


Abstract
Graph decompositions are the natural generalisation of tree decompositions where the decomposition tree is replaced by a genuine graph. Recently, they have found theoretical applications in sparsity theory, topological graph theory, structural graph theory, and geometric group theory. In this paper, we present the first efficient implementation of an algorithm to compute these graph decompositions.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Super-Linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances

Authors: Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, and Magnus Wahlström


Abstract
We say that an instance of a constraint satisfaction problem (CSP) is non-redundant if the satisfaction of each clause cannot be implied by the satisfaction of the other clauses in the instance. The non-redundancy (NRD) of a CSP is the maximal number of clauses a non-redundant instance can have for a given number of variables. NRD is closely tied to the behavior of CSPs in various computational models including their sparsification, kernelization, and streaming complexity. A primary open question in the study of non-redundancy is the identification of which CSP predicates have near-linear NRD. Recent works by Carbonnel [CP 2022], Khanna, Putterman and Sudan [STOC 2025], Brakensiek and Guruswami [STOC 2025] and Brakensiek, Guruswami, Jansen, Lagerkvist, and Wahlström [2025] have introduced various forms of gadget reductions between CSPs to relate their non-redundancy. The primary contribution of this work is to recontextualize many of these gadget reductions in a framework which we call hypergraph projections. By studying a quantity we call the shrinking factor of these hypergraph projections, we can more precisely predict when a gadget reduction between predicates can yield a super-linear NRD lower bound, greatly improving on the analysis of previous works. To illustrate the power of our framework, we identify some concrete CSP predicates whose non-redundancy is at the cusp of our understanding and show how our methods give lower bounds that could not have been achieved with previous methods. We also demonstrate how these gadget reductions can be automatically deduced using SAT solvers, thereby opening up novel computational avenues for discovering further relationships between the non-redundancy of various CSPs.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width

Authors: Édouard Bonnet, Maël Dumas, and Julien Duron


Abstract
For every ε > 0, Max Independent Set admits a polynomial-time n^ε-approximation algorithm on n-vertex graphs of effectively bounded twin-width [Bergé et al., STACS '23]. The approximation factor actually obtained is more precisely n^O(1/log log n). Prior to the current paper, no approximation hardness was known for this problem, and the existence of a polynomial-time approximation scheme (PTAS) was repeatedly raised as an open question. We answer this question in a strong sense: We show that there is a constant γ > 0 such that a polynomial-time n^{γ/(log log n)²}-approximation algorithm for Max Independent Set on graphs of twin-width at most 4 would refute the Exponential-Time Hypothesis (ETH). This lower bound further holds if a 4-sequence is provided as part of the input. We show the same hardness of approximation for Min Coloring, which also has a nearly matching n^O(1/log log n)-approximation algorithm on graphs of effectively bounded twin-width. We also clarify the parameterized complexity of k-Independent Set on graphs of bounded radius-r merge-width when the range of r is limited. There is a fixed-parameter tractable algorithm for k-Independent Set on graphs given with radius-2^O(k²) merge sequences of bounded width [Dreier and Toruńczyk, STOC '25]. We complement this result by showing that k-Independent Set is W[1]-hard on graphs given with radius-o(k) merge sequences of bounded width. We further show that this result also holds for k-Dominating Set.

Cite as

É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)


Copy BibTex To Clipboard

@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}
}
Document
Exact Algorithms for Optimal Discretization

Authors: László Kozma and Junqi Tan


Abstract
The optimal discretization problem asks, given two disjoint sets of points R and B in the plane, for a minimal family of horizontal and vertical lines that separate the two sets, so that no cell delimited by the lines contains points from both sets. The problem arises as a pre-processing in supervised machine learning, and has received significant attention in parameterized algorithmics. Answering the question raised by Bonnet, Giannopoulos, and Lampis [IPEC 2017] and Froese [PhD thesis, 2018], it was shown by Kratsch, Masařík, Muzi, Pilipczuk, and Sorge [SODA 2021] that optimal discretization admits a fixed-parameter algorithm with running time 2^𝒪(k²log{k}) ⋅ n^𝒪(1), where k is the solution size and n = |R| + |B|. In this paper we give an algorithm for optimal discretization that runs in time 𝒪(1.9602ⁿ). We also study the related point separation problem that asks to separate all input points by axis-parallel lines. For this problem we obtain an algorithm with runtime 𝒪(1.8906ⁿ). Our guarantees follow from structural observations about bichromatic and monochromatic point sets, and hold even if points are allowed to share coordinates. To our knowledge, these are the first improvements over the trivial 2ⁿ bound for both problems.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Identification to Subclasses of Chordal Graphs

Authors: Petr A. Golovach, Laure Morelle, and Daniël Paulusma


Abstract
An identification of two vertices u and v in a graph replaces them with a new vertex whose neighborhood is the union of the neighborhoods of u and v. We study the H-Identification problem, which is to decide whether a given graph G can be transformed ("identified") to a graph in H by applying at most k vertex identifications. We determine the classical and parameterized complexity of this problem for various subclasses H of chordal graphs, obtaining an almost complete picture for two parameters: k and n-k. We also consider the Identification problem, which is to test for two given graphs G and H if G can be identified to H. We determine the parameterized complexity of this problem when H is a graph from one of our testbed classes, taking the number of simplicial vertices of H as the parameter.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering

Authors: Ameet Gadekar


Abstract
The sum of radii problem (k-MSR) asks, given a metric space on n points, to place k balls covering all points so as to minimize the sum of their radii. Despite extensive study from the perspectives of approximation and parameterized algorithms, the exact parameterized complexity of the problem and the existence of efficient parameterized approximation schemes remained open. We advance this understanding on both the hardness and algorithmic fronts. We begin by showing that k-MSR is W[2]-hard parameterized by k, thereby pinpointing its location in the W-hierarchy. Moreover, via our reduction, we rule out efficient parameterized approximation schemes (EPAS) - that is, (1+ε)-approximations running in time f(k,ε)⋅poly(n) - unless W[2] = FPT. Assuming the Exponential Time Hypothesis, we further rule out such algorithms running in time f(k,ε)⋅n^o(k), strengthening recent lower bounds for the problem. On the algorithmic side, we study k-MSR under the framework of mergeable constraints, which captures a broad class of clustering constraints, including fairness, diversity, and lower bounds. We obtain an FPT (8/3+ε)-approximation, improving upon the previous best guarantee of (4+ε). Moreover, given access to a suitable assignment subroutine, we achieve a (2+ε)-approximation, matching the best known bound for the unconstrained problem. This, in turn, yields (2+ε) FPT-approximations for several important settings, including (t,k)-fair, (α,β)-fair, 𝓁-diversity, and private clustering.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
An O^*((2+ε)^k) Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs

Authors: Manuel Lafond and Francis Sarrazin


Abstract
We study the parameterized complexity of the Cograph Deletion problem, which asks whether at most k edges can be deleted from a graph to make it P₄-free. This is a well-known graph modification problem with applications in computational biology and social network analysis. Most parameterized algorithms use a similar strategy: identify an induced P₄ and branch on its local structure. The current best algorithm achieves running time O^*(2.303^k), but relies on a large number of intricate branching cases found by automated search, making further improvements along this line difficult. We therefore introduce a new approach based on modular decompositions. We solve each module and the quotient graph independently, with the latter being the core problem. This reduces the problem to solving on a prime graph, in which all modules are trivial. We then use a characterization of Chudnovsky et al. stating that any large enough prime graph has one of seven structures as an induced subgraph. These all have linearly many P₄s, which we use in a recursive branch tree algorithm to achieve running time O^*((2 + ε)^k) for any ε > 0. Although the hidden polynomial factors can be very large, our result shows that the exponential base of the complexity can be made arbitrarily close to 2, suggesting a new direction for improving graph modification algorithms. More broadly, this appears to be the first algorithmic application of the prime graph characterization. To support further future applications, we characterize the graph classes ℋ for which the ℋ-free editing problem admits a similar reduction to prime graphs.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Not All Degree Constraints Are Created Equal When Computing Spanning Trees

Authors: Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, and Krisztina Szilágyi


Abstract
We study the computation of minimum spanning trees subject to local degree constraints. Recent work (ICALP 2026) established that three natural formalizations of this problem share the exact same parameterized complexity under standard structural graph parameters, including treewidth, pathwidth and clique-width. This applies to the cases where every vertex has a single target degree (Specified Degree MST), or a degree upper bound (Bounded Degree MST), or is equipped with a set of admissible degrees (Set of Degrees MST). In this paper, we investigate these problems under more restrictive parameterizations and reveal that their complexity landscapes fundamentally diverge on bounded-treedepth graphs. Specifically, we prove that the former two problems are fixed-parameter tractable when parameterized by the treedepth of the input graph. In sharp contrast, we show that Set of Degrees MST remains W[1]-hard parameterized by treedepth, even when combined with the feedback vertex number (i.e., deletion distance to treewidth 1). Finally, we show that this divergence seems to be specific to treedepth: we exclude an analogous W[1]-hardness result for Set of Degrees MST w.r.t. the vertex cover number on unweighted graphs, and also rule out fixed-parameter algorithms for the former two problems w.r.t. deletion distance to constant pathwidth.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Fast Parameterized Algorithms for Matching Cut and d-Cut

Authors: Ruchir Bansal, Dalu Jacob, Soumen Mandal, Ashutosh Rai, and Navneet Raj


Abstract
Matching Cut can be seen as a blend of two fundamental concepts in graph theory, namely, a matching and a cut. In the Matching Cut problem, given a graph G, the objective is to determine whether there exists a cut (A, B) such that the set of edges crossing the cut forms a matching. While the classical problems of finding a maximum sized matching and a cut with minimum number of crossing edges are solvable in polynomial time, Matching Cut is known to be NP-complete. A natural generalization of Matching Cut is the d-Cut problem, where for a given integer d ≥ 1 and a graph G, we ask if there exists a cut (A, B) in which each vertex has at most d neighbors on the opposite side. In this paper, we improve upon the fastest known FPT algorithm for the d-Cut problem parameterized by treewidth, previously proposed by Gomes and Sau [Algorithmica, 2021], which runs in 𝒪^*((2(d+1)²)^{tw}) time. We begin by refining their approach with a tighter analysis of the join node case in the dynamic programming over tree decompositions. In particular, we obtain a better bound on the number of splittings of a characteristic vector associated with a subset of vertices in a bag. This leads to a running time of {𝒪}^*(((d+1)(d+2))^{tw}). This is further improved to 𝒪^*((2(d+1))^{tw}) by employing the technique of fast subset convolution. Further, we present several single-exponential time algorithms parameterized by the size s of a given modulator (such as vertex cover, distance to disjoint paths, cluster vertex deletion, and twin cover) together with the maximum number of crossing edges k in the cut. The running time of these algorithms is of the form 𝒪^*(2^s c_d^k), where c_d is a constant depending on d and the specific modulator. For the vertex cover modulator, we improve this to 𝒪^*((h_d)^s), where h_d = 2(c_d)^d < 2(d+1) for all d ≥ 2 and grows sublinearly in d. Furthermore, while the only known algorithm parameterized by the number of crossing edges k alone runs in time 2^𝒪(k log k), our algorithms are single-exponential in k, at the cost of an additional factor of 2^s.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Structural Parameterizations for Eternal Vertex Cover

Authors: Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki


Abstract
Eternal Vertex Cover (EVC) is a turn-based attacker–defender game on an undirected graph G. To begin with, the defender places k guards on vertices of G. The attacker, on their turn, can choose an edge e not already occupied at both endpoints to "attack". The edge e is defended if a guard moves along the edge e. The defender, on their turn, can move any subset of guards. A guard can only move to a neighboring vertex. The minimum number of guards needed to indefinitely defend against any sequence of attacks is called the eternal vertex cover number, generalizing the classic vertex cover number. Determining this number is NP-hard in general, motivating the study of parameterized and approximation algorithms. The problem is known to be FPT when parameterized by the cover number, but structural parameters remain relatively unexplored in the literature. In this work, we explore structural parameterizations for EVC. We show that EVC is FPT parameterized by the cluster vertex deletion number, which generalizes the previously studied parameterization by vertex cover number. We next study the problem parameterized by vertex integrity, which is the smallest number of vertices we need to delete from G so that the resulting graph is a disjoint union of constant-sized components. We first show that Eternal Vertex Cover is XP parameterized by vertex integrity. Then, we develop a polynomial-time approximation algorithm, which computes an additive 6k+1 (g(k)) approximation, where k is equal to the cluster vertex deletion number (vertex integrity). Finally, we show a FPT algorithm for when the deletion set produces "nice" connected components, which are components that are bounded in size and satisfy a technical condition.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph

Authors: Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof, and Shengzhe Wang


Abstract
The Strongly Connected Steiner Subgraph (SCSS) problem is a well-studied network design problem that asks for a minimum subgraph that strongly connects a given set of terminals. In this paper, we present several new algorithmic and complexity results for SCSS. As our main result, we show that SCSS can be solved in time 17^{tw} n^O(1) on directed graphs with n vertices when a tree decomposition of the underlying graph of width tw is provided. This improves upon the natural tw^O(tw) n^O(1) time algorithm, and to the best of our knowledge is the first algorithm with this kind of running time for a problem involving strong connectivity. Second, we give an exact exponential-time algorithm that solves SCSS in 2^n n^O(1) time, improving the known bounds for general directed graphs. Finally, we investigate kernelization with respect to vertex cover. We prove that SCSS does not admit a polynomial kernel when parameterized by the size of a vertex cover, unless the polynomial hierarchy collapses. In contrast, we show that the closely related Strongly Connected Spanning Subgraph problem does admit a polynomial kernel under the same parameterization.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Eccentricity Shortest Path Is W[1]-Hard Parameterized by Distance to Spider Graphs

Authors: Sriram Bhyravarapu and A Mohanapriya


Abstract
In this work, we extend the study of the problem Eccentricity Shortest Path (ESP). In this problem, we are given as input a graph G and an integer q, and the goal is to check whether there exists a shortest path P such that every vertex u ∈ V(G) is within a distance at most q from some vertex of P. The problem arises naturally in transportation, logistics, and communication networks, which are often structured around a small set of primary routes. These routes must be both highly efficient and easily reachable from all parts of the network. Dragan and Leitert (TCS 2017) showed that Eccentricity Shortest Path is W[2]-hard when parameterized by q, and Bhyravarapu et al. (IWOCA 2023) demonstrated fixed-parameter tractability when parameterized by the combined parameters feedback vertex set number and q. Both works left open whether tractable algorithms exist when parameterized by the feedback vertex set number alone. We answer this question in negative by showing that Eccentricity Shortest Path is W[1]-hard when parameterized by distance to spider graphs. Since this parameter is a restricted case of feedback vertex set number and path-width, our result implies that Eccentricity Shortest Path remains W[1]-hard under these widely studied structural parameters. On the positive side, we consider the parameter feedback edge set number and present an algorithm running in time 2^𝒪(t log t) n^𝒪(1), where t denotes the feedback edge set number of the input graph with n vertices. Together, these results establish a clear dichotomy between intractability for vertex-deletion based structural parameters and fixed-parameter tractability for the more restrictive vertex/edge-deletion based parameters.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Weighted Chromatic Correlation Clustering and a Parameterized Algorithm

Authors: Kensuke Oowa and Takuro Fukunaga


Abstract
Chromatic correlation clustering (CCC) is the problem of transforming a given edge-colored undirected graph into a disjoint union of monochromatic cliques using at most k edge modifications (edge additions, deletions, or recolorings). This problem generalizes the cluster editing problem, which has been extensively studied in the field of parameterized algorithms. Both CCC and cluster editing are NP-hard, and both are fixed-parameter tractable with respect to k. The fastest known algorithm for CCC runs in O^*(1.92^k) time. We present a new parameterized algorithm for CCC with running time O^*(1.62^k), matching the best known running time for cluster editing. The key idea of our algorithm is to generalize CCC to a nontrivial weighted variant. We adapt several branching rules from the current best algorithm for cluster editing to weighted CCC; however, these rules do not cover all the cases that arise in CCC. By augmenting them with new branching rules specific to CCC, we obtain our improved algorithm.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
On Kernels and Leaves: Searching for Bare and Lush Trees

Authors: Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, and Martin Strehler


Abstract
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem. In many applications, Depth-First Search (DFS) is used to compute a spanning tree of a graph. Such a search tree is constructed by connecting each vertex v with the last vertex the search has visited before v and we call this a last-in tree. By restricting the Maximum (Minimum) Leaf Spanning Tree problem to last-in trees of a graph search, we ask for a search ordering that leads to the largest (smallest) number of leaves in its search tree. Recently, Bergougnoux et al. [Journal of Computer and System Sciences 154 (2025)] have studied the parameterized complexity of these problems for DFS. They showed that the minimization problem is para-NP-hard and the maximization problem is W[1]-hard when parameterized by the number of leaves. When parameterized by the number of internal vertices, both problems have polynomial kernels. Here, we examine whether these results also hold for the variant Lexicographic DFS (LDFS). We show that the hardness results of DFS can be transferred to LDFS. We also present exponential kernels for the number of internal vertices as the parameter. We complement this by showing that polynomial kernels do not exist, unless NP ⊆ coNP / poly. We also consider last-in trees of searches that do not follow the DFS scheme. In contrast to (L)DFS, minimizing the number of internal vertices is para-NP-hard for several searches including Breadth-First Search.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Exploring Minimal Blocking Sets for Kernelization Lower Bounds for ℱ-Minor Deletion

Authors: Ahmed Ghazy, Jakob Greilhuber, and Tim A. Hartmann


Abstract
For Vertex Cover, a minimal blocking set of a graph G is an inclusion-wise minimal vertex set contained in no minimum vertex cover of G. Bougeret et al. [SIDMA 2022] showed that, for all minor-closed graph classes 𝒢, Vertex Cover has a polynomial kernel parameterized by the distance to 𝒢 if and only if 𝒢 has bounded minimal blocking sets. In this work, we explore how far this connection between minimal blocking sets and kernelization extends to ℱ-Minor Deletion parameterized by the deletion distance to 𝒢. For a fixed nonempty finite family ℱ of graphs, given a graph G and integer k, ℱ-Minor Deletion asks whether G can be made free of minors from ℱ by deleting at most k vertices. A minimal ℱ-blocking set of G is an inclusion-wise minimal vertex set not contained in any optimal ℱ-Minor Deletion solution of G. For families ℱ of connected graphs, we show that if some graph class 𝒢 closed under disjoint union has unbounded minimal ℱ-blocking sets, then ℱ-Minor Deletion parameterized by the deletion distance to 𝒢 has no polynomial kernel. This generalizes a result of Hols et al. [SIDMA 2022] for Vertex Cover. We then show that this criterion does not capture all kernelization lower bounds for ℱ-Minor Deletion parameterized by the distance to minor-closed graph classes 𝒢. Motivated by the work of Dekker and Jansen [Discrete Appl. Math. 2024], we study the more general notion of extended ℱ-blocking sets. Under additional conditions, we show that 𝒢 having unbounded minimal extended ℱ-blocking sets rules out polynomial kernels. For every fixed integer η ≥ 1, Pw-η Deletion is the problem of deleting at most k vertices to reduce the pathwidth of a given graph to at most η. We show that it has no polynomial kernel parameterized by the distance to graphs with pathwidth at most η+1. Moreover, for all families ℱ of graphs, each connected and having at least two vertices, we show that ℱ-Minor Deletion parameterized by the distance to graphs with pathwidth at most max_{F ∈ ℱ} pw(F) + 1 has no polynomial kernel. These lower bounds rely in part on a pathwidth analysis of a minor modification of a construction due to Donkers and Jansen [J. Comput. Syst. Sci. 2021].

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Routing Multiple Agents Below the Sum of Distances

Authors: Matthias Bentert, Eduard Eiben, Fedor V. Fomin, and Petr A. Golovach


Abstract
We study Transient Multiagent Pathfinding, a variant of the classical Multi-Agent Pathfinding problem in which a set of agents must be routed without collisions from designated start vertices to designated destination vertices in a graph. We analyze the problem within the above-and-below-guarantee paradigm of parameterized complexity. In particular, we consider the natural upper bound ℒ, given by the sum of the shortest-path distances between pairs of agents' terminals (corresponding to sequential routing of the agents). The parameterization is given by the gap ζ = ℒ - λ between this bound and the target makespan λ, together with the number k of agents. Our main result establishes fixed-parameter tractability for the combined parameter k + ζ. Matching lower bounds show that parameterization by k alone is W[1]-hard, and that parameterization by ζ alone is W[1]-hard when terminals are not required to be distinct. On the positive side, if all terminals are distinct, the problem becomes fixed-parameter tractable when parameterized solely by ζ. Finally, we show that Transient Multiagent Pathfinding is unlikely to admit a polynomial kernel when parameterized by k + ζ. Together, our results provide an almost complete characterization of the parameterized complexity landscape of the problem for the considered parameters.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Minimum Membership Dominating Set and Its Generalization: Leafage vs. Asteroidal Number

Authors: Yuma Tamura, Daichi Wakayama, Akira Suzuki, and Xiao Zhou


Abstract
The Dominating Set problem is known to be fixed-parameter tractable when parameterized by leafage, a structural graph parameter defined on chordal graphs. We investigate whether this tractability extends to its variants with natural constraints. Specifically, we study the Minimum Membership Dominating Set problem and its generalization, the Min. (σ, ρ)-Dominating Set problem. Given a graph G and a positive integer 𝓁, Minimum Membership Dominating Set asks whether there is a dominating set D such that every vertex in G is dominated by at most 𝓁 vertices in D. We first show a negative result: Minimum Membership Dominating Set parameterized by leafage plus 𝓁 is W[1]-hard, demonstrating that even this natural constraint serves as a severe barrier to designing FPT algorithms. To complement this, we present an XP algorithm for the Min. (σ, ρ)-Dominating Set problem parameterized by asteroidal number plus μ, where σ and ρ are finite sets of non-negative integers and μ is the maximum value in σ ∪ ρ. Note that asteroidal number generalizes leafage to arbitrary graphs. Combining this algorithm with our structural bound that every graph G admits a dominating set such that no vertex is dominated by more than 7an(G)-6 vertices, where an(G) denotes the asteroidal number of G, we show that Minimum Membership Dominating Set admits an XP algorithm parameterized solely by asteroidal number.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
O(n)+f(k): Truly Linear FPT

Authors: 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


Abstract
Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter k, one can uncover how NP-hard problems can be effectively tackled in practice. With the advent of big data, the scale of inputs have changed and modern data are often so large that even quadratic dependence in the total input size n is computationally unaffordable. What constitutes a practical algorithm has therefore also changed. Parameterized complexity has traditionally regarded the multiplicative (i.e. f(k)⋅n^{c_m}) and additive (i.e. f(k) + n^{c_a}) definitions of fixed-parameter tractability as interchangeable, even though the associated exponents c_m and c_a are constants whose values may be different. But if the constant c is 1 (that is, we must compute in time linear in the size of the input) - is this distinction still inconsequential? Here, we build on past work to describe and explore the complexity class Truly Linear FPT (TLFPT) - that is O(n)+f(k). We show that it is a strict subset of Linear FPT (LFPT) - that is O(n)⋅f(k) via diagonalization. Despite the restrictiveness of this class, we show that it contains a number of important problems: SAT, Vertex Cover, Min-Max Matching, (n-k)-Coloring, Diverse Pair of Matchings, k-Path, and H-Coloring. Showing that these problems are in TLFPT requires careful consideration of the details of data structures for instance manipulation and access, as is common in linear-time algorithmics. We use a number of different parameters for these problems, including both standard parameters like solution size, as well treedepth and BFS-width, which are particularly well-suited to the TLFPT regime due to their natural connection to depth- and breadth-first search, respectively.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Set Function Maximization with Locality over Graphs

Authors: Tesshu Hanaka, Hirotaka Ono, and Suguru Yamada


Abstract
We study Cardinality-constrained Set Function Maximization over Graphs (CC-SFMG), a framework for cardinality-constrained maximization of graph-local set functions, and its connected variant Connected CC-SFMG. This framework captures a wide range of combinatorial optimization problems, including Maximum k-Coverage and Fixed-Cardinality Graph Partitioning (FCGP), the latter of which generalizes Densest k-Subgraph, Max k-Vertex Cover, and Max (k,n-k)-Cut. Although CC-SFMG is expressively equivalent to cardinality-constrained set function maximization on complete graphs, locality yields a useful organizing principle on sparse graphs. We show that several algorithmic results previously obtained for broad but separate classes of graph optimization problems, most notably FCGP, can be reinterpreted and extended within a single framework, where the relevant algorithmic regime is governed by properties of the objective function, such as submodularity, supermodularity, and nonnegativity or nonpositivity. In particular, this viewpoint lifts existing sparse-graph results from individual problems to broader classes of graph-local objectives. In this paper, we obtain various FPT results for CC-SFMG and Connected CC-SFMG with respect to combinations of the solution size and structural graph parameters (such as degeneracy, maximum degree, and treewidth), under objective function properties such as submodularity or supermodularity. Under additional assumptions controlling the strength of local interactions, we further present FPT approximation schemes for CC-SFMG and Connected CC-SFMG parameterized by the solution size, for nonnegative or nonpositive objective functions. For CC-SFMG, we additionally require submodularity or supermodularity. Our results unify and extend prior results for FCGP within a broader locality-based framework.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Fast and Practical Single-Exponential Algorithms for Branchwidth

Authors: Taiki Kaneda, Yasuaki Kobayashi, and Hisao Tamaki


Abstract
In this paper, we present exact exponential algorithms for computing branchwidth that are fast both in theory and in practice. The running times of these algorithms are single-exponential in the number of vertices. Our basic algorithm is based on a conceptually simple recurrence on vertex sets and computes the branchwidth of an n-vertex hypergraph in time 𝒪^*(4ⁿ). This is the first single-exponential time algorithm for hypergraphs. We have two algorithms tailored specifically for graphs. The first algorithm runs in time 𝒪(3.265ⁿ), improving upon the previously best-known running time of 𝒪(3.4652ⁿ) [Fomin-Mazoit-Todinca, DAM 2009]. Moreover, our computational experiment shows that it overwhelmingly outperforms state-of-the-art practical algorithms for computing branchwidth. The second algorithm performs significantly better in practice on some instances that are hard for the first algorithm.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms

Authors: Rin Saito and Yuma Tamura


Abstract
Enumerating all inclusion-minimal solutions is a powerful approach to designing fixed-parameter tractable (FPT) algorithms. However, for the Feedback Vertex Set problem, this approach faces a fundamental obstacle, as the number of minimal feedback vertex sets is not, in general, bounded by any function of the solution size k. To overcome this limitation, we introduce a data structure called a k-product list, which implicitly encodes all minimal solutions while admitting non-minimal ones to maintain efficiency. We present FPT algorithms for computing such lists not only for the Feedback Vertex Set problem but also for its natural generalizations, the 𝓁-Forest Deletion Set problem and the r-Pseudoforest Deletion Set problem. Our framework yields simple FPT algorithms for a wide range of variants, providing the first such results in several cases and demonstrating the broad applicability of our approach.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern

Authors: Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, and Marie Diana Sieper


Abstract
In this paper, we study the Pattern Avoidance problem of determining whether a given graph G admits a linear vertex order which avoids a given pattern P, i.e., a vertex sequence with some forced and forbidden edges, on every suborder. Such patterns form a natural ordered counterpart to induced subgraphs in the order-invariant setting, and it is known that Pattern Avoidance captures a broad variety of graph problems including Bandwidth, Vertex Coloring, Queue Number, and extends to vertex-deletion problems such as Odd Cycle Transversal. We show that Pattern Avoidance is Σ_2^P-complete and furthermore remains intractable (in both the classical and parameterized sense) even under a variety of severe restrictions to both the pattern P and the graph G. As our main contributions, we complement these lower bounds with the following tractability results, which provide a unifying framework for recognizing pattern-definable graph classes: - a fixed-parameter algorithm w.r.t. the vertex integrity of G plus |V(P)|, - a fixed-parameter algorithm w.r.t. the neighborhood diversity of G plus |E(P)|, and - a polynomial algorithm for Pattern Avoidance on forests for almost all constant-sized patterns.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
c-Packedness Versus λ-Low-Density in Geometric Graphs: Theory and Practice

Authors: Gregor Diatzko, Félix Lasseux, and Sabine Storandt


Abstract
When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are c-packedness and λ-low density, both of which locally restrict graph complexity. Parameterized algorithms based on these parameters have been developed for computing well-separated pair decompositions, balanced separators, as well as distance oracles. Despite this theoretical progress, the practical applicability of algorithms parameterized by c or λ remains unclear. While c-packed and λ-low-density graphs have been proposed as realistic models for road networks, the actual parameter values of large real-world instances have so far remained unknown, and existing theoretical guarantees are partially too loose for practical usage. In this paper we first devise scalable implementations for the approximate computation of c and the exact computation of λ. Our experimental evaluation on road networks with millions of edges reveals a significant gap between the two parameters. On the theoretical side we prove that c ∈ O(λ √ n) which complements the known result that λ ∈ O(c). Furthermore we present improved parameterized algorithms for balanced separator computation that reduce the separator size in theory and practice. We also show how to compute a tree decomposition with a width linear in the respective parameterized balanced separator size in polynomial time. This structural result yields a variety of new algorithmic consequences. Among them is an exact distance oracle with query time O(c) for c-packed graphs after polynomial-time preprocessing, which improves upon the previous O(c log n) bound. Our experiments demonstrate that the proposed techniques efficiently produce small balanced separators and enable the construction of concise exact distance oracles on large road networks.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
On the Hardness of Strong Metric Dimension

Authors: Prafullkumar Tale


Abstract
Let G be a connected simple undirected graph. A vertex w is said to strongly resolve a pair of distinct vertices u, v ∈ V(G) if either there exists an isometric path (i.e. a shortest path) from w to u that contains v, or there exists an isometric path from w to v that contains u. A subset S ⊆ V(G) is said to strongly resolve G if every pair of distinct vertices of G is strongly resolved by at least one vertex in S. In the Strong Metric Dimension problem, the input consists of a graph G and a positive integer k, and the objective is to determine whether there exists a subset S ⊆ V(G) of size at most k that strongly resolves G. In this article, we show that Strong Metric Dimension is NP-complete even on (i) graphs of diameter two, and (ii) graphs of constant pathwidth and constant feedback vertex set number.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm

Authors: Fedor V. Fomin, Petr A. Golovach, and Yash Hiren More


Abstract
In the Ultrametric Violation Distance problem, we are given a set of distances between n points, and the goal is to modify the minimum number of distances so that the resulting set forms a valid ultrametric. In other words, the task is to fit an ultrametric to the given data, where the quality of the fit is measured by the 𝓁₀-norm of the error. While variants of this problem under the 𝓁_∞ and 𝓁₁-norms have been well studied, the complexity of Ultrametric Violation Distance under the 𝓁₀-norm remained largely unexplored until recently. This changed with the work of Cohen-Addad, Fan, Lee, and Mesmay [FOCS 2022], who introduced a constant-factor approximation algorithm. Significant further progress on approximation algorithms was made in subsequent work by Charikar and Gao [SODA 2024], and by An, Kao, Lee, and Lee [FOCS 2025]. In this paper, we initiate a systematic study of Ultrametric Violation Distance from the perspectives of kernelization and fixed-parameter tractability (FPT). By the work of Fan, Gilbert, Raichel, Sonthalia, and Van Buskirk [SWAT 2020], the problem is known to be FPT when parameterized by the number of violated distances k. We show that the problem admits a kernel with 𝒪(k²) points. Additionally, we present a single-exponential-time algorithm with running time 9^k ⋅ n^𝒪(1), which is asymptotically tight.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
Faster Parameterized Broadcasting

Authors: Édouard Bonnet, Carl Feghali, and Manolis Vasilakis


Abstract
Given a connected graph G and a source s ∈ V(G), what is the smallest number of rounds necessary for all vertices of G to receive a message initially only held by s, where at each round every informed vertex passes the message to one of its neighbors? This problem is called Telephone Broadcast and is surprisingly hard: it remains NP-hard on cycles intersecting at a single shared vertex, in particular, graphs of pathwidth 2 with a linear feedback vertex set of size 1, as well as on graphs with treedepth at most 6 [Egami et al.; MFCS '25]. Vertex cover number, vertex integrity, and distance to clique are among the few parameters for which Telephone Broadcast is fixed-parameter tractable. There is a 2^𝒪(vc³) n^𝒪(1)-time algorithm parameterized by vertex cover number vc [Fomin, Fraigniaud, Golovach; TCS '24], a double-exponential algorithm parameterized by vertex integrity vi, and a 2^𝒪(k²) n^𝒪(1)-time algorithm parameterized by distance to clique k [Egami et al.; MFCS '25]. In this paper, we give improved parameterized algorithms for Telephone Broadcast with running times 2^𝒪(vc log vc) n^𝒪(1), 2^𝒪(vi² log vi) n^𝒪(1), and 2^𝒪(k log k) n^𝒪(1). The main ingredient that makes our algorithms faster is a Turing reduction to edge-weighted b-Matching.

Cite as

É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)


Copy BibTex To Clipboard

@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}
}
Document
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties

Authors: Radu Curticapean and Mingjun Liu


Abstract
Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems #IndSub(Φ) for fixed graph properties Φ: Given an input graph G and k ∈ ℕ, count the k-vertex subsets S ⊆ V(G) such that the induced subgraph G[S] satisfies Φ. For recursively enumerable Φ, it is known that #IndSub(Φ) is either #W[1]-hard or fixed-parameter tractable. A direct classification depending on Φ however still remains open. In particular, the status was open for the property of graphs without nontrivial automorphisms, also mentioned in a very recent survey on parameterized counting by Roth (Comput. Sci. Rev. 2026). This is a natural property that evades all currently known techniques for proving #W[1]-hardness, including a general toolkit based on Fourier analysis that was very recently introduced by Curticapean and Neuen (SODA 2025). In this paper, we show that counting induced k-vertex graphs without nontrivial automorphisms is #W[1]-hard by constructing "clique scaffolds", i.e., problem-specific restrictions of the property that enable a reduction from the k-clique problem. More generally, we show that for every finite group Q, counting k-vertex induced subgraphs with automorphism group Q is #W[1]-hard.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest

Authors: Alexander Leonhardt, Manuel Penschuck, and Mathias Weller


Abstract
The 11th Parameterized Algorithms and Computational Experiments Challenge (PACE 2026) considered the Maximum-Agreement Forest problem: given a set of phylogenetic trees with identical leaf labels, it asks for a common forest with as few components as possible present in each input tree. Alongside the established exact and heuristic tracks, we introduced a lower-bound track focussing on fast solutions within a prescribed distance from the optimum. We also published STRIDE, a tool for testing solvers on thousands of instances and sharing solutions; a data repository containing 920k unique solutions for more than 30k instances is provided with this report. Each track used 400 benchmark instances drawn from biological data and several generators. Overall, PACE 2026 had 64 participants submitting 46 solvers on three tracks. This report describes the challenge setup, benchmark selection, results, and outlines the submitted solvers' approaches. We also report on an experiment in which an autonomous AI agent developed a competitive exact solver.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: Maffe - A Lagrangian Approach to Maximum Agreement Forests

Authors: Anton Hoof and Tobias Röhr


Abstract
We describe Maffe, a solver for the maximum agreement forest (MAF) problem on rooted bifurcating phylogenetic trees. Maffe won all three tracks of the PACE 2026 Challenge (exact, heuristic, and lower bound). It combines reduction rules, a branch-and-price exact solver with a pricer derived from a Lagrangian relaxation, and a Lagrangian relaxation-based column generation heuristic for larger instances.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: Woodcutter, a Branch-Cut-And-Price Algorithm Computing Maximum Agreement Forests

Authors: Johannes Varga, Enrico Iurlano, and Hai Xia


Abstract
We describe woodcutter, our solver for the Parameterized Algorithms and Computational Experiments (PACE) challenge of 2026 involving the (rooted and binary) Maximum Agreement Forest (MAF) problem. The solver’s core is an exact branch-cut-and-price procedure over a set-packing formulation whose columns are agreement subtrees. Columns are generated by solving a weighted variant of the Maximum Agreement Subtree problem on the internal vertices of the input trees, and the linear programming bound is strengthened by clique cuts and closed by branching. This branch-cut-and-price procedure is preceded by reduction rules and a cluster decomposition.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
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


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}
}
Document
PACE Solver Description
PACE Solver Description: Simulated Annealing for the Maximum Agreement Forest Problem

Authors: Manuel Ronhaar


Abstract
We describe a novel simulated annealing approach to quickly find good solutions to the maximum agreement forest problem. To further improve the found solutions and prove lower bounds we employ column generation.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: A Sparse Pricer for Maximum Agreement Forests

Authors: Daniel Busch and Britta Dorn


Abstract
We briefly describe the solver "Dakopen", submitted to the heuristic track of the PACE Challenge 2026 on the Maximum Agreement Forest problem for two rooted binary trees. After applying data reduction rules, Dakopen solves the LP relaxation of a component-based formulation by column generation and then improves the incumbent in a time-limited branch-and-price phase. The pricing problem is a maximum agreement subtree problem with weights on leaves and internal vertices. Our sparse pricer stores only vertex pairs whose subtrees share a leaf and reuses their evaluation order across dual solutions, so each pricing pass takes time linear in the number of stored pairs.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: CherryPicker, a Heuristic Solver for the Maximum Agreement Forest Problem

Authors: Jakub Dziura and Tomáš Masařík


Abstract
This document contains a short description of the solver CherryPicker for the Maximum Agreement Forest (MAF) problem, submitted to the heuristic and lower-bound tracks of the PACE Challenge 2026. The solver placed second in the lower-bound track and fourth in the heuristic track. The heuristic solver combines a small set of standard reduction rules - singleton elimination, common-cherry reduction, and a forced-pendant-cut rule - with an iterated local search (ILS). For the lower-bound track, the solver uses a column generation method.

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: Tree-Of-Life - Branching Solver for Maximum Agreement Forests

Authors: Jonas Seiler


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}
}
Document
PACE Solver Description
PACE Solver Description: Sherby

Authors: Nicolas Bousquet, Bertrand Marchand, Arnaud Mary, and Sven Meyer


Abstract
This is a description of the "sherby" solver for the exact track of PACE 2026, on the computation of maximum agreement forests between phylogenetic trees. We combine two approaches. One is a reduction to maximum weighted clique, where each vertex represents an "agreement leaf-set" between the input trees. The other is a Max-SAT formulation, on which an external solver (EvalMaxSAT) is called. Our code is available at https://github.com/bmarchand/sherby-pace-2026-solver

Cite as

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)


Copy BibTex To Clipboard

@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}
}
Document
PACE Solver Description
PACE Solver Description: Hitting Pair DBS and AF-DFS

Authors: Rens Versnel


Abstract
This paper describes the 6th-place submission to the Exact Track of PACE Challenge 2026. This solver consists of two parts: a depth-bounded search akin to existing FPT algorithms [Shi et al., 2018] for this problem, and a depth-first search procedure that enumerates all agreement forests of the instance using incompatible triple and path pair constraints.

Cite as

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)


Copy BibTex To Clipboard

@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}
}

Filters


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