Accepted papers

Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation
Hans L. Bodlaender
Beyond Helly graphs: the diameter problem on absolute retracts
Guillaume Ducoffe
Complementation in T-perfect Graphs
Yixin Cao and Shenghua Wang
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
Huib Donkers and Bart M. P. Jansen
The Complexity of Gerrymandering over Graphs: Paths and Trees
Matthias Bentert, Tomohiro Koana and Rolf Niedermeier
The Graphs of Stably Matchable Pairs
David Eppstein
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs
Fedor Fomin, Petr Golovach and Dimitrios Thilikos
Linearizable special cases of the quadratic shortest path problem
Eranda Cela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger and Lasse Wulf
A linear-time parameterized algorithm for computing the width of a DAG
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi and Alexandru I. Tomescu
Block Elimination Distance
Öznur Yaşar Diner, Archontia Giannopoulou, Giannos Stamoulis and Dimitrios Thilikos
On Morphing 1-Planar Drawings
Patrizio Angelini, Michael Bekos, Fabrizio Montecchiani and Maximilian Pfister
On Fair Covering and Hitting Problems
Sayan Bandyapadhyay, Aritra Banik and Sujoy Bhore
A heuristic approach to the treedepth decomposition problem for large graphs
Sylwester Swat and Marta Kasprzak
The Largest Connected Subgraph Game
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney and Nicolas Nisse
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
Isja Mannens, Jesper Nederlof, Céline Swennenhuis and Krisztina Szilagyi
On 3-Coloring of (2P_4 ,C_5)-Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná and Aneta Pokorná
Feedback Vertex Set on Hamiltonian Graphs
Dario Cavallaro and Till Fluschnik
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Maciej Rymar, Hendrik Molter, André Nichterlein and Rolf Niedermeier
The Perfect Matching Cut Problem Revisited
Van Bang Le and Jan Arne Telle
Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
Christophe Crespelle, Benjamin Gras and Anthony Perez
Bears with Hats and Independence Polynomials
Václav Blažej, Pavel Dvořák and Michal Opler
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
Bart M. P. Jansen and Jari J.H. de Kroon
Labeling Schemes for Deterministic Radio Multi-Broadcast
Colin Krisko and Avery Miller
Interdicting Small (s,t)-Cuts by Protecting Edges
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz and Frank Sommer
Sparse and Lightweight Spanners in Weighted Graphs with Local Additive Error
Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen Kobourov and Richard Spence
Acyclic, Star, and Injective Colouring: Bounding the Diameter
Christoph Brause, Petr Golovach, Barnaby Martin, Daniel Paulusma and Siani Smith
On subgraph complementation to H-free graphs
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R B Sandeep, Sagnik Sen and R Subashini
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Nils Vortmeier and Ioannis Kokkinis
Disjoint Stable Matchings in Linear Time
Aadityan Ganesh, Vishwa Prakash Hv, Prajakta Nimbhorkar and Geevarghese Philip
Odd Cycle Transversal in Mixed Graphs
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil and Saket Saurabh