1

Geometric Planar Networks on Bichromatic Points

Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg

Hard Problems on Random Graphs

Jan Niclas Dreier, Henri Lotze, Peter Rossmanith

Hard QBFs for Merge Resolution

Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing

Friedrich Slivovsky

Labeling Nonograms

Löffler, Maarten, Martin Nöllenburg

Layered Fan-Planar Graph Drawings

Biedl, Therese, Chaplick, Steven, Kaufmann, Michael, Montecchiani, Fabrizio, Martin Nöllenburg, Raftopoulou, Chrysanthi

Low-Rank Binary Matrix Approximation in Column-Sum Norm

Fedor v. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov

Manipulating Districts to Win Elections: Fine-Grained Complexity

Eduard Eiben and Fedor v. Fomin and Fahad Panolan and Kirill Simonov

Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size

Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith

MaxSAT-Based Postprocessing for Treedepth

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider