[4] Dictionaries using variable-length keys and data, with applications.
[14] Lower bounds on the size of selection and rank indexes.
[1] Dynamic dictionary matching and compressed suffix trees.
[7] A categorization theorem on suffix arrays with applications to space efficient text indexes.
[3] Towards a complete characterization of tries.
[13] Inoculation strategies for victims of viruses and the sum-of-squares partition problem.
[11] Marriage, honesty, and stability.
[15] Market equilibria for homothetic, quasi-concave utilities and economies of scale in production.
[17] On the polynomial time computation of equilibria for certain exchange economies.
[31] Computing equilibria in multi-player games.
[20] On distance scales, embeddings, and efficient relaxations of the cut cone.
[15] Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut.
[7] The complexity of low-distortion embeddings between point sets.
[11] Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
[0] A tight threshold for metric Ramsey phenomena.
[0] The interface between computational and combinatorial geometry.
[9] Multiple-source shortest paths in planar graphs.
[0] Computing the shortest path: A search meets graph theory.
[3] Finding large cycles in Hamiltonian graphs.
[5] Approximating connectivity augmentation problems.
[2] Primal-dual approach for directed vertex connectivity augmentation and generalizations.
[0] Multidimensional balanced allocations.
[5] Online client-server load balancing without global information.
[0] Job shop scheduling with unit processing times.
[10] Approximating the average response time in broadcast scheduling.
[15] Improved schedule for radio broadcast.
[8] On levels in arrangements of surfaces in three dimensions.
[0] Distributions of points in the unit-square and large k-gons.
[0] On geometric permutations induced by lines transversal through a fixed point.
[0] Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes.
[4] Isomorphism and embedding problems for infinite limits of scale-free graphs.
[2] Adversarial deletion in a scale free random graph process.
[5] The influence of search engines on preferential attachment.
[13] On the spread of viruses on the internet.
[3] Analyzing and characterizing small-world graphs.
[2] Substring compression problems.
[1] Optimizing markov models with applications to triangular connectivity coding.
[4] Dotted interval graphs and high throughput genotyping.
[5] Algorithms for combining rooted triplets into a galled phylogenetic network.
[0] Unknotting is in AM cup co-AM.
[1] A constant approximation algorithm for the one-warehouse multi-retailer problem.
[10] Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy.
[12] Online convex optimization in the bandit setting: gradient descent without a gradient.
[17] Adaptivity and approximation for stochastic packing problems.
[20] Theory of semidefinite programming for sensor network localization.
[1] An O(VE) algorithm for ear decompositions of matching-covered graphs.
[11] Popular matchings.
[1] Dominator tree verification and vertex-disjoint paths.
[6] Online topological ordering.
[3] All maximal independent sets and dynamic dominance for sparse graphs.
[14] LP decoding achieves capacity.
[16] Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.
[8] Collecting correlated information from a sensor network.
[17] Deterministic network coding by matrix completion.
[8] Network coding: does the model need tuning?
[0] Pianos are not flat: rigid motion planning in three dimensions.
[11] A constant-factor approximation algorithm for optimal terrain guarding.
[2] Ray shooting amid balls, farthest point from a line, and range emptiness searching.
[9] Space-time tradeoffs for approximate spherical range counting.
[10] Online conflict-free coloring for intervals.
[0] Loop quantum gravity.
[7] Approximation algorithms for cycle packing problems.
[0] Approximating the smallest k-edge connected spanning subgraph by LP-rounding.
[0] Partial covering of hypergraphs.
[2] Approximating vertex cover on dense graphs.
[26] Bidimensionality: new connections between FPT algorithms and PTASs.
[27] Limitations of cross-monotonic cost sharing schemes.
[18] A group-strategyproof mechanism for Steiner forests.
[11] Collusion-resistant mechanisms for single-parameter agents.
[1] A multiple-choice secretary algorithm with applications to online auctions.
[0] Rounds vs queries trade-off in noisy computation.
[19] Distributed approaches to triangulation and embedding.
[2] Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics.
[5] Sparse source-wise and pair-wise distance preservers.
[1] Lower bound for sparse Euclidean spanners.
[0] New constructions of (alpha, beta)-spanners and purely additive spanners.
[15] Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.
[15] Dissections and trees, with applications to optimal mesh encoding and to random sampling.
[0] The expected value of random minimal length spanning tree of a complete graph.
[0] Girth restrictions for the 5-flow conjecture.
[4] Linear equations, arithmetic progressions and hypergraph property testing.
[9] The relative worst order ratio applied to paging.
[3] Strictly convex drawings of planar graphs.
[1] External-memory exact and approximate all-pairs shortest-paths in undirected graphs.
[20] Graph distances in the streaming model: the value of space.
[0] Lower bounds for external algebraic decision trees.
[25] On hierarchical routing in doubling metrics.
[13] Fast convergence of selfish rerouting.
[8] Oblivious routing on node-capacitated and directed graphs.
[4] Distributed online call control on general networks.
[6] An optimal online algorithm for packet scheduling with agreeable deadlines.
[2] An optimal dynamic interval stabbing-max data structure?
[6] Self-adjusting top trees.
[15] An optimal Bloom filter replacement.
[7] Efficient hashing with lookups in two memory accesses.
[9] Improved range-summable random variable construction algorithms.
[0] A spectral heuristic for bisecting random graphs.
[3] Complete partitions of graphs.
[3] Two algorithms for general list matrix partitions.
[13] How fast is the k-means method?
[14] On approximating the depth and related problems.
[1] Multicoloring unit disk graphs on triangular lattice points.
[23] An asymptotic approximation scheme for multigraph edge coloring.
[0] Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376).
[0] Finding the shortest bottleneck edge in a parametric minimum spanning tree.
[6] On the random 2-stage minimum spanning tree.
[0] Rigorous analysis of heuristics for NP-hard problems.
[6] An improved approximation algorithm for virtual private network design.
[10] Network design for information networks.
[7] On the approximability of some network design problems.
[2] Approximating k-median with non-uniform capacities.
[5] Improved approximation for universal facility location.
[0] The cover time of two classes of random graphs.
[7] Coupling with the stationary distribution and improved sampling for colorings and independent sets.
[9] Sampling regular graphs and a peer-to-peer network.
[21] The bin-covering technique for thresholding random geometric graph properties.
[0] Random planar graphs with n nodes and a fixed number of edges.
[16] Provably good moving least squares.
[6] Manifold reconstruction from point samples.
[1] Delaunay triangulations approximate anchor hulls.
[14] Greedy optimal homotopy and homology generators.
[3] Controlled perturbation for Delaunay triangulations.
[2] Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.
[1] Matrix rounding with low error in small submatrices.
[1] Can the TPRI structure help us to solve the algebraic eigenproblem?
[9] Optimal random number generation from a biased coin.
[16] A new look at survey propagation and its generalizations.
[25] Coins make quantum walks faster.
[36] Quantum algorithms for the triangle problem.
[18] The hidden subgroup problem and permutation group theory.
[1] Testing hierarchical systems.
[0] Conformance testing in the presence of multiple faults.
[15] Online ascending auctions for gradually expiring items.
[23] Near-optimal online auctions.
[26] On profit-maximizing envy-free pricing.
[12] Improved recommendation systems.
[14] Selfish routing with atomic players.

Created by Piotr Indyk and Suresh Venkatasubramanian. Original idea by Michael Mitzenmacher.