Abstract is missing.
- Correlation Clustering with Partial InformationErik D. Demaine, Nicole Immorlica. 1-13 [doi]
- Improved Linear Time Approximation Algorithms for Weighted MatchingsDoratha E. Drake, Stefan Hougardy. 14-23 [doi]
- Covering Graphs Using Trees and StarsGuy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha. 24-35 [doi]
- An Improved Decomposition Theorem for Graphs Excluding a Fixed MinorJittat Fakcharoenphol, Kunal Talwar. 36-46 [doi]
- Approximation Algorithms for Channel Allocation Problems in Broadcast NetworksRajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang. 47-58 [doi]
- Asymmetry in k-Center VariantsInge Li Gørtz, Anthony Wirth. 59-70 [doi]
- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit TimesAlexander Hall, Katharina Langkau, Martin Skutella. 71-82 [doi]
- On the Complexity of Approximating k-Dimensional MatchingElad Hazan, Shmuel Safra, Oded Schwartz. 83-97 [doi]
- Approximating Market EquilibriaKamal Jain, Mohammad Mahdian, Amin Saberi. 98-108 [doi]
- Approximating the Degree-Bounded Minimum Diameter Spanning Tree ProblemJochen Könemann, Asaf Levin, Amitabh Sinha. 109-121 [doi]
- On the Hardness of Approximate Multivariate IntegrationIoannis Koutis. 122-128 [doi]
- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location ProblemMohammad Mahdian, Yingyu Ye, Jiawei Zhang. 129-140 [doi]
- Approximating Rooted Connectivity Augmentation ProblemsZeev Nutov. 141-152 [doi]
- Effective Routing and Scheduling in Adversarial Queueing NetworksJay Sethuraman, Chung-Piaw Teo. 153-164 [doi]
- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data PlacementHadas Shachnai, Tami Tamir. 165-177 [doi]
- An Improved Algorithm for Approximating the Radii of Point SetsYingyu Ye, Jiawei Zhang. 178-187 [doi]
- Testing Low-Degree Polynomials over GF(2(Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. 188-199 [doi]
- Computational Analogues of EntropyBoaz Barak, Ronen Shaltiel, Avi Wigderson. 200-215 [doi]
- Bounds on 2-Query Codeword TestingEli Ben-Sasson, Oded Goldreich, Madhu Sudan. 216-227 [doi]
- The Lovász Number of Random GraphsAmin Coja-Oghlan. 228-239 [doi]
- Perfectly Balanced AllocationArtur Czumaj, Chris Riley, Christian Scheideler. 240-251 [doi]
- On Extracting Private Randomness over a Public ChannelYevgeniy Dodis, Roberto Oliveira. 252-263 [doi]
- High Degree Vertices and Eigenvalues in the Preferential Attachment GraphAbraham Flaxman, Alan M. Frieze, Trevor I. Fenner. 264-274 [doi]
- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction ProblemsAlan M. Frieze, Michael Molloy. 275-289 [doi]
- Continuous-Time Quantum Walks on the Symmetric GroupHeath Gerhardt, John Watrous. 290-301 [doi]
- Distribution-Free Property TestingShirley Halevy, Eyal Kushilevitz. 302-317 [doi]
- On the Graph-Density of Random 0/1-PolytopesVolker Kaibel, Anja Remshagen. 318-328 [doi]
- A Gambling Game Arising in the Analysis of Adaptive Randomized RoundingRichard M. Karp, Claire Kenyon. 329-340 [doi]
- Tight Bounds for Testing Bipartiteness in General GraphsTali Kaufman, Michael Krivelevich, Dana Ron. 341-353 [doi]
- Discrete Quantum Walks Hit Exponentially FasterJulia Kempe. 354-369 [doi]
- Approximate Testing of Visual PropertiesSofya Raskhodnikova. 370-381 [doi]
- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse InstancesAlex D. Scott, Gregory B. Sorkin. 382-395 [doi]
- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite GeometriesJun Tarui, Toshiya Itoh, Yoshinori Takei. 396-408 [doi]