1

Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem

Johannes Maschler, Günther Raidl

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Martin Nöllenburg, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander

Parameterized Algorithms for the Matrix Completion Problem

Robert Ganian, Iyad Kanj, Stefan Szeider

Planar L-Drawings of Directed Graphs

Chaplick, Steven, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Martin Nöllenburg, Patrignani, Maurizio, Tollis, Ioannis G., Wolff, Alexander

Polynomial-Time Validation of QCDCL Certificates

Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

Portfolio-Based Algorithm Selection for Circuit QBFs

Hoos, Holger H., Tomas Peitl, Slivovsky, Friedrich, Stefan Szeider

Semi-Automated Location Planning for Urban Bike-Sharing Systems

Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther Raidl, Markus Pajones, Felix Beyer

Small Resolution Proofs for QBF using Dependency Treewidth

Eduard Eiben, Robert Ganian

Towards Characterizing Strict Outerconfluent Graphs

Klute, Fabian, Martin Nöllenburg

Unary Integer Linear Programming with Structural Restrictions