IPEC 2021 Accepted Papers

Shaohua Li and Marcin Pilipczuk. Hardness of Metric Dimension in Graphs of Constant Treewidth
Haozhe An, Mohit Jayanti Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann and Maria Paula Parga Nina. The fine-grained complexity of multi-dimensional ordering properties
Guillaume Ducoffe. Maximum Matching in almost linear time on the graphs of bounded clique-width
Guillaume Ducoffe. Optimal centrality computations within bounded clique-width graphs
Igor Razgon. Classification of OBDD size for monotone 2-CNFs
Maël Dumas, Anthony Perez and Ioan Todinca. Polynomial kernels for strictly chordal edge modification problems
Huib Donkers, Bart M. P. Jansen and Michal Wlodarczyk. Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
Vikraman Arvind and Venkatesan Guruswami. CNF Satisfiability in a Subspace and Related Problems
Julio Araujo, Marin Bougeret, Victor A. Campos and Ignasi Sau. A new framework for kernelization lower bounds: the case of Maximum Minimal Vertex Cover
Hans L. Bodlaender, Carla Groenland and Céline M. F. Swennenhuis. Parameterized Complexities of Dominating and Independent Set Reconfiguration
Akanksha Agrawal, Aditya Anand and Saket Saurabh. A Polynomial Kernel for deletion to Ptolemaic Graphs
Jakub Balabán and Petr Hlineny. Twin-Width is Linear in the Poset Width
Dennis Fischer, Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger. An Investigation of the Recoverable Robust Assignment Problem
Max Bannach, Zacharias Heinrich, Ruediger Reischuk and Till Tantau. Dynamic Kernels for Hitting Sets and Set Packing
Elisabet Burjons and Peter Rossmanith. Lower Bounds for Conjunctive and Disjunctive Turing Kernels
Yixin Cao and Yuping Ke. Improved Kernels for Edge Modification Problems
Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis and Cristian Riveros. Dynamic data structures for timed automata acceptance
Laurent Bulteau, Bertrand Marchand and Yann Ponty. A new parametrization for independent set reconfiguration and applications to RNA kinetics
Vít Jelínek, Michal Opler and Jakub Pekárek. Long paths make pattern-counting hard, and deep trees make it harder
Akanksha Agrawal, Ravi Kiran Allumalla and Varun Teja Dhanekula. Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé and Rémi Watrigant. Twin-width and polynomial kernels
Hugo Jacob, Thomas Bellitto, Oscar Defrain and Marcin Pilipczuk. Close relatives (of Feedback Vertex Set), revisited
Andreas Emil Feldmann and Ashutosh Rai. On Extended Formulations for Parameterized Steiner Trees
Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh and Shaily Verma. A Polynomial Kernel for Bipartite Permutation Vertex Deletion
Gabriel Bathie, Nicolas Bousquet and Théo Pierron. (Sub)linear kernels for edge modification problems towards structured graph classes