1: External Memory Orthogonal Range Reporting with Fast Updates
2: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
3: Quadratic-time Algorithm for the String Constrained LCS Problem
4: Fixed parameter algorithms for restricted coloring problems
5: Sparse Sums of Positive Semidefinite Matrices
6: A Probabilistic Attack on NP-complete Problems
7: Approximating Tverberg Points in Linear Time for Any Fixed Dimension
8: Unbounded Contention Resolution in Multiple-Access Channels
9: An algorithm for autonomously plotting solution sets in the presence of turning points
10: Applications of Discrepancy Theory in Multiobjective Approximation
11: Distributed Matrix Completion and Robust Factorization
12: Generalized Maneuvers in Route Planning
13: Approximating Minimum Manhattan Networks in Higher Dimensions
14: Optimal Point Movement for Covering Circular Regions
15: The traveling salesman problem on cubic and subcubic graphs
16: Genome Halving by Block Interchange
17: Not So Easy Problems for Tree Decomposable Graphs
18: Two-Player Reachability-Price Games on Single-Clock Timed Automata
19: Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem
20: On the Furthest Hyperplane Problem and Maximal Margin Clustering