IPEC B

37 papers

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