Paper titles and author information appears as submitted.
Paper title and author changes will not be made to this page. The online program will reflect the most up-to-date presentation details, and is scheduled for posting in November.
Counting Polyominoes, Revisited
Gill Barequet, Gil Ben-Shachar
Maintaining Discrete Probability Distributions in Practice
Daniel Allendorf
Towards Optimal-Space Minimal Perfect Hashing Beyond Brute Force
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
Computing e-th roots in number fields
Olivier Bernard, Pierre-Alain Fouque, Andrea Lesavourey
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm
Simon D. Fink, Ignaz Rutter
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
Moritz Laupichler, Peter Sanders
2-Fault-Tolerant Strong Connectivity Oracles
Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric
Tobias Heuer
Simple and Robust Dynamic Two-Dimensional Convex Hull
Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg
Parallel Unconstrained Local Search for Partitioning Irregular Graphs
Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
Fast and Delay-Robust Multimodal Journey Planning
Dominik Bez, Jonas Sauer
Near-Optimal Coverage Path Planning with Turn Costs
Dominik Krupke
Covering Rectilinear Polygons with Area-Weighted Rectangles
Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
Interactive Exploration of the Temporal alpha-Shape
Felix Weitbrecht
Fast and simple unrooted dynamic forests
Benjamin Aram Berendsohn
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun
Experimental Evaluation of Fully Dynamic k-Means via Coresets
Monika Henzinger, David Saulpic, Leonhard Paul Sidl