IPEC 2025 : International Symposium on Parameterized and Exact Computation

The International Symposium on Parameterized and Exact Computation (IPEC, https://algo-conference.org/2025/ipec/) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 20th edition will be held in Warsaw, Poland, as part of ALGO 2025, which also hosts ESA 2025 and other specialized conferences and workshops.

IPEC 2025 invites papers presenting original research in the area of parameterized and exact algorithms and complexity. Topics include but are not limited to the following:
- new techniques for the design and analysis of parameterized and exact algorithms;
- fixed-parameter tractability and kernelization results;
- parameterized complexity theory;
- parameterized (in)approximability results;
- relationships between parameterized complexity and traditional complexity classifications;
- applications of parameterized and exact computation;
- engineering and experimentation of exact, parameterized, and kernelization algorithms.

*Important Dates*
Abstract submission / paper registration: June 27th (23:59 AoE)
Submission deadline: June 30th (23:59 AoE)
Notification: August 7th
Conference dates: September 17-19 (Wed-Fri)

*Submission Guidelines*
We welcome submissions of the full version of the paper. Regardless, the first 12 pages (excluding the title page) should be enough to assess the paper and contain a summary of the main results, their motivation and importance, and evidence of their correctness. As previous years, IPEC 2025 uses a lightweight double-blind model for the reviewing process.
For further details on the submission guidelines and for the submission link, please refer to our website: https://algo-conference.org/2025/ipec/

*Conference details*
We are excited that Martin Koutecky has agreed to give the IPEC 2025 invited tutorial. There will also be an invited talk by (one of) the 2025 EATCS-IPEC Nerode Prize winner(s).
In addition, IPEC hosts the presentation of the results from PACE 2025 (the Parameterized Algorithms and Computational Experiments Challenge). This year, the focus of PACE is the Dominating Set and Hitting Set problems. For more details on the PACE challenge, see their website: https://pacechallenge.org/2025/.

*Program Committee*
Akanksha Agrawal (co-chair)
Matthias Bentert
Fedor V. Fomin
Markus Hecher
Danny Hermelin
Tanmay Inamdar
Yusuke Kobayashi
Stefan Kratsch
Alexandra Lassota
Daniel Lokshtanov
Kitty Meeks
Fabrizio Montecchiani
Eunjin Oh
Yota Otachi
Michał Pilipczuk
Manuel Sorge
Uéverton Souza
Erik Jan van Leeuwen (co-chair)
Jie Xue
Anna Zych-Pawlewicz