Table of Contents

• Flexible Path Planning Using Corridor MapsMark H. Overmars, Ioannis Karamouzas, Roland Geraerts. 1-12 [doi]
• A Bridging Model for Multi-core ComputingLeslie G. Valiant. 13-28 [doi]
• Robust Kinetic Convex Hulls in 3DUmut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu. 29-40 [doi]
• On Dominance Reporting in 3DPeyman Afshani. 41-51 [doi]
• Stabbing Convex Polygons with a Segment or a PolygonPankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang. 52-63 [doi]
• An Efficient Algorithm for 2D Euclidean 2-Center with OutliersPankaj K. Agarwal, Jeff M. Phillips. 64-75 [doi]
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded AsymmetrySpyros Angelopoulos. 76-87 [doi]
• Cache-Oblivious Red-Blue Line Segment IntersectionLars Arge, Thomas Mølhave, Norbert Zeh. 88-99 [doi]
• The Complexity of Bisectors and Voronoi Diagrams on Realistic TerrainsBoris Aronov, Mark de Berg, Shripad Thite. 100-111 [doi]
• Space-Time Tradeoffs for Proximity Searching in Doubling SpacesSunil Arya, David M. Mount, Antoine Vigneron, Jian Xia. 112-123 [doi]
• A Scaling Algorithm for the Maximum Node-Capacitated Multiflow ProblemMaxim A. Babenko, Alexander V. Karzanov. 124-135 [doi]
• Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level GraphsChristian Bachmaier, Wolfgang Brunner. 136-147 [doi]
• Straight Skeletons of Three-Dimensional PolyhedraGill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman. 148-160 [doi]
• Randomized Competitive Analysis for Two-Server ProblemsWolfgang W. Bein, Kazuo Iwama, Jun Kawahara. 161-172 [doi]
• Decompositions and Boundary Coverings of Non-convex Fat PolyhedraMark de Berg, Chris Gray. 173-184 [doi]
• Approximating Multi-criteria Max-TSPMarkus Bläser, Bodo Manthey, Oliver Putz. 185-197 [doi]
• An Integer Programming Algorithm for Routing Optimization in IP NetworksAndreas Bley. 198-209 [doi]
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time SchedulingVincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller. 210-221 [doi]
• Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning TreePaul S. Bonsma, Frederic Dorn. 222-233 [doi]
• Engineering Tree Labeling Schemes: A Case Study on Least Common AncestorsSaverio Caminiti, Irene Finocchi, Rossella Petreschi. 234-245 [doi]
• A Practical Quicksort Algorithm for Graphics ProcessorsDaniel Cederman, Philippas Tsigas. 246-258 [doi]
• Bloomier Filters: A Second LookDenis Xavier Charles, Kumar Chellapilla. 259-270 [doi]
• Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation TherapyDanny Z. Chen, Shuang Luan, Chao Wang. 271-283 [doi]
• A New Approach to Exact Crossing MinimizationMarkus Chimani, Petra Mutzel, Immanuel M. Bomze. 284-296 [doi]
• A Characterization of 2-Player Mechanisms for SchedulingGeorge Christodoulou, Elias Koutsoupias, Angelina Vidali. 297-307 [doi]
• A Local-Search 2-Approximation for 2-Correlation-ClusteringTom Coleman, James Saunderson, Anthony Wirth. 308-319 [doi]
• The Alcuin Number of a GraphPéter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger. 320-331 [doi]
• Time-Dependent SHARC-RoutingDaniel Delling. 332-343 [doi]
• Detecting Regular Visit PatternsBojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle. 344-355 [doi]
• Improved Approximation Algorithms for Relay PlacementAlon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela. 356-367 [doi]
• Selfish Bin PackingLeah Epstein, Elena Kleiman. 368-380 [doi]
• Improved Randomized Results for That Interval Selection ProblemLeah Epstein, Asaf Levin. 381-392 [doi]
• Succinct Representations of Arbitrary GraphsArash Farzan, J. Ian Munro. 393-404 [doi]
• Edge Coloring and Decompositions of Weighted GraphsUriel Feige, Mohit Singh. 405-416 [doi]
• The Complexity of Sorting with Networks of Stacks and QueuesStefan Felsner, Martin Pergel. 417-429 [doi]
• Faster Steiner Tree Computation in Polynomial-SpaceFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. 430-441 [doi]
• Fitting a Step Function to a Point SetHervé Fournier, Antoine Vigneron. 442-453 [doi]
• Faster Swap Edge Computation in Minimum Diameter Spanning TreesBeat Gfeller. 454-465 [doi]
• The Partial Augment-Relabel Algorithm for the Maximum Flow ProblemAndrew V. Goldberg. 466-477 [doi]
• An Optimal Dynamic Spanner for Doubling Metric SpacesLee-Ad Gottlieb, Liam Roditty. 478-489 [doi]
• RFQ: Redemptive Fair QueuingAjay Gulati, Peter J. Varman. 490-502 [doi]
• Range MediansSariel Har-Peled, S. Muthukrishnan. 503-514 [doi]
• Locality and Bounding-Box Quality of Two-Dimensional Space-Filling CurvesHerman J. Haverkort, Freek van Walderveen. 515-527 [doi]
• Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic ComparisonBenjamin Hiller, Tjark Vredeveld. 528-539 [doi]
• On the Complexity of Optimal Hotlink AssignmentTobias Jacobs. 540-552 [doi]
• Oblivious Randomized Direct Search for Real-Parameter OptimizationJens Jägersküpper. 553-564 [doi]
• Path Minima in Incremental Unrooted TreesHaim Kaplan, Nira Shafrir. 565-576 [doi]
• Improved Competitive Performance Bounds for CIOQ SwitchesAlexander Kesselman, Kirill Kogan, Michael Segal. 577-588 [doi]
• Two-Stage Robust Network Design with Exponential ScenariosRohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour. 589-600 [doi]
• An Optimal Incremental Algorithm for Minimizing Lateness with RejectionSamir Khuller, Julián Mestre. 601-610 [doi]
• More Robust Hashing: Cuckoo Hashing with a StashAdam Kirsch, Michael Mitzenmacher, Udi Wieder. 611-622 [doi]
• Better and Simpler Approximation Algorithms for the Stable Marriage ProblemZoltán Király. 623-634 [doi]
• Edit Distances and Factorisations of Even PermutationsAnthony Labarre. 635-646 [doi]
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job CountTak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong. 647-659 [doi]
• Facility Location in Dynamic Geometric Data StreamsChristiane Lammersen, Christian Sohler. 660-671 [doi]
• The Effects of Local Randomness in the Adversarial Queueing ModelYann Lorion, Maik Weinard. 672-683 [doi]
• Parallel Imaging ProblemThành Nguyen, Éva Tardos. 684-695 [doi]
• An Online Algorithm for Finding the Longest Previous FactorsDaisuke Okanohara, Kunihiko Sadakane. 696-707 [doi]
• Collusion-Resistant Mechanisms with Verification Yielding Optimal SolutionsPaolo Penna, Carmine Ventre. 708-719 [doi]
• Improved BDD Algorithms for the Simulation of Quantum CircuitsVasilis Samoladas. 720-731 [doi]
• Mobile Route PlanningPeter Sanders, Dominik Schultes, Christian Vetter. 732-743 [doi]
• How Reliable Are Practical Point-in-Polygon Strategies?Stefan Schirra. 744-755 [doi]
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization ApproachNatalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich. 756-767 [doi]
• Approximability of Average Completion Time Scheduling on Unrelated MachinesRené A. Sitters. 768-779 [doi]
• Relative Convex Hulls in Semi-dynamic SubdivisionsMashhood Ishaque, Csaba D. Tóth. 780-792 [doi]
• An Experimental Analysis of Robinson-Foulds Distance Matrix AlgorithmsSeung-Jin Sul, Tiffani L. Williams. 793-804 [doi]
• On the Size of the 3D Visibility Skeleton: Experimental ResultsLinqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides. 805-816 [doi]
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed DimensionsHamid Zarrabi-Zadeh. 817-829 [doi]
• Deterministic Sampling Algorithms for Network DesignAnke van Zuylen. 830-841 [doi]