default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th IPEC 2024: London, UK
- Édouard Bonnet
, Pawel Rzazewski:
19th International Symposium on Parameterized and Exact Computation, IPEC 2024, Royal Holloway, University of London, Egham, United Kingdom, September 4-6, 2024. LIPIcs 321, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-353-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. 1:1-1:15 - Jonas Lill, Kalina Petrova, Simon Weber:
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. 2:1-2:19 - Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. 3:1-3:22 - Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. 4:1-4:20 - Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. 5:1-5:22 - Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. 6:1-6:18 - Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
On Controlling Knockout Tournaments Without Perfect Information. 7:1-7:15 - Ishay Haviv, Dror Rabinovich:
Kernelization for Orthogonality Dimension. 8:1-8:17 - Marvin Künnemann, Mirza Redzic:
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. 9:1-9:18 - Tomohiro Koana, Nidhi Purohit, Kirill Simonov:
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. 10:1-10:17 - Yuxi Liu, Mingyu Xiao:
Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k. 11:1-11:17 - Carla Groenland, Jesper Nederlof, Tomohiro Koana:
A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. 12:1-12:17 - Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Kick the Cliques. 13:1-13:17 - Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. 14:1-14:23 - Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh:
Preprocessing to Reduce the Search Space for Odd Cycle Transversal. 15:1-15:18 - Jaroslav Garvardt, Christian Komusiewicz:
Modularity Clustering Parameterized by Max Leaf Number. 16:1-16:14 - Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. 17:1-17:17 - Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Parameterised Distance to Local Irregularity. 18:1-18:15 - Matthias Kaul, Matthias Mnich, Hendrik Molter:
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. 19:1-19:15 - Paul Bastide, Carla Groenland:
Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength. 20:1-20:11 - Jakob Greilhuber, Roohani Sharma:
Component Order Connectivity Admits No Polynomial Kernel Parameterized by the Distance to Subdivided Comb Graphs. 21:1-21:17 - Anna Zych-Pawlewicz, Marek Zochowski:
Dynamic Parameterized Feedback Problems in Tournaments. 22:1-22:15 - Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. 23:1-23:14 - Henning Fernau, Kevin Mann:
Roman Hitting Functions. 24:1-24:15 - Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, Vinícius Fernandes dos Santos:
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration. 25:1-25:15 - Philipp Kindermann, Fabian Klute, Soeren Terziadis:
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization. 26:1-26:20 - Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt:
PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. 27:1-27:4 - Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, Marcel Wienöbst:
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization. 28:1-28:4 - Alexander Dobler:
PACE Solver Description: CRGone. 29:1-29:4 - Tobias Röhr, Kirill Simonov:
PACE Solver Description: Crossy - An Exact Solver for One-Sided Crossing Minimization. 30:1-30:4 - Carlos Segura, Lázaro Lugo, Gara Miranda, Edison David Serrano Cárdenas:
PACE Solver Description: CIMAT_Team. 31:1-31:4 - Martin Josef Geiger:
PACE Solver Description: Martin_J_Geiger. 32:1-32:4 - Kimon Boehmer, Lukas Lee George, Fanny Hauser, Jesse Palarus:
PACE Solver Description: Arcee. 33:1-33:4 - Kenneth Langedal, Matthias Bentert, Thorgal Blanco, Pål Grønås Drange:
PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. 34:1-34:4 - Ragnar Groot Koerkamp, Mees J. de Vries:
PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization. 35:1-35:5
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.
last updated on 2025-12-04 01:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
