Abstract is missing.
- On Satisfiability Problems with a Linear StructureSerge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle. [doi]
- Determinant Sums for Hamiltonicity (Invited Talk)Andreas Björklund. [doi]
- Turbocharging Treewidth HeuristicsSerge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele. [doi]
- Randomised Enumeration of Small Witnesses Using a Decision OracleKitty Meeks. [doi]
- Dynamic Parameterized ProblemsR. Krithika, Abhishek Sahu, Prafullkumar Tale. [doi]
- On the Parameterized Complexity of Biclique Cover and PartitionL. Sunil Chandran, Davis Issac, Andreas Karrenbauer. [doi]
- The First Parameterized Algorithms and Computational Experiments ChallengeHolger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond. [doi]
- Finding Secluded Places of Special Interest in GraphsRené van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý. [doi]
- Treedepth Parameterized by Vertex Cover NumberYasuaki Kobayashi, Hisao Tamaki. [doi]
- Structural Parameterizations of Feedback Vertex SetDiptapriyo Majumdar. [doi]
- A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed GraphsRobert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier. [doi]
- A 2lk Kernel for l-Component Order ConnectivityMithilesh Kumar, Daniel Lokshtanov. [doi]
- Computing Graph Distances Parameterized by Treewidth and DiameterThore Husfeldt. [doi]
- A Faster Parameterized Algorithm for Pseudoforest DeletionHans L. Bodlaender, Hirotaka Ono, Yota Otachi. [doi]
- Clifford Algebras Meet Tree DecompositionsMichal Wlodarczyk. [doi]
- Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSPCornelius Brand, Holger Dell, Marc Roth. [doi]
- Parallel Multivariate Meta-TheoremsMax Bannach, Till Tantau. [doi]
- H-Free Graphs, Independent Sets, and Subexponential-Time AlgorithmsGábor Bacsó, Dániel Marx, Zsolt Tuza. [doi]
- Edge Bipartization Faster Than 2^kMarcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna. [doi]
- Exact Algorithms for List-Coloring of Intersecting HypergraphsKhaled M. Elbassioni. [doi]
- Cutwidth: Obstructions and Algorithmic AspectsArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. [doi]
- Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors [doi]
- Cut and Count and Representative Sets on Branch DecompositionsWillem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij. [doi]
- Optimal Dynamic Program for r-Domination Problems over Tree DecompositionsGlencora Borradaile, Hung Le. [doi]
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex SetAkanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma. [doi]
- Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to DepthMateus de Oliveira Oliveira. [doi]
- Lower Bounds for Protrusion Replacement by Counting Equivalence ClassesBart M. P. Jansen, Jules J. H. M. Wulms. [doi]
- Backdoors for Linear Temporal LogicArne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler. [doi]
- A Fast Parameterized Algorithm for Co-Path SetBlair D. Sullivan, Andrew van der Poel. [doi]
- The Parameterized Complexity of Dependency Detection in Relational DatabasesThomas Bläsius, Tobias Friedrich 0001, Martin Schirneck. [doi]
- Improved Bounds for Minimal Feedback Vertex Sets in TournamentsMatthias Mnich, Eva-Lotta Teutrine. [doi]