1

Semantic Word Cloud Representations: Hardness and Approximation Algorithms

Barth, Lukas, Fabrikant, Sara Irina, Kobourov, Stephen G., Lubiw, Anna, Martin Nöllenburg, Okamoto, Yoshio, Pupyrev, Sergey, Squarcella, Claudio, Ueckerdt, Torsten, Wolff, Alexander

Simultaneous Embeddability of Two Partitions

Athenstädt, Jan Christoph, Hartmann, Tanja, Martin Nöllenburg

Small Unsatisfiable Subsets in Constraint Satisfaction

Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem

Günther Raidl, Thomas Baumhauer, Bin Hu

Subexponential Time Complexity of CSP with Global Constraints

Ronald De Haan, Iyad A. Kanj, Stefan Szeider

The Complexity of Width Minimization for Existential Positive Queries

The Parameterized Complexity of Reasoning Problems Beyond NP

De Haan, Ronald, Stefan Szeider

Variable Dependencies and Q-Resolution

Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure

Grujicic, Igor, Günther Raidl, Schöbel, Andreas

Vertex Exponential Algorithms for Connected f-Factors

Geevarghese Philip and M. S. Ramanujan