default search action
18th IPEC 2023: Amsterdam, The Netherlands
- Neeldhara Misra
, Magnus Wahlström
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. LIPIcs 285, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-305-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. 1:1-1:18 - Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf:
Cluster Editing with Overlapping Communities. 2:1-2:12 - Max Bannach, Florian Chudigiewitsch, Till Tantau:
Existential Second-Order Logic over Graphs: Parameterized Complexity. 3:1-3:15 - Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. 4:1-4:12 - Sriram Bhyravarapu, Satyabrata Jana
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. 5:1-5:14 - Hans L. Bodlaender
The Parameterised Complexity Of Integer Multicommodity Flow. 6:1-6:19 - Hans L. Bodlaender
Treewidth Is NP-Complete on Cubic Graphs. 7:1-7:13 - Édouard Bonnet, Julien Duron:
Stretch-Width. 8:1-8:15 - 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. 9:1-9:12 - Juhi Chaudhary
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. 10:1-10:22 - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. 11:1-11:19 - Riccardo Dondi, Manuel Lafond:
An FPT Algorithm for Temporal Graph Untangling. 12:1-12:16 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. 13:1-13:17 - Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing Complexity Measures of Degenerate Graphs. 14:1-14:21 - Maël Dumas, Anthony Perez:
An Improved Kernelization Algorithm for Trivially Perfect Editing. 15:1-15:17 - 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. 16:1-16:14 - Baris Can Esmer
Approximate Monotone Local Search for Weighted Problems. 17:1-17:23 - Robert Ganian, Liana Khazaliya, Kirill Simonov:
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. 18:1-18:17 - Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller:
Finding Degree-Constrained Acyclic Orientations. 19:1-19:14 - Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
Graph Clustering Problems Under the Lens of Parameterized Local Search. 20:1-20:19 - Tatsuya Gima
Bandwidth Parameterized by Cluster Vertex Deletion Number. 21:1-21:15 - Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. 22:1-22:18 - Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. 23:1-23:22 - Klaus Heeger, Danny Hermelin, Dvir Shabtay:
Single Machine Scheduling with Few Deadlines. 24:1-24:15 - Irene Heinrich, Simon Raßmann
Twin-Width of Graphs with Tree-Structured Decompositions. 25:1-25:17 - Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming on Bipartite Tree Decompositions. 26:1-26:22 - Bart M. P. Jansen, Bart van der Steenhoven:
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. 27:1-27:15 - Bart M. P. Jansen, Shivesh Kumar Roy:
On the Parameterized Complexity of Multiway Near-Separator. 28:1-28:18 - Bart M. P. Jansen, Shivesh Kumar Roy
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. 29:1-29:13 - Mark Jones, Jannik Schestag:
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. 30:1-30:12 - Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. 31:1-31:17 - Stefan Kratsch, Pascal Kunz:
Approximate Turing Kernelization and Lower Bounds for Domination Problems. 32:1-32:17 - Mathieu Mari, Timothé Picavet, Michal Pilipczuk:
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. 33:1-33:20 - Hisao Tamaki:
A Contraction-Recursive Algorithm for Treewidth. 34:1-34:15 - Max Bannach, Sebastian Berndt:
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. 35:1-35:14 - Yosuke Mizutani
PACE Solver Description: Hydra Prime. 36:1-36:5 - Alexander Leonhardt
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). 37:1-37:7 - Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler
PACE Solver Description: Touiouidth. 38:1-38:4 - Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal
PACE Solver Description: Zygosity. 39:1-39:3 - Édouard Bonnet, Julien Duron:
PACE Solver Description: RedAlert - Heuristic Track. 40:1-40: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 2024-12-16 22:15 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: