1

Combining Resolution-Path Dependencies with Dependency Learning

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

Computing Stable Demers Cartograms

Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Martin Nöllenburg

Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks

Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu

Efficient Segment Folding is Hard

Horiyama, Takashi, Klute, Fabian, Korman, Matias, Parada, Irene, Uehara, Ryuhei, Yamanaka, Katsuhisa

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Marko Djukanovic, Günther Raidl, Christian Blum

Exploring Semi-Automatic Map Labeling

Klute, Fabian, Li, Guangping, Löffler, Raphael, Martin Nöllenburg, Schmidt, Manuela

Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

Group Activity Selection with Few Agent Types

Robert Ganian, Sebastian Ordyniak, C. S. Rahul

Hardness of FO Model-Checking on Random Graphs

Jan Niclas Dreier

Integer Programming and Incidence Treedepth