IPEC 2024


The International Symposium on Parameterized and Exact Computation (IPEC) is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 19th edition will be part of ALGO 2024, which also hosts ESA 2024 and other specialized conferences and workshops.

Important Dates

  • Abstract submission: 26 June 2024 (AoE)
  • Paper submission: 30 June 2024 (AoE)
  • Notification: 05 August 2024
  • Conference: 04-06 September 2024
  • Camera-ready version: early October

Submission Guidelines

The papers are submitted via EasyChair (the submission is currently not possible, it will be open soon).

Each submission is required to be in the LIPIcs format. We welcome submissions of the full version of the paper, with title page containing only the title and abstract and the references placed at the very end of paper. However, the first 12 pages (excluding the title page) should be enough to assess the paper. In particular, PC members and potential subreviewers may treat the these 12 pages as the short version (the rest being read at their discretion).

When submitting a paper, please indicate Conflict of Interest with PC members. A CoI is limited to the following categories:

  • Family member or close friend.
  • Ph.D. advisor or advisee (no time limit), or postdoc or undergraduate mentor or mentee within the past 5 years.
  • Same affiliation.
  • Involved in an alleged incident of harassment. (It is not required that the incident be reported.)
  • Reviewer owes author a favor (e.g., recently requested a reference letter).
  • Frequent or recent collaborator whom you believe cannot objectively review your work.

Invited talks

The invited tutorial will be given by Szymon Toruńczyk (University of Warsaw, Poland).
Furthermore, IPEC will host an invited talk by (one of) the 2024 EATCS-IPEC Nerode Prize winner(s).

PACE 2024

The Parameterized Algorithms and Computational Experiments Challenge (PACE) was conceived in Fall 2015 to deepen the relationship between parameterized algorithms and practice. Topics from multivariate algorithms, exact algorithms, fine-grained complexity, and related fields are in scope.

This year’s challenge is about the one-sided crossing minimization problem (OCM). This problem involves arranging the nodes of a bipartite graph on two layers (typically horizontal), with one of the layers fixed, aiming to minimize the number of edge crossings. OCM is one of the basic building block used for drawing hierarchical graphs. It is NP-hard, even for trees, but admits good heuristics, can be constant-factor approximated and solved in FPT time.

For more details on the timeline and past challenges, please visit the PACE website.


Program Committee

  • Édouard Bonnet (ENS Lyon, LIP, France) (co-chair)
  • Nick Brettell (Victoria University of Wellington, New Zealand)
  • David Eppstein (University of California, Irvine, USA)
  • Piotr Faliszewski (AGH University, Kraków, Poland)
  • Andreas Emil Feldmann (University of Sheffield, UK)
  • Jacob Focke (CISPA Helmholtz Center for Information Security, Saarbrucken, Germany)
  • Panos Giannopoulos (City, University of London, UK)
  • Petr Hliněný (Masaryk University, Brno, Czech Republic)
  • Lars Jaffke (University of Bergen, Norway)
  • Petteri Kaski (Aalto University, Finland)
  • Eunjung Kim (CNRS, France and KAIST, South Korea)
  • Tuukka Korhonen (University of Bergen, Norway)
  • Stephan Kreutzer (TU Berlin, Germany)
  • Paloma T. Lima (IT University of Copenhagen, Denmark)
  • Karolina Okrasa (Warsaw University of Technology, Poland)
  • Anthony Perez (LIFO, University of Orléans, France)
  • Paweł Rzążewski (Warsaw University of Technology and University of Warsaw, Poland) (co-chair)
  • Ignasi Sau (LIRMM, CNRS, Université de Montpellier, France)
  • Darren Strash (Hamilton College, Clinton, USA)
  • Ryan Williams (Massachusetts Institute of Technology, Cambridge, USA)

Steering Committee