Accepted Papers

Authors Title
Marin Bougeret, Klaus Jansen, Michael Poss and Lars Rohwedder Approximation results for makespan minimization with budgeted uncertainty
Pierre Bergé and Lou Salaün Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s,t)-Cuts
Stav Ashur, Omrit Filtser, Matthew Katz and Rachel Saban Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains
Björn Feldkord, Till Knollmann, Manuel Malatyali and Friedhelm Meyer Auf der Heide Managing Multiple Mobile Resources
Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen and Ingmar Knof Robust Online Algorithms for Certain Dynamic Packing Problems
Karl Däubel An Improved Upper Bound for the Ring Loading Problem
Sándor Fekete, Jonas Grosse-Holz, Phillip Keldenich and Arne Schmidt Parallel Online Algorithms for the Bin Packing Problem
János Balogh, József Békési, György Dósa, Leah Epstein and Asaf Levin A new lower bound for classic online bin packing
Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang and François Pirot Approximate strong edge-colouring of unit disk graphs
Tanmay Inamdar and Kasturi Varadarajan Fault Tolerant Clustering With Outliers
Graham Cormode and Pavel Veselý Streaming Algorithms for Bin Packing and Vector Scheduling
Melanie Schmidt, Chris Schwiegelshohn and Christian Sohler Fair Coresets and Streaming Algorithms for Fair k-means
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli and Krzysztof Sornat On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence Wong Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
Felix Happach and Andreas S. Schulz Precedence-Constrained Scheduling and Min-Sum Set Cover
Ioannis Katsikarelis, Michael Lampis and Vangelis Paschos Improved (In-)Approximability Bounds for d-Scattered Set

LOGO DFG2        LOGO EATCS2        LOGO ERC2       LOGO TUM2    LOGO Networks