ACCEPTED PAPERS
- Minimum Average Distance Triangulations
- The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations
- Succinct Posets
- Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
- Resource Buying Games
- Maximum Multicommodity Flows Over Time without Intermediate Storage
- Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
- The Clique Problem in Ray Intersection Graphs
- Optimal Lower Bound for Differentially Private Multi-Party Aggregation
- Solving simple stochastic games with few coin toss positions
- Bottleneck Non-Crossing Matching in the Plane
- Induced Disjoint Paths in Claw-Free Graphs
- Data Structures on Event Graphs
- New Lower and Upper Bounds for Representing Sequences
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
- On the Value of Job Migration in Online Makespan Minimization
- Knowledge, Level of Symmetry, and Time of Leader Election
- Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
- Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite
- Locally Correct Fréchet Matchings
- On the Complexity of Metric Dimension
- Optimizing over the Growing Spectrahedron
- On online labeling with polynomially many labels
- Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
- A Dual-Fitting 3/2-Approximation Algorithm for Some Minimum-Cost Graph Problems
- Solving domination problems on larger graph classes by linear-time FPT algorithms
- Preemptive Coordination Mechanisms for Unrelated Machines
- A Bicriteria Approximation for the Reordering Buffer Problem
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Routing Regardless of Network Stability
- Finding Social Optima in Congestion Games with Positive Externalities
- Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
- Succinct Data Structures for Path Queries
- Span programs and quantum algorithms for st-connectivity and claw detection
- The quantum query complexity of read-many formulas
- TSP tours in Cubic Graphs: Beyond 4/3
- A Model for Minimizing Active Processor Time
- Sorted Geometric Queries Require Superlinear Space
- Embedding paths into trees: VM placement to minimize congestion
- Steiner Forest Orientation Problems
- A Polynomial kernel for Proper Interval Vertex Deletion
- Approximation of Minimum Cost Homomorphisms
- Extending partial representations of function graphs and permutation graphs
- On Min-Power Steiner Tree
- Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness
- Colouring AT-free graphs
- Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
- Efficient Communication Protocols for Deciding Edit Distance
- Polynomial-time Algorithms for Energy Games with Special Weight Structures
- Average Case Analysis of Java 7's Dual Pivot Quicksort
- Weighted Geometric Set Multi-cover via Quasi-Uniform Sampling
- A 5-approximation for capacitated facility location
- Revenue guarantees in sponsored search auctions
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
- A Self-Adjusting Data Structure for Multidimensional Point Sets
- Lines Through Segments in 3D Space
- Maximum Flow Networks for Stability Analysis of LEGO Structures
- Faster Geometric Algorithms via Dynamic Determinant Computation
- Constructing Street Networks from GPS Trajectories
- Improved Implementation of Point Location in General Two-Dimensional Subdivisions
- Hierarchical Hub Labelings for Shortest Paths
- Better Bounds for Graph Bisection
- On Computing Straight Skeletons by Means of Kinetic Triangulations
- An Experimental Study of Dynamic Dominators
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
- I/O-efficient hierarchical diameter approximation
- Time-Dependent Route Planning with Generalized Objective Functions
- Simplifying Massive Contour Maps