[0] epsilon-Approximate linear programs: new bounds and computation.
[9] Orthogonal graph drawing with constraints.
[5] Fast practical solution of sorting by reversals.
[11] Commuting with delay prone buses.
[0] Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma.
[14] On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).
[25] Weakly chordal graph algorithms via handles.
[14] Recognizing dart-free perfect graphs.
[1] An optimal algorithm for hyperplane depth in the plane.
[19] On Heilbronn's problem in higher dimension.
[13] Finding minimal triangulations of convex 3-polytopes is NP-hard.
[43] A point-placement strategy for conforming Delaunay tetrahedralization.
[0] Digraph minors and algorithms (abstract only).
[47] Cooperative facility location games.
[0] K-medians, facility location, and the Chernoff-Wald bound.
[41] Improved approximation algorithms for MAX SAT.
[23] Strengthening integrality gaps for capacitated network design and covering problems.
[21] Towards a 4/3 approximation for the asymmetric traveling salesman problem.
[105] Typical random 3-SAT formulae and the satisfiability threshold.
[0] A lower bound for DLL algorithms for k-SAT (preliminary version).
[14] On permutations with limited independence.
[3] Min-Wise versus linear independence (extended abstract).
[4] Hamiltonicity and colorings of arrangement graphs.
[5] Testing and spot-checking of data streams (extended abstract).
[30] Engineering the compression of massive tables: an experimental approach.
[1] On the temporal HZY compression scheme.
[2] Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme.
[60] Communication complexity of document exchange.
[1] Scheduling a pipelined operator graph.
[70] A PTAS for the multiple knapsack problem.
[28] Approximation algorithms for data placement on parallel disks.
[2] Movement minimization in conveyor flow shop processing.
[0] Forcing relations for AND/OR precedence constraints.
[31] The interlace polynomial: a new graph polynomial.
[0] The complexity of counting graph homomorphisms (extended abstract).
[2] A fast algorithm to generate unlabeled necklaces.
[6] Construction of visual secret sharing schemes with almost optimal contrast.
[7] Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio.
[14] Algorithmic strategies in combinatorial chemistry.
[12] Computing the quartet distance between evolutionary trees.
[43] A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
[22] Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm.
[7] Improved bounds on the sample complexity of learning.
[7] On local search and placement of meters in networks.
[66] Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs.
[22] An approximation algorithm for the covering Steiner problem.
[24] On the red-blue set cover problem.
[9] Approximate congruence in nearly linear time.
[24] Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract).
[33] Dimensionality reduction techniques for proximity problems.
[10] Expected-case complexity of approximate nearest neighbor searching.
[92] A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry.
[6] Algorithms for optimizing production DNA sequencing.
[31] Estimating DNA sequence entropy.
[1] Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project.
[0] Cutting planes and the traveling salesman problem (abstract only).
[15] Caching in networks (extended abstract).
[34] Instability of FIFO in session-oriented networks.
[26] The effects of temporary sessions on network performance.
[19] Randomized greedy hot-potato routing.
[7] On deciding stability of scheduling policies in queueing systems.
[7] Restructuring ordered binary trees.
[14] Faster deterministic dictionaries.
[0] Competitive tree-structured dictionaries.
[19] Even strongly universal hashing is pretty fast.
[0] Word encoding tree connectivity works.
[0] Algorithms for minimum volume enclosing simplex in R³.
[17] Exact and approximation algorithms for minimum-width cylindrical shells.
[9] Evaluating the cylindricity of a nominally cylindrical point set.
[21] Approximation algorithms for layered manufacturing.
[26] Approximation algorithms for projective clustering.
[32] Scheduling to minimize average stretch without migration.
[29] Minimizing maximum response time in scheduling broadcasts.
[16] Applying extra-resource analysis to load balancing.
[3] Balancing Steiner trees and shortest path trees online.
[23] Generating adversaries for request-answer games.
[29] Maintaining hierarchical graph views.
[8] Improved classification via connectivity information.
[75] Efficient dynamic traitor tracing.
[16] Watermarking maps: hiding information in structured data.
[13] Strictly non-blocking WDM cross-connects.
[22] An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).
[3] A faster method for sampling independent sets.
[11] Strong bias of group generators: an obstacle to the ``product replacement algorithm''.
[3] Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings.
[4] An algebraic method to compute a shortest path of local flips between two tilings.
[54] Coloring powers of planar graphs.
[0] Directed network design with orientation constraints.
[7] A (2 + epsilon)-approximation scheme for minimum domination on circle graphs.
[12] An approximation algorithm for finding a long path in Hamiltonian graphs.
[12] TSP-based curve reconstruction in polynomial time.
[37] A tree-edit-distance algorithm for comparing simple, closed shapes.
[12] Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling.
[12] Optimizing the sum of linear fractional functions and applications.
[10] Edge-disjoint paths in expander graphs.
[6] Escaping a grid by edge-disjoint paths.
[3] Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts.
[45] Adaptive set intersections, unions, and differences.
[0] The whole genome assembly of Drosophila.
[16] A 2+epsilon approximation algorithm for the k-MST problem.
[47] The prize collecting Steiner tree problem: theory and practice.
[188] Improved Steiner tree approximation in graphs.
[18] The rectilinear Steiner arborescence problem is NP-complete.
[7] Improved bandwidth approximation for trees.
[0] Faster algorithms for string matching with k mismatches.
[13] On the shared substring alignment problem.
[13] Real scaled matching.
[11] Inplace run-length 2d compressed search.
[5] Pattern matching in dynamic texts.
[56] Towards a theory of cache-efficient algorithms.
[18] Efficient bundle sorting.
[63] Fast concurrent access to parallel disks.
[46] On external memory graph traversal.
[73] Deterministic broadcasting in unknown radio networks.
[5] New and improved algorithms for minsum shop scheduling.
[21] Off-line admission control for general scheduling problems.
[13] Approximating the maximum quadratic assignment problem.
[12] Accurate approximations for Asian options.
[2] Finite-resolution hidden surface removal.
[18] On incremental rendering of silhouette maps of polyhedral scene.
[86] Computing contour trees in all dimensions.
[29] Sweeping simple polygons with a chain of guards.
[11] Finding the closest lattice vector when it's unusually close.
[0] A new bound for the Carathéodory rank of the bases of a matroid.
[6] Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.
[9] Nearly optimal computations with structured matrices.

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