The International Symposium on Parameterized and Exact Computation (IPEC) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 17th edition will be part of ALGO 2022, which also hosts ESA 2022 and other specialized conferences and workshops. COVID-19 restrictions permitting, ALGO 2022 will take place on September 7-9, 2022 in Potsdam, Germany.
- Full Paper Submission: June 24, 2022 (23:59 AoE)
- Notification of acceptance: August 1, 2022
- Conference dates: September 7-9, 2022 in Potsdam, Germany (IPEC will end on Friday at 11 am, followed by an ALGO keynote and lunch)
- Camera-ready version: October 9, 2022
Call for Papers
The 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) invites papers presenting original research in the area of parameterized and exact algorithms and complexity.
The topics include but are not limited to:
- 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.
Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee. The conference proceedings will to be published in the Leibniz International Proceedings in Informatics (LIPIcs) series after the conference. A special issue of Algorithmica is planned for selected papers presented at IPEC 2022.
The program committee may award a Best Paper Award and a Best Student Paper Award, both of which may be exceptionally split between two or more papers. A student is someone who has not received a PhD degree before the full paper submission deadline. A paper accepted to the conference is eligible for the Best Student Paper Award if either all its authors are students, or besides student co-author(s) there is one non-student co-author that confirms, at the moment of submission, that a clear majority of conceptual work on the paper was done by the student co-author(s). In the latter case, it is moreover expected that a student gives the presentation at the conference. Papers co-authored by members of the program committee are not eligible for the Best Paper Award or the Best Student Paper Award.
Authors are invited to submit an anonymized extended abstract, which should contain a summary of the main results, their motivation and importance, and evidence of their correctness. The authors should take particular notice that the extended abstract presents their work in a comprehensible and self-contained way. The quality of the presentation in the extended abstract will be taken into account by the program committee.
The conference employs a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, references should not be omitted or anonymized.
Authors must submit their papers electronically via EasyChair. Papers must be formatted in LIPIcs style; no changes to font size, page margins, etc., are permitted. Line numbers must be activated. There is no page limit for the submission, but the PC may only look at the first 10 pages, so make sure the most important information appears early. Results previously published in conference proceedings or a journal (or scheduled for publication prior to IPEC) will not be considered.
Authors are encouraged to make the full, de-anonymized versions of their submissions freely accessible in an online repository such as arXiv or ECCC. Program committee members (except the co-chairs) are allowed to submit papers.
Submission website: https://easychair.org/my/conference?conf=ipec2022
Conflicts of Interest
IPEC takes conflicts of interest, both real and perceived, seriously. Authors are responsible for declaring conflicts of interest with any of the PC members. You have a conflict of interest with:
- past advisors and students;
- people with the same affiliation; and
- any recent (≤3 years) coauthors and collaborators.
We are planning the following special events:
- an invited talk by Bruno Courcelle, the 2022 EATCS-IPEC Nerode Prize winner
- an invited tutorial by Eunjung Kim (Université Paris-Dauphine, PSL Research University, CNRS) on Directed flow-augmentation
- a 1-hour session where the results of the 7th Parameterized Algorithms and Computational Experiments Challenge (PACE 2022) will be presented
- Robert Ganian and Viktoriia Korchemna. Slim Tree-Cut Width
- Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke and Paloma de Lima. XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure
- Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper and Karol Węgrzycki. Computing Generalized Convolutions Faster Than Brute Force
- Yosuke Mizutani and Blair Sullivan. Improved Parameterized Complexity of Happy Set Problems
- Danny Hermelin, Yuval Itzhaki, Hendrik Molter and Dvir Shabtay. Hardness of Interval Scheduling on Unrelated Machines
- Jelle Oostveen and Erik Jan van Leeuwen. Parameterized Complexity of Streaming Diameter and Connectivity Problems
- Sayan Bandyapadhyay, Fedor Fomin, Petr Golovach, Nidhi Purohit and Kirill Simonov. FPT Approximation for Fair Minimum-Load Clustering
- Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit and Saket Saurabh. Exact Exponential Algorithms for Clustering Problems
- Falko Hegerfeld and Stefan Kratsch. Towards exact structural thresholds for parameterized complexity
- Esther Galby, Daniel Marx, Philipp Schepper, Roohani Sharma and Prafullkumar Tale. Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Hans L. Bodlaender, Carla Groenland and Hugo Jacob. On the parameterized complexity of computing tree-partitions
- Hjalmar Schulz, André Nichterlein, Rolf Niedermeier and Christopher Weyand. Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time
- Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk and Michał Pilipczuk. On the Complexity of Problems on Tree-structured Graphs
- Eduard Eiben, Clément Rambaud and Magnus Wahlström. On the parameterized complexity of symmetric directed multicut
- Guillaume Ducoffe. Obstructions to faster diameter computation: Asteroidal sets
- Akanksha Agrawal, Saket Saurabh and Meirav Zehavi. A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
- Maher Mallem, Claire Hanen and Alix Munier Kordon. Parameterized complexity of a parallel machine scheduling problem
- Leon Kellerhals, Tomohiro Koana and Pascal Kunz. Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
- Johannes Blum, Yann Disser, Andreas Feldmann, Siddharth Gupta and Anna Zych-Pawlewicz. On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension
- Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes and Stéphan Thomassé. Twin-width VIII: delineation and win-wins
- Christian Komusiewicz and Nils Morawietz. Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Dániel Marx, Govind S. Sankar and Philipp Schepper. Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
- Ishay Haviv. A Fixed-Parameter Algorithm for the Schrijver Problem
- Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana and Abhishek Sahu. Parameterized Complexity of Perfectly Matched Sets
- Brage I. K. Bakkane and Lars Jaffke. On the hardness of generalized domination problems parameterized by mim-width
- Christian Komusiewicz (Marburg University)
- Christophe Paul (Laboratoire d’Informatique Robotique et Microélectronique de Montpellier)
- Cornelius Brand (Technische Universität Wien)
- Édouard Bonnet (ENS Lyon)
- Holger Dell (Goethe University Frankfurt, ITU Copenhagen, and BARC, co-chair)
- Jesper Nederlof (Utrecht University, co-chair)
- Karol Węgrzycki (Saarland University and Max Planck Institute for Informatics)
- M.S. Ramanujan (University of Warwick)
- Marvin Künnemann (TU Kaiserslautern)
- Michael Lampis (Paris Dauphine University)
- Neeldhara Misra (IIT Gandhinagar)
- Paweł Rzążewski (Warsaw University of Technology and University of Warsaw)
- Radu Curticapean (ITU Copenhagen and BARC)
- René van Bevern (Huawei Cloud Technologies Co., Ltd.)
- Robert Ganian (Technische Universität Wien)
- Roohani Sharma (Max Planck Institute for Informatics)
- Sándor Kisfaludi-Bak (Aalto University)
- Valia Mitsou (Research Institute on the Foundations of Computer Science (IRIF) and Paris Diderot University)
- Dániel Marx (2020 – 2023)
- Eun Jung Kim (2019 – 2022)
- Fedor Fomin (2021 – 2024)
- Holger Dell (2021 – 2024)
- Jesper Nederlof (2021 – 2024)
- Marcin Pilipczuk (2019 – 2022, chair)
- Meirav Zehavi (2020 – 2023)
- Petr Golovach (2020 – 2023)
- Yixin Cao (2019 – 2022)
PC chair report
These slides were presented by the PC chairs at the IPEC 2022 business meeting.
The IPEC 2022 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series after the conference.