**[146]**Analysis of a Local Search Heuristic for Facility Location Problems.**[96]**Minimizing Service and Operation Costs of Periodic Scheduling .**[88]**A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.**[47]**A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP.**[1]**Computing Univariate GCDs over Number Fields.**[4]**Extended Hilbert Irreducibility and its Applications.**[5]**Reconstructing Randomly Sampled Multivariate Polynomials from Highly Noisy Data.**[7]**Approximate Polynomials Gcds, Padé Approximation, Polynomial Zeros and Bipartite Graphs.**[31]**LRU is Better than FIFO.**[69]**On-Line File Caching.**[7]**Competitive Algorithms for Multilevel Caching and Relaxed List Update .**[10]**Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.**[40]**Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles .**[31]**I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking .**[28]**Collision Detection in Aspect and Scale Bounded Polyhedra.**[15]**An Efficient Algorithm for the Three-Dimensional Diameter Problem.**[7]**Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.**[19]**Exact Arithmetic at Low Cost - A Case Study in Linear Programming.**[13]**A Faster Algorithm for Minimum Cost Submodular Flows.**[45]**The Ultimate Interval Graph Recognition Algorithm? .**[5]**Sparse 0-1-Matrices and Forbidden Hypergraphs .**[11]**Fast Backtracking Principles Applied to Find New Cages.**[119]**Approximation Algorithms for Directed Steiner Problems.**[55]**Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.**[48]**New Approximation Techniques for Some Ordering Problems.**[13]**On the Distributed Complexity of Computing Maximal Matchings.**[3]**The Power of Migration in Multi-Processor Scheduling of Real-Time Systems.**[36]**Computation in Noisy Radio Networks.**[53]**A 3/2-Approximation Algorithm for Sorting by Reversals.**[89]**A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.**[18]**A New Approximation Algorithm for the Planar Augmentation Problem.**[134]**Flow and Stretch Metrics for Scheduling Continuous Job Streams.**[6]**Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.**[23]**Average-Case Analyses of First Fit and Random Fit Bin Packing.**[12]**A Probabilistic Algorithm for Updating Files over a Communication Link.**[32]**Edge-Connectivity Augmentation with Partition Constraints.**[47]**Exploring Unknown Undirected Graphs.**[27]**On-line Randomized Call Control Revisited.**[128]**Ring Routing and Wavelength Translation.**[19]**Direct Routing on Trees .**[39]**Faster Random Generation of Linear Extensions.**[26]**Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.**[80]**Analysis of Random Processes via And-Or Tree Evaluation.**[0]**Output-Sensitive Generation of Random Events.**[50]**On Approximating Rectangle Tiling and Packing.**[9]**The Maximum Subforest Problem: Approximation and Exact Algorithms .**[1]**Matroid Decomposition Methods for the Set Maxima Problem.**[4]**The Dynamic Servers Problem.**[9]**Bounding the Diffuse Adversary.**[25]**Optimal Edge Ranking of Trees in Linear Time.**[24]**Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication.**[39]**An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.**[34]**Approximate String Matching: A Simpler Faster Algorithm.**[14]**Fast Distributed Algorithms for {Brooks-Vizing} Colourings.**[7]**Mutual Search .**[17]**Better Random Sampling Algorithms for Flows in Undirected Graphs.**[12]**Augmenting Undirected Edge Connectivity in Õ(n²) Time.**[9]**Go with the Winners for Graph Bisection.**[33]**Two New Upper Bounds for SAT.**[33]**The Analysis of Hybrid Trie Structures.**[16]**Finger Search Trees with Constant Insertion Time.**[27]**Faster Deterministic Sorting and Priority Queues in Linear Space.**[18]**Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries.**[24]**On Local Register Allocation.**[13]**Linear-Time Register Allocation for a Fixed Number of Registers.**[2]**Multi-Item Inventory Staggering Problems: Heuristic and Bounds.**[45]**Finding a Large Hidden Clique in a Random Graph.**[9]**Learning Deterministic Finite Automata from Smallest Counterexamples.**[5]**On the Exact Worst Case Query Complexity of Planar Point Location.**[52]**Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs.**[20]**Analysis of First-Come-First-Serve Parallel Job Scheduling.**[18]**Spatial Codes and the Hardness of String Folding Problems .**[195]**Greedy Strikes Back: Improved Facility Location Algorithms.**[73]**Exact and Approximation Algorithms for Clustering .**[2717]**Authoritative Sources in a Hyperlinked Environment.**[17]**Hiding Cliques for Cryptographic Security.**[30]**Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems .**[98]**Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions.

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