Abstract is missing.
- Approximation Algorithms and Hardness for Domination with PropagationAshkan Aazami, Michael D. Stilp. 1-15 [doi]
- A Knapsack Secretary Problem with ApplicationsMoshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg. 16-28 [doi]
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemJaroslaw Byrka. 29-43 [doi]
- Improved Approximation Algorithms for the Spanning Star Forest ProblemNing Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh. 44-58 [doi]
- Packing and Covering ::::delta:::: -Hyperbolic Spaces by BallsVictor Chepoi, Bertrand Estellon. 59-73 [doi]
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other ProblemsIlias Diakonikolas, Mihalis Yannakakis. 74-88 [doi]
- Two Randomized Mechanisms for Combinatorial AuctionsShahar Dobzinski. 89-103 [doi]
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed GraphsUriel Feige, Mohit Singh. 104-118 [doi]
- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time WindowsGreg N. Frederickson, Barry Wittman. 119-133 [doi]
- Stochastic Steiner Tree with Non-uniform InflationAnupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar. 134-148 [doi]
- On the Approximation Resistance of a Random PredicateJohan Håstad. 149-163 [doi]
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ::::l::::::1:: Embeddability of Negative Type MetricsHamed Hatami, Avner Magen, Evangelos Markakis. 164-179 [doi]
- Optimal Resource Augmentations for Online KnapsackKazuo Iwama, Guochuan Zhang. 180-188 [doi]
- Soft Edge ColoringChadi Kari, Yoo Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin. 189-203 [doi]
- Approximation Algorithms for the Max-Min Allocation ProblemSubhash Khot, Ashok Kumar Ponnuswami. 204-217 [doi]
- Hardness of Embedding Metric Spaces of Equal SizeSubhash Khot, Rishi Saket. 218-227 [doi]
- Coarse Differentiation and Multi-flows in Planar GraphsJames R. Lee, Prasad Raghavendra. 228-241 [doi]
- Maximum Gradient Embeddings and Monotone ClusteringManor Mendel, Assaf Naor. 242-256 [doi]
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing ProblemsViswanath Nagarajan, R. Ravi. 257-270 [doi]
- Encouraging Cooperation in Sharing Supermodular CostsAndreas S. Schulz, Nelson A. Uhan. 271-285 [doi]
- Almost Exact MatchingsRaphael Yuster. 286-295 [doi]
- On Approximating the Average Distance Between PointsKfir Barhum, Oded Goldreich, Adi Shraibman. 296-310 [doi]
- On Locally Decodable Codes, Self-correctable Codes, and ::::t:::: -Private PIROmer Barkol, Yuval Ishai, Enav Weinreb. 311-325 [doi]
- A Sequential Algorithm for Generating Random GraphsMohsen Bayati, Jeong Han Kim, Amin Saberi. 326-340 [doi]
- Local Limit Theorems for the Giant Component of Random HypergraphsMichael Behrisch, Amin Coja-Oghlan, Mihyun Kang. 341-352 [doi]
- Derandomization of Euclidean Random WalksIlia Binder, Mark Braverman. 353-365 [doi]
- High Entropy Random Selection ProtocolsHarry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin. 366-379 [doi]
- Testing ::::st:::: -ConnectivitySourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman. 380-394 [doi]
- Properly 2-Colouring Linear HypergraphsArkadev Chattopadhyay, Bruce A. Reed. 395-408 [doi]
- Random Subsets of the Interval and P2P ProtocolsJacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski. 409-421 [doi]
- The Cover Time of Random DigraphsColin Cooper, Alan M. Frieze. 422-435 [doi]
- Eigenvectors of Random Graphs: Nodal DomainsYael Dekel, James R. Lee, Nathan Linial. 436-448 [doi]
- Lower Bounds for Swapping Arthur and MerlinScott Diehl. 449-463 [doi]
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objectsEldar Fischer, Eyal Rozenberg. 464-478 [doi]
- On Estimating Frequency Moments of Data StreamsSumit Ganguly, Graham Cormode. 479-493 [doi]
- Distribution-Free Testing Lower Bounds for Basic Boolean FunctionsDana Glasner, Rocco A. Servedio. 494-508 [doi]
- On the Randomness Complexity of Property TestingOded Goldreich, Or Sheffet. 509-524 [doi]
- On the Benefits of Adaptivity in Property Testing of Dense GraphsMira Gonen, Dana Ron. 525-539 [doi]
- Slow Mixing of Markov Chains Using Fault Lines and Fat ContoursSam Greenberg, Dana Randall. 540-553 [doi]
- Better Binary List-Decodable Codes Via Multilevel ConcatenationVenkatesan Guruswami, Atri Rudra. 554-568 [doi]
- Worst-Case to Average-Case Reductions RevisitedDan Gutfreund, Amnon Ta-Shma. 569-583 [doi]
- On Finding Frequent Elements in a Data StreamRavi Kumar, Rina Panigrahy. 584-595 [doi]
- Implementing Huge Sparse Random GraphsMoni Naor, Asaf Nussboim. 596-608 [doi]
- Sublinear Algorithms for Approximating String CompressibilitySofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith. 609-623 [doi]