default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th IPEC 2021: Lisbon, Portugal
- Petr A. Golovach
, Meirav Zehavi:
16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. LIPIcs 214, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-216-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Akanksha Agrawal, Aditya Anand, Saket Saurabh:
A Polynomial Kernel for Deletion to Ptolemaic Graphs. 1:1-1:15 - Akanksha Agrawal, Ravi Kiran Allumalla, Varun Teja Dhanekula:
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. 2:1-2:12 - Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina:
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. 3:1-3:15 - Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. 4:1-4:19 - Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. 5:1-5:15 - Jakub Balabán, Petr Hlinený:
Twin-Width Is Linear in the Poset Width. 6:1-6:13 - Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. 7:1-7:18 - Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. 8:1-8:14 - Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. 9:1-9:16 - Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. 10:1-10:16 - Laurent Bulteau, Bertrand Marchand, Yann Ponty:
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. 11:1-11:15 - Elisabet Burjons, Peter Rossmanith:
Lower Bounds for Conjunctive and Disjunctive Turing Kernels. 12:1-12:17 - Yixin Cao, Yuping Ke:
Improved Kernels for Edge Modification Problems. 13:1-13:14 - Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. 14:1-14:18 - Guillaume Ducoffe:
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. 15:1-15:17 - Guillaume Ducoffe:
Optimal Centrality Computations Within Bounded Clique-Width Graphs. 16:1-16:16 - Maël Dumas, Anthony Perez, Ioan Todinca:
Polynomial Kernels for Strictly Chordal Edge Modification Problems. 17:1-17:16 - Andreas Emil Feldmann, Ashutosh Rai:
On Extended Formulations For Parameterized Steiner Trees. 18:1-18:16 - Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. 19:1-19:14 - Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. 20:1-20:18 - Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. 21:1-21:15 - Vít Jelínek, Michal Opler, Jakub Pekárek:
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. 22:1-22:17 - Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. 23:1-23:18 - Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. 24:1-24:13 - Igor Razgon:
Classification of OBDD Size for Monotone 2-CNFs. 25:1-25:15 - Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche:
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. 26:1-26:18 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. 27:1-27:3 - Alexander Bille, Dominik Brandenstein, Emanuel Herrendorf:
PACE Solver Description: ADE-Solver. 28:1-28:4 - Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. 29:1-29:4 - Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn:
PACE Solver Description: PACA-JAVA. 30:1-30:4 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. 31:1-31:4 - Sylwester Swat:
PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem. 32:1-32:3 - Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: μSolver - Heuristic Track. 33:1-33:3 - Martin Josef Geiger:
PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem. 34:1-34:2 - Sylwester Swat:
PACE Solver Description: Cluster Editing Kernelization Using CluES. 35:1-35:3
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-11-04 00:25 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:
