Articles under category:
Algorithms
 ToC Library Graduate Surveys 5 (2013) 60 pages Fast Matrix Multiplication
 Vol 10, Article 13 (pp 341-358) [APRX-RND12 Spec Issue] Approximation Algorithm for Non-Boolean Max-$k$-CSP
 Vol 10, Article 12 (pp 297-339) Width-Parametrized SAT: Time--Space Tradeoffs
 Vol 10, Article 11 (pp 257-295) Efficient Rounding for the Noncommutative Grothendieck Inequality by Assaf Naor, Oded Regev, and Thomas Vidick
 Vol 10, Article 10 (pp 237-256) Lower Bounds for the Average and Smoothed Number of Pareto-Optima
 Vol 9, Article 30 (pp 897-945) Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
 Vol 9, Article 19 (pp 617-651) Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems by Uriel Feige, Elchanan Mossel, and Dan Vilenchik
 Vol 8, Article 26 (pp 597-622) A Constant-Factor Approximation Algorithm for Co-clustering
 Vol 8, Article 25 (pp 567-595) [Motwani Special Issue] Online Graph Edge-Coloring in the Random-Order Arrival Model
 Vol 8, Article 24 (pp 533-565) Solving Packing Integer Programs via Randomized Rounding with Alterations
 Vol 8, Article 20 (pp 429-460) [Motwani Special Issue] Budget-Constrained Auctions with Heterogeneous Items
 Vol 8, Article 19 (pp 415-428) Distance Transforms of Sampled Functions
 Vol 8, Article 18 (pp 401-413) [Motwani Special Issue] An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design by Julia Chuzhoy and Sanjeev Khanna
 Vol 8, Article 15 (pp 351-368) [Motwani Special Issue] One Tree Suffices: A Simultaneous $O(1)$-Approximation for Single-Sink Buy-at-Bulk by Ashish Goel and Ian Post
 Vol 8, Article 14 (pp 321-350) [Motwani Special Issue] Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
 Vol 8, Article 9 (pp 209-229) [Motwani Special Issue] Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule by Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, and Kirk Pruhs
 Vol 8, Article 7 (pp 165-195) [Motwani Special Issue] Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
 Vol 8, Article 6 (pp 121-164) [RESEARCH SURVEY] The Multiplicative Weights Update Method: a Meta-Algorithm and Applications by Sanjeev Arora, Elad Hazan, and Satyen Kale
 Vol 8, Article 4 (pp 69-94) [Motwani Special Issue] Regularity Lemmas and Combinatorial Algorithms by Nikhil Bansal and Ryan Williams
 Vol 7, Article 5 (pp 49-74) Metric Clustering via Consistent Labeling
 Vol 7, Article 2 (pp 19-25) [NOTE] Inverting a Permutation is as Hard as Unordered Search
 Vol 6, Article 11 (pp 247-290) The Submodular Welfare Problem with Demand Queries by Uriel Feige and Jan Vondrák
 Vol 6, Article 8 (pp 179-199) Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games by Avrim Blum, Eyal Even-Dar, and Katrina Ligett
 Vol 6, Article 2 (pp 27-46) Reordering Buffers for General Metric Spaces
 Vol 5, Article 9 (pp 173-189) All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time
 Vol 5, Article 4 (pp 83-117) SDP Gaps and UGC-hardness for Max-Cut-Gain by Subhash Khot and Ryan O'Donnell
 Vol 4, Article 9 (pp 191-193) [COMMENT] On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
 Vol 4, Article 5 (pp 111-128) Approximation Algorithms for Unique Games
 Vol 4, Article 2 (pp 21-51) Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
 Vol 4, Article 1 (pp 1-20) Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
 Vol 3, Article 11 (pp 211-219) The Randomized Communication Complexity of Set Disjointness by Johan Håstad and Avi Wigderson
 Vol 3, Article 10 (pp 197-209) An   O(log n)   Approximation Ratio for the Asymmetric Traveling Salesman Path Problem by Chandra Chekuri and Martin Pál ■
 Vol 3, Article 9 (pp 179-195) Approximation Algorithms and Online Mechanisms for Item Pricing
 Vol 3, Article 8 (pp 159-177) Removing Degeneracy May Require a Large Dimension Increase by Jiří Matoušek and Petr Škovroň
 Vol 3, Article 1 (pp 1-23) Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia
 Vol 2, Article 13 (pp 249-266) Correlation Clustering with a Fixed Number of Clusters
 Vol 2, Article 12 (pp 225-247) Matrix Approximation and Projective Clustering via Volume Sampling
 Vol 2, Article 11 (pp 207-224) Embedding the Ulam metric into ℓ1
 Vol 2, Article 10 (pp 185-206) Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka
 Vol 2, Article 8 (pp 147-172) On Learning Random DNF Formulas Under the Uniform Distribution
 Vol 2, Article 7 (pp 137-146) An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow
 Vol 2, Article 4 (pp 65-90) Rank Bounds and Integrality Gaps for Cutting Planes Procedures
 Vol 2, Article 3 (pp 53-64) An Improved Approximation Ratio for the Covering Steiner Problem
 Vol 2, Article 2 (pp 19-51) Proving Integrality Gaps without Knowing the Linear Program
 Vol 1, Article 6 (pp 105-117) Combining Online Algorithms for Acceptance and Rejection by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour