IPEC 2022

Guest Editors: Jesper Nederlof and Holger Dell

This special collection is dedicated to the 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).

Journal

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal...

Jesper Nederlof

Utrecht University, The Netherlands
Holger Dell

Goethe University Frankfurt, Germany

Showing 1-6 of 6 articles

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
Hans L. Bodlaender
Carla Groenland
Paloma T. Lima
OriginalPaper Open access 04 November 2024 Pages: 465 - 506
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Dániel Marx
Govind S. Sankar
Philipp Schepper
OriginalPaper Open access 15 October 2024 Pages: 22 - 88
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Jelle J. Oostveen
Erik Jan van Leeuwen
OriginalPaper Open access 19 June 2024 Pages: 2885 - 2928
Slim Tree-Cut Width
Robert Ganian
Viktoriia Korchemna
OriginalPaper Open access 01 June 2024 Pages: 2714 - 2738
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Esther Galby
Dániel Marx
Prafullkumar Tale
OriginalPaper Open access 29 December 2023 Pages: 1428 - 1474
Computing Generalized Convolutions Faster Than Brute Force
Barış Can Esmer
Ariel Kulik
Karol Węgrzycki
OriginalPaper Open access 06 October 2023 Pages: 334 - 366

IPEC 2022

Participating journal

Algorithmica

Editors

Jesper Nederlof

Holger Dell

Articles

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Parameterized Complexity of Streaming Diameter and Connectivity Problems

Slim Tree-Cut Width

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Computing Generalized Convolutions Faster Than Brute Force