| 2025 | 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 Akanksha Agrawal, Erik Jan van Leeuwen |
| 2025 | A Brief History of Parameterized Algorithms for Block-Structured Integer Programs (Invited Talk). Martin Koutecký |
| 2025 | A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers. Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler |
| 2025 | A Note on the Parameterised Complexity of Coverability in Vector Addition Systems. Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks |
| 2025 | A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs. Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden |
| 2025 | A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma. Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi |
| 2025 | An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange. Bart M. P. Jansen, Jeroen S. K. Lamme, Ruben F. A. Verhaegh |
| 2025 | Binary k-Center with Missing Entries: Structure Leads to Tractability. Tobias Friedrich, Kirill Simonov, Farehe Soheil |
| 2025 | Boundaried Kernelization via Representative Sets. Leonid Antipov, Stefan Kratsch |
| 2025 | Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth. Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo |
| 2025 | Complexity of Local Search for CSPs Parameterized by Constraint Difference. Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng |
| 2025 | Designing Compact ILPs via Fast Witness Verification. Michal Wlodarczyk |
| 2025 | Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time. Jonne Visser, Hans L. Bodlaender |
| 2025 | Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors. Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, Jacob Stegemann |
| 2025 | Efficient Enumeration of k-Plexes and k-Defective Cliques. Mohamed Jiddou, George Manoussakis |
| 2025 | Enumeration Kernels for Vertex Cover and Feedback Vertex Set. Marin Bougeret, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Ignasi Sau |
| 2025 | Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas. Takashi Horiyama, Yuto Okura, Kazuhisa Seto, Junichi Teruyama |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number. Prafullkumar Tale |
| 2025 | Hamiltonicity Parameterized by Mim-Width Is (Indeed) Para-NP-Hard. Benjamin Bergougnoux, Lars Jaffke |
| 2025 | Hitting Geodesic Intervals in Structurally Restricted Graphs. Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike |
| 2025 | Kernelization for H-Coloring. Yael Berkman, Ishay Haviv |
| 2025 | New Algorithm for Combinatorial n-Folds and Applications. Klaus Jansen, Kai Kahler, Lis Pirotton, Malte Tutas |
| 2025 | On Maximum 2-Clubs. Joanne Dumont, Michael Lampis, Mathieu Liedloff, Anthony Perez, Ioan Todinca |
| 2025 | On the Complexity of Secluded Path Problems. Tesshu Hanaka, Daisuke Tsuru |
| 2025 | PACE Solver Description: Bad Dominating Set Maker. Alexander Dobler, Simon Dominik Fink, Mathis Rocton |
| 2025 | PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems. Sylwester Swat |
| 2025 | PACE Solver Description: Minimum Hitting Set Computation via Core-Guided MaxSAT Solving. André Schidler |
| 2025 | PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem. Jona Dirks, Enna Gerhard, Victoria Kaial, Lucas Lorieau |
| 2025 | PACE Solver Description: Reductions and Heuristic Search for the Dominating Set Problem and the Hitting Set Problem. Florian Fontan, Guillaume Verger |
| 2025 | PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set. Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard |
| 2025 | PACE Solver Description: UzL Solver for Dominating Set and Hitting Set. Max Bannach, Florian Chudigiewitsch, Marcel Wienöbst |
| 2025 | PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem. Canhui Luo, Qingyun Zhang, Zhouxing Su, Zhipeng Lü |
| 2025 | Parameterized Algorithms for Diversity of Networks with Ecological Dependencies. Mark Jones, Jannik Schestag |
| 2025 | Parameterized Complexity of Scheduling Unit-Time Jobs with Generalized Precedence Constraints. Christina Büsing, Maurice Draeger, Corinna Mathwieser |
| 2025 | Parameterized Complexity of Vehicle Routing. Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma |
| 2025 | Parameterized Maximum Node-Disjoint Paths. Michael Lampis, Manolis Vasilakis |
| 2025 | The PACE 2025 Parameterized Algorithms and Computational Experiments Challenge: Dominating Set and Hitting Set. Mario Grobler, Sebastian Siebertz |
| 2025 | Tight Bounds for Connected Odd Cycle Transversal Parameterized by Clique-Width. Narek Bojikian, Stefan Kratsch |
| 2025 | Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2025 | Treedepth Inapproximability and Exponential ETH Lower Bound. Édouard Bonnet, Daniel Neuen, Marek Sokolowski |
| 2025 | Uniformity Within Parameterized Circuit Classes. Steef Hegeman, Jan Martens, Alfons Laarman |