1

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Benedikt Klocker, Herbert Fleischner, Günther Raidl

Knowledge Compilation Meets Communication Complexity

Simone Bova and Florent Capelli and Stefan Mengel and Friedrich Slivovsky

On Existential MSO and its Relation to ETH

Robert Ganian, Ronald De Haan, Iyad Kanj, Stefan Szeider

On the Complexity Landscape of Connected f-factor Problems

Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

Ronald De Haan, Stefan Szeider

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

De Haan, Ronald

Particle Therapy Patient Scheduling: First Heuristic Approaches

Johannes Maschler, Martin Riedler, Markus Stock, Günther Raidl

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees

SDDs Are Exponentially More Succinct than OBDDs

SOBRA - Shielding Optimization for BRAchytherapy

Guillaume Blin and Marie Gasparoux and Sebastian Ordyniak and Alexandru Popa