Accepted Papers
The Isomap algorithm in distance geometry
A Framework of Dynamic Data Structures for String Processing
Better Process Mapping and Sparse Quadratic Assignment
On the separation of topology-free rank inequalities for the max stable set problem
Practical Range Minimum Queries Revisited
Graph Partitioning with Acyclicity Constraints
Fast Deterministic Selection
Fast and scalable minimal perfect hashing for massive key sets
Compression with the tudocomp Framework
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
Efficient Algorithms for k-Regret Minimizing Sets
Ad-hoc Affectance-selective Families for Layer Dissemination
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
Jdrasil: A Modular Library for Computing Tree Decompositions
The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications
The Quantile Index – Succinct Self-Index for Top-k Document Retrieval
Faster Betweenness Centrality Updates in Evolving Networks
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory
Efficient Traffic Assignment for Public Transit Networks
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet
Distributed domain propagation
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs
Online construction of wavelet trees
Incremental Low-High Orders of Directed Graphs and Applications
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria
Extending Search Phases in the Micali-Vazirani Algorithm