Scope

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. 

Accepted papers

    Jonas Lill, Kalina Petrova, and Simon Weber: Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
    Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, and Amer Mouawad: Parameterized Shortest Path Reconfiguration
    Jakub Balabán, Robert Ganian, and Mathis Rocton: Twin-Width Meets Feedback Edges and Vertex Integrity
    Peter Strulo, M. S. Ramanujan, Václav Blažej, and Sushmita Gupta: On Controlling Knockout Tournaments Without Perfect Information
    Ishay Haviv and Dror Rabinovich: Kernelization for Orthogonality Dimension
    Peter Strulo, Václav Blažej, M. S. Ramanujan, and Satyabrata Jana: On the Parameterized Complexity of Eulerian Strong Component Deletion
    Marvin Künnemann and Mirza Redzic: Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
    Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis: Parameterised distance to local irregularity
    Matthias Kaul, Matthias Mnich, and Hendrik Molter: Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
    Tomohiro Koana, Nidhi Purohit, and Kirill Simonov: Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
    Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, and Ziena Zeif: Combining Crown Structures for Vulnerability Measures
    Yuxi Liu and Mingyu Xiao: Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k
    Carla Groenland, Jesper Nederlof, and Tomohiro Koana: A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor
    Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond: Kick the cliques
    Paul Bastide and Carla Groenland: Quasi-linear distance query reconstruction for graphs of bounded treelength
    Ilan Doron-Arad, Ariel Kulik and Fabrizio Grandoni: Unsplittable Flow on a Short Path
    Matthias Bentert, Fedor V. Fomin, Fanny Hauser, and Saket Saurabh: The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
    Jakob Greilhuber and Roohani Sharma: Component Order Connectivity admits no polynomial kernel parameterized by the feedback vertex set number
    Anna Zych-Pawlewicz and Marek Żochowski: Dynamic Parameterized Feedback Problems in Tournaments
    Henning Fernau and Kevin Mann: Roman Hitting Functions
    Karthik C. S., Euiwoong Lee, and Pasin Manurangsi: On Equivalence of Parameterized Inapproximability of k-median, k-max-coverage, and 2-CSP
    Guilherme de Castro Mendes Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos: Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
    Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F.A. Verhaegh: Preprocessing to Reduce the Search Space for Odd Cycle Transversal
    Jaroslav Garvardt and Christian Komusiewicz: Modularity Clustering parameterized by Max Leaf Number
    Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh: Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset