Accepted Papers

Online Two-Dimensional Vector Packing with Advice
Bengt J. Nilsson and Gordana Vujovic

On Vertex-Weighted Graph Realizations

Amotz Bar-Noy, Toni Böhnlein, David Peleg and Dror Rawitz

FPT and kernelization algorithms for the Induced Tree problem

Guilherme de Castro Mendes Gomes, Vinicius F. dos Santos, Murilo Da Silva and Jayme Szwarcfiter.
 

Temporal Matching on Geometric Graph Data
Timothé Picavet, Ngoc-Trung Nguyen and Binh-Minh Bui-Xuan.


Covering a set of line segments with a few squares

Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma and Sampson Wong


Throughput Scheduling with Equal Additive Laxity
Martin Böhm, Nicole Megow and Jens Schlöter

Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
Louis Dublois, Michael Lampis and Vangelis Paschos

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein and Rolf Niedermeier


On the Role of $3$’s for the 1-2-3 Conjecture
Julien Bensmail, Foivos Fioravantes and Fionn Mc Inerney
 

Globally rigid augmentation of minimally rigid graphs in R^2
Csaba Király and András Mihálykó

Extending Partial Representations of Rectangular Duals with Given Contact Orientations
Jonathan Klawitter, Steven Chaplick, Philipp Kindermann, Ignaz Rutter and Alexander Wolff

Can Local Optimality Be Used for Efficient Data Reduction?
Christian Komusiewicz and Nils Morawietz.

 

A Multistage View on 2-Satisfiability
Till Fluschnik

The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
Frank Fuhlbrück, Johannes Koebler, Ilia Ponomarenko and Oleg Verbitsky

Reconfiguration of Connected Graph Partitions via Recombination
Hugo Akitaya, Matias Korman, Oliver Korten, Diane Souvaine and Csaba Toth

 

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi and Yota Otachi

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles
Barnaby Martin, Daniel Paulusma and Siani Smith


Circumventing Connectivity for Kernelization
Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh and Roohani Sharma


The Parameterized Suffix Tray
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
 

Algorithms for Energy Conservation in Heterogeneous Data Centers
Susanne Albers and Jens Quedenfeld
 

Online and approximate network construction from bounded connectivity constraints
Jesper Jansson, Christos Levcopoulos and Andrzej Lingas
 

The Multi-Budget Maximum Weighted Coverage Problem
Francesco Cellinese, Gianlorenzo D’Angelo, Gianpiero Monaco and Yllka Velaj
 

Three problems on well-partitioned chordal graphs
Jungho Ahn, Lars Jaffke, O-Joung Kwon and Paloma de Lima
 

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
Rajesh Chitnis
 

Distributed Distance-$r$ Covering Problems\\ on Sparse High-Girth Graphs
Saeed Akhoondian Amiri and Ben Wiederhake
 

Upper Tail Analysis of Bucket Sort and Random Tries
Ioana Bercea and Guy Even
 

Fragile Complexity of Adaptive Algorithms
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob and Stefan Langerman