• Kitty Meeks. Randomised enumeration of small witnesses using a decision oracle
• Max Bannach and Till Tantau. Parallel Multivariate Meta-Theorems
• Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein and Rolf Niedermeier. A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems
• Thomas Bläsius, Tobias Friedrich and Martin Schirneck. The Parameterized Complexity of Dependency Detection in Relational Databases
• Willem Pino, Hans L. Bodlaender and Johan M. M. Van Rooij. Cut and Count and Representative Sets on Branch Decompositions
• Hans L. Bodlaender, Hirotaka Ono and Yota Otachi. A faster parameterized algorithm for Pseudoforest Deletion
• René Van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge and Ondřej Suchy. Finding Secluded Places of Special Interest in Graphs
• Gábor Bacsó, Dániel Marx and Zsolt Tuza. H-free Graphs, Independent Sets, and Subexponential-time Algorithms
• Bart M. P. Jansen and Jules J.H.M. Wulms. Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
• Andrew van der Poel and Blair D. Sullivan. A Fast Parameterized Algorithm for Co-Path Set
• Marcin Pilipczuk, Michał Pilipczuk and Marcin Wrochna. Edge Bipartization faster than 2^k
• Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios Thilikos and Marcin Wrochna. Cutwidth: obstructions and algorithmic aspects
• Diptapriyo Majumdar. Structural Parameterizations of Feedback Vertex Set
• R. Krithika, Abhishek Sahu and Prafullkumar Tale. Dynamic Parameterized Problems
• Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele. Turbocharging Treewidth Heuristics
• Serge Gaspers, Christos Papadimitriou, Sigve Hortemo Sæther and Jan Arne Telle. On Satisfiability Problems with Linear Structure
• Mithilesh Kumar and Daniel Lokshtanov. A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
• Arne Meier, Sebastian Ordyniak, Ramanujan M. S. and Irena Schindler. Backdoors for Linear Temporal Logic
• Khaled Elbassioni. Exact Algorithms for List-coloring of Intersecting Hypergraphs
• Michal Wlodarczyk. Clifford algebras meet tree decompositions
• L. Sunil Chandran, Davis Issac and Andreas Karrenbauer. On the Parameterized Complexity of Biclique Cover and Partition
• Hung Le and Glencora Borradaile. Optimal dynamic program for r-domination problems over tree decompositions
• Thore Husfeldt. Computing Graph Distances Parameterized by Treewidth and Diameter
• Eva-Lotta Teutrine and Matthias Mnich. Improved Bounds for Minimal Feedback Vertex Sets in Tournaments
• Akanksha Agrawal, Sushmita Gupta, Saket Saurabh and Roohani Sharma. Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Cornelius Brand, Holger Dell and Marc Roth. Fine-grained dichotomies for the Tutte plane and Boolean #CSP
• Yasuaki Kobayashi and Hisao Tamaki. Treedepth parameterized by vertex cover number
• Mateus De Oliveira Oliveira. Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth