Table of Contents

• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget ConstraintsAkiyoshi Shioura. 1-12 [doi]
• Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed GraphLoukas Georgiadis. 13-24 [doi]
• Improved Approximation Algorithms for Bipartite Correlation ClusteringNir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen. 25-36 [doi]
• Bounds on Greedy Algorithms for MAX SATMatthias Poloczek. 37-48 [doi]
• Approximating Minimum Manhattan Networks in Higher DimensionsAparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff. 49-60 [doi]
• On Isolating Points Using DisksMatt Gibson, Gaurav Kanade, Kasturi R. Varadarajan. 61-69 [doi]
• An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi DiagramChih-Hung Liu, Evanthia Papadopoulou, D. T. Lee. 70-81 [doi]
• Can Nearest Neighbor Searching Be Simple and Always Fast?Victor Alvarez, David G. Kirkpatrick, Raimund Seidel. 82-92 [doi]
• On the Approximation Performance of Fictitious Play in Finite GamesPaul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre. 93-105 [doi]
• How Profitable Are Strategic Behaviors in a Market?Ning Chen, Xiaotie Deng, Jie Zhang. 106-118 [doi]
• Improving the Price of Anarchy for Selfish Routing via Coordination MechanismsGeorge Christodoulou, Kurt Mehlhorn, Evangelia Pyrga. 119-130 [doi]
• Algorithms for Finding a Maximum Non-k-linked GraphYusuke Kobayashi, Yuichi Yoshida. 131-142 [doi]
• An /mathcal{O}(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid GraphsAndreas Emil Feldmann, Peter Widmayer. 143-154 [doi]
• Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) TimeJakub Lacki, Piotr Sankowski. 155-166 [doi]
• Near-Popular Matchings in the Roommates ProblemChien-Chung Huang, Telikepalli Kavitha. 167-179 [doi]
• The Hospitals/Residents Problem with Quota Lower BoundsKoki Hamada, Kazuo Iwama, Shuichi Miyazaki. 180-191 [doi]
• Multi-parameter Mechanism Design under Budget and Matroid ConstraintsMonika Henzinger, Angelina Vidali. 192-202 [doi]
• Quantified Linear Programs: A Computational StudyThorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf. 203-214 [doi]
• Recoverable Robustness by Column GenerationP. C. Bouman, J. M. van den Akker, J. A. Hoogeveen. 215-226 [doi]
• Passenger Flow-Oriented Train DispositionAnnabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee. 227-238 [doi]
• Better Bounds for Incremental Frequency Allocation in Bipartite GraphsMarek Chrobak, Lukasz Jez, Jiri Sgall. 251-262 [doi]
• Two-Bounded-Space Bin Packing RevisitedMarek Chrobak, Jiri Sgall, Gerhard J. Woeginger. 263-274 [doi]
• Output-Sensitive Listing of Bounded-Size Trees in Undirected GraphsRui Ferreira, Roberto Grossi, Romeo Rizzi. 275-286 [doi]
• Exact Algorithm for the Maximum Induced Planar Subgraph ProblemFedor V. Fomin, Ioan Todinca, Yngve Villanger. 287-298 [doi]
• Scheduling Partially Ordered Jobs Faster Than 2 nMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 299-310 [doi]
• AdCell: Ad Allocation in Cellular NetworksSaeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha. 311-322 [doi]
• Submodular Max-SATYossi Azar, Iftah Gamzu, Ran Roth. 323-334 [doi]
• On Variants of the Matroid Secretary ProblemShayan Oveis Gharan, Jan Vondrák. 335-346 [doi]
• Hitting Sets Online and Vertex RankingGuy Even, Shakhar Smorodinsky. 347-357 [doi]
• Fast Sub-exponential Algorithms and Compactness in Planar GraphsDimitrios M. Thilikos. 358-369 [doi]
• Isomorphism of (mis)Labeled GraphsPascal Schweitzer. 370-381 [doi]
• Paths, Flowers and Vertex CoverVenkatesh Raman, M. S. Ramanujan, Saket Saurabh. 382-393 [doi]
• Hitting and Harvesting PumpkinsGwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. 394-407 [doi]
• Deterministic Discrepancy MinimizationNikhil Bansal, Joel Spencer. 408-420 [doi]
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and DeterministicPawel Gawrychowski. 421-432 [doi]
• An Experimental Study on Approximating K Shortest Simple PathsAsaf Frieder, Liam Roditty. 433-444 [doi]
• Scope-Based Route PlanningPetr Hlinený, Ondrej Moris. 445-456 [doi]
• Maximum Flows by Incremental Breadth-First SearchAndrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck. 457-468 [doi]
• Engineering Multilevel Graph Partitioning AlgorithmsPeter Sanders, Christian Schulz. 469-480 [doi]
• A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the PlaneDanny Z. Chen, Haitao Wang. 481-492 [doi]
• Motion Planning via Manifold SamplesOren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin. 493-505 [doi]
• Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the PlaneNabil H. Mustafa, Saurabh Ray, Mudassir Shabbir. 506-517 [doi]
• Improved Algorithms for Partial Curve MatchingAnil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh. 518-529 [doi]
• On the Configuration-LP for Scheduling on Unrelated MachinesJosé Verschae, Andreas Wiese. 530-542 [doi]
• Resource Allocation for Covering Time Varying DemandsVenkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal. 543-554 [doi]
• Mixed-Criticality Scheduling of Sporadic Task SystemsSanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie. 555-566 [doi]
• Robust Algorithms for Preemptive SchedulingLeah Epstein, Asaf Levin. 567-578 [doi]
• Approximate Distance Queries for Weighted Polyhedral SurfacesHristo Djidjev, Christian Sommer. 579-590 [doi]
• The Union of Probabilistic Boxes: Maintaining the VolumeHakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri. 591-602 [doi]
• Preprocess, Set, Query!Ely Porat, Liam Roditty. 603-614 [doi]
• Cuckoo Hashing with PagesMartin Dietzfelbinger, Michael Mitzenmacher, Michael Rink. 615-627 [doi]
• Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant DemandsAndreas S. Schulz, Claudio Telha. 628-639 [doi]
• Approximation Algorithms for Conflict-Free Vehicle RoutingKaspar Schüpbach, Rico Zenklusen. 640-651 [doi]
• A /frac{3}{2} Approximation for a Constrained Forest ProblemBasile Couëtoux. 652-663 [doi]
• External-Memory Network Analysis Algorithms for Naturally Sparse GraphsMichael T. Goodrich, Pawel Pszona. 664-676 [doi]
• Approximate Counting of Cycles in StreamsMadhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun. 677-688 [doi]
• Algorithms for Solving Rubik s CubesErik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow. 689-700 [doi]
• Boundary Patrolling by Mobile Agents with Distinct Maximal SpeedsJurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis. 701-712 [doi]
• Optimal Discovery Strategies in White Space NetworksYossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda. 713-722 [doi]
• Social-Aware Forwarding Improves Routing Performance in Pocket Switched NetworksJosep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa. 723-735 [doi]
• Tolerant AlgorithmsRolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff. 736-747 [doi]
• Alphabet-Independent Compressed Text IndexingDjamal Belazzougui, Gonzalo Navarro. 748-759 [doi]
• Distribution-Aware Compressed Full-Text IndexesPaolo Ferragina, Jouni Sirén, Rossano Venturini. 760-771 [doi]
• Smoothed Performance Guarantees for Local SearchTobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld. 772-783 [doi]
• Improved Approximations for k-Exchange Systems - (Extended Abstract)Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward. 784-798 [doi]
• Cover-Decomposition and Polychromatic NumbersBéla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott. 799-810 [doi]