IPEC

Keyphrases

Publications

2023

Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC (2023)
Édouard Bonnet, Julien Duron
Stretch-Width. IPEC (2023)
Front Matter, Table of Contents, Preface, Conference Organization. IPEC (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC (2023)
Bart M. P. Jansen, Shivesh Kumar Roy
On the Parameterized Complexity of Multiway Near-Separator. IPEC (2023)
Bart M. P. Jansen, Bart van der Steenhoven
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. IPEC (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC (2023)
Mathieu Mari, Timothé Picavet, Michal Pilipczuk
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC (2023)
Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton
PACE Solver Description: Touiouidth. IPEC (2023)
Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
Kernelizing Temporal Exploration Problems. IPEC (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Collective Graph Exploration Parameterized by Vertex Cover. IPEC (2023)
Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC (2023)
Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden
Minimum Separator Reconfiguration. IPEC (2023)
Édouard Bonnet, Julien Duron
PACE Solver Description: RedAlert - Heuristic Track. IPEC (2023)
Yosuke Mizutani, David Dursteler, Blair D. Sullivan
PACE Solver Description: Hydra Prime. IPEC (2023)
Riccardo Dondi, Manuel Lafond
An FPT Algorithm for Temporal Graph Untangling. IPEC (2023)
Stefan Kratsch, Pascal Kunz
Approximate Turing Kernelization and Lower Bounds for Domination Problems. IPEC (2023)
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC (2023)
Max Bannach, Sebastian Berndt
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. IPEC (2023)
Maël Dumas, Anthony Perez
An Improved Kernelization Algorithm for Trivially Perfect Editing. IPEC (2023)
Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Dynamic Programming on Bipartite Tree Decompositions. IPEC (2023)
Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl
Computing Complexity Measures of Degenerate Graphs. IPEC (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. IPEC (2023)
Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC (2023)
Klaus Heeger, Danny Hermelin, Dvir Shabtay
Single Machine Scheduling with Few Deadlines. IPEC (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC (2023)
Matthias Bentert, Jannik Schestag, Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC (2023)
Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller
Finding Degree-Constrained Acyclic Orientations. IPEC (2023)
Irene Heinrich, Simon Raßmann
Twin-Width of Graphs with Tree-Structured Decompositions. IPEC (2023)
Max Bannach, Florian Chudigiewitsch, Till Tantau
Existential Second-Order Logic over Graphs: Parameterized Complexity. IPEC (2023)
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
Cluster Editing with Overlapping Communities. IPEC (2023)
Bart M. P. Jansen, Shivesh Kumar Roy
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. IPEC (2023)
Mark Jones, Jannik Schestag
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. IPEC (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth Is NP-Complete on Cubic Graphs. IPEC (2023)
Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC (2023)
Robert Ganian, Liana Khazaliya, Kirill Simonov
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. IPEC (2023)
Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf
PACE Solver Description: Zygosity. IPEC (2023)
Hisao Tamaki
A Contraction-Recursive Algorithm for Treewidth. IPEC (2023)

volume 285, 2023

18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands IPEC 285 (2023)

2022

volume 249, 2022

17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany. IPEC 249 (2022)