


default search action
20th IPEC 2025: Warsaw, Poland
- Akanksha Agrawal

, Erik Jan van Leeuwen
:
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025. LIPIcs 358, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-407-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii

- Martin Koutecký:

A Brief History of Parameterized Algorithms for Block-Structured Integer Programs (Invited Talk). 1:1-1:20 - Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, Jacob Stegemann:

Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors. 2:1-2:17 - Michael Lampis, Manolis Vasilakis:

Parameterized Maximum Node-Disjoint Paths. 3:1-3:15 - Tesshu Hanaka, Daisuke Tsuru:

On the Complexity of Secluded Path Problems. 4:1-4:16 - Yael Berkman, Ishay Haviv:

Kernelization for H-Coloring. 5:1-5:17 - Leonid Antipov, Stefan Kratsch:

Boundaried Kernelization via Representative Sets. 6:1-6:13 - Christina Büsing, Maurice Draeger, Corinna Mathwieser:

Parameterized Complexity of Scheduling Unit-Time Jobs with Generalized Precedence Constraints. 7:1-7:16 - Tobias Friedrich, Kirill Simonov, Farehe Soheil:

Binary k-Center with Missing Entries: Structure Leads to Tractability. 8:1-8:19 - Bart M. P. Jansen, Jeroen S. K. Lamme, Ruben F. A. Verhaegh:

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange. 9:1-9:15 - Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma:

Parameterized Complexity of Vehicle Routing. 10:1-10:17 - Mark Jones, Jannik Schestag:

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies. 11:1-11:21 - Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer:

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. 12:1-12:18 - Joanne Dumont, Michael Lampis, Mathieu Liedloff, Anthony Perez, Ioan Todinca:

On Maximum 2-Clubs. 13:1-13:14 - Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi:

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma. 14:1-14:17 - Klaus Jansen, Kai Kahler, Lis Pirotton, Malte Tutas:

New Algorithm for Combinatorial n-Folds and Applications. 15:1-15:15 - Michal Wlodarczyk:

Designing Compact ILPs via Fast Witness Verification. 16:1-16:18 - Édouard Bonnet, Daniel Neuen, Marek Sokolowski:

Treedepth Inapproximability and Exponential ETH Lower Bound. 17:1-17:10 - Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:

Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth. 18:1-18:18 - Narek Bojikian, Stefan Kratsch:

Tight Bounds for Connected Odd Cycle Transversal Parameterized by Clique-Width. 19:1-19:15 - Jonne Visser, Hans L. Bodlaender:

Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time. 20:1-20:14 - Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden:

A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs. 21:1-21:17 - Mohamed Jiddou, George Manoussakis:

Efficient Enumeration of k-Plexes and k-Defective Cliques. 22:1-22:16 - Marin Bougeret, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Ignasi Sau:

Enumeration Kernels for Vertex Cover and Feedback Vertex Set. 23:1-23:18 - Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks:

A Note on the Parameterised Complexity of Coverability in Vector Addition Systems. 24:1-24:19 - Takashi Horiyama, Yuto Okura, Kazuhisa Seto, Junichi Teruyama:

Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas. 25:1-25:15 - Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng:

Complexity of Local Search for CSPs Parameterized by Constraint Difference. 26:1-26:17 - Steef Hegeman, Jan Martens, Alfons Laarman:

Uniformity Within Parameterized Circuit Classes. 27:1-27:16 - Prafullkumar Tale:

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number. 28:1-28:14 - Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike:

Hitting Geodesic Intervals in Structurally Restricted Graphs. 29:1-29:16 - Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler:

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers. 30:1-30:19 - Benjamin Bergougnoux, Lars Jaffke:

Hamiltonicity Parameterized by Mim-Width Is (Indeed) Para-NP-Hard. 31:1-31:10 - Mario Grobler, Sebastian Siebertz:

The PACE 2025 Parameterized Algorithms and Computational Experiments Challenge: Dominating Set and Hitting Set. 32:1-32:17 - Jona Dirks, Enna Gerhard, Victoria Kaial, Lucas Lorieau:

PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem. 33:1-33:4 - Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard:

PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set. 34:1-34:5 - Alexander Dobler, Simon Dominik Fink, Mathis Rocton:

PACE Solver Description: Bad Dominating Set Maker. 35:1-35:5 - Florian Fontan, Guillaume Verger:

PACE Solver Description: Reductions and Heuristic Search for the Dominating Set Problem and the Hitting Set Problem. 36:1-36:3 - André Schidler:

PACE Solver Description: Minimum Hitting Set Computation via Core-Guided MaxSAT Solving. 37:1-37:4 - Sylwester Swat:

PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems. 38:1-38:4 - Max Bannach, Florian Chudigiewitsch, Marcel Wienöbst:

PACE Solver Description: UzL Solver for Dominating Set and Hitting Set. 39:1-39:4 - Canhui Luo, Qingyun Zhang, Zhouxing Su, Zhipeng Lü:

PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem. 40:1-40:4

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














