Table of Contents

• Finding Small HolesJeff Erickson. 1 [doi]
• Approximate Range Searching: The Absolute ModelGuilherme Dias da Fonseca. 2-14 [doi]
• Orthogonal Range Searching in Linear and Almost-Linear SpaceYakov Nekrich. 15-26 [doi]
• Spherical LSH for Approximate Nearest Neighbor Search on Unit HypersphereKengo Terasawa, Yuzuru Tanaka. 27-38 [doi]
• A 4/3-Approximation Algorithm for Minimum 3-Edge-ConnectivityPrabhakar Gubbala, Balaji Raghavachari. 39-51 [doi]
• Approximating the Maximum Sharing ProblemAmitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu. 52-63 [doi]
• The Stackelberg Minimum Spanning Tree GameJean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann. 64-76 [doi]
• Edges and Switches, Tunnels and BridgesDavid Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann. 77-88 [doi]
• How to Draw a Clustered TreeGiuseppe Di Battista, Guido Drovandi, Fabrizio Frati. 89-101 [doi]
• Drawing Colored Graphs on Colored PointsMelanie Badent, Emilio Di Giacomo, Giuseppe Liotta. 102-113 [doi]
• Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski MetricMikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu. 114-126 [doi]
• Priority Queues Resilient to Memory FaultsAllan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave. 127-138 [doi]
• Simple and Space-Efficient Minimal Perfect Hash FunctionsFabiano C. Botelho, Rasmus Pagh, Nivio Ziviani. 139-150 [doi]
• A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the PlaneMatthias Müller-Hannemann, Siamak Tazari. 151-162 [doi]
• A Pseudopolynomial Time ::::O:::: (log ::::n:::: )-Approximation Algorithm for Art Gallery ProblemsAjay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma. 163-174 [doi]
• Optimization for First Order Delaunay TriangulationsMarc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. 175-187 [doi]
• Constant Factor Approximations for the Hotlink Assignment ProblemTobias Jacobs. 188-200 [doi]
• Approximation Algorithms for the Sex-Equal Stable Marriage ProblemKazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. 201-213 [doi]
• A Stab at Approximating Minimum Subadditive JoinStaal A. Vinterbo. 214-225 [doi]
• Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two DatasetsMichael A. Langston. 226 [doi]
• Flooding Countries and Destroying DamsRodrigo I. Silveira, René van Oostrum. 227-238 [doi]
• I/O-Efficient Flow Modeling on Fat TerrainsMark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. 239-250 [doi]
• Computing the Visibility Map of Fat ObjectsMark de Berg, Chris Gray. 251-262 [doi]
• Independent Sets in Bounded-Degree HypergraphsMagnús M. Halldórsson, Elena Losievskaja. 263-274 [doi]
• Steiner Tree in Planar Graphs: An ::::O:::: ( ::::n:::: log ::::n:::: ) Approximation Scheme with Singly-Exponential Dependence on EpsilonGlencora Borradaile, Philip N. Klein, Claire Mathieu. 275-286 [doi]
• Computing a Minimum-Depth Planar Graph Embedding in ::::O:::: ( ::::n:::: :::4:::) TimePatrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. 287-299 [doi]
• On a Family of Strong Geometric Spanners That Admit Local Routing StrategiesProsenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu. 300-311 [doi]
• Spanners for Geometric Intersection GraphsMartin Fürer, Shiva Prasad Kasiviswanathan. 312-324 [doi]
• On Generalized Diamond SpannersProsenjit Bose, Aaron Lee, Michiel H. M. Smid. 325-336 [doi]
• The ::::k:::: -Resource Problem on Uniform and on Uniformly Decomposable Metric SpacesMarcin Bienkowski, Jaroslaw Kutylowski. 337-348 [doi]
• On the Robustness of Graham s Algorithm for Online SchedulingMichael Gatto, Peter Widmayer. 349-361 [doi]
• Improved Results for a Memory Allocation ProblemLeah Epstein, Rob van Stee. 362-373 [doi]
• Computational and Structural Advantages of Circular Boundary RepresentationOswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír. 374-385 [doi]
• Alpha-Beta Witness ComplexesDominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko. 386-397 [doi]
• Cauchy s Theorem and Edge Lengths of Convex PolyhedraTherese C. Biedl, Anna Lubiw, Michael J. Spriggs. 398-409 [doi]
• Fixed-Parameter Tractability for Non-Crossing Spanning TreesMagnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama. 410-421 [doi]
• Improved Algorithms for the Feedback Vertex Set ProblemsJianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger. 422-433 [doi]
• Kernelization Algorithms for d-Hitting Set ProblemsFaisal N. Abu-Khzam. 434-445 [doi]
• Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise PointsMaarten Löffler, Marc J. van Kreveld. 446-457 [doi]
• Maximizing Maximal Angles for Plane Straight-Line GraphsOswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber. 458-469 [doi]
• Cuttings for Disks and Axis-Aligned RectanglesEynat Rafalin, Diane L. Souvaine, Csaba D. Tóth. 470-482 [doi]
• Kernelization and Complexity Results for Connectivity Augmentation ProblemsJiong Guo, Johannes Uhlmann. 483-494 [doi]
• An Improved Parameterized Algorithm for the Minimum Node Multiway Cut ProblemJianer Chen, Yang Liu 0002, Songjian Lu. 495-506 [doi]
• Branch and Recharge: Exact Algorithms for Generalized DominationFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff. 507-518 [doi]
• On Computing the Centroid of the Vertices of an Arrangement and Related ProblemsDeepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary. 519-528 [doi]
• Optimal Algorithms for the Weighted ::::p:::: -Center Problems on the Real Line for Small ::::p::::Binay K. Bhattacharya, Qiaosheng Shi. 529-540 [doi]
• Faster Approximation of Distances in GraphsPiotr Berman, Shiva Prasad Kasiviswanathan. 541-552 [doi]
• Approximate Shortest Paths Guided by a Small IndexJörg Derungs, Riko Jacob, Peter Widmayer. 553-564 [doi]
• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor ModelMartin Farach-Colton, Miguel A. Mosteiro. 565-576 [doi]
• Computing Best Coverage Path in the Presence of Obstacles in a Sensor FieldSenjuti Basu Roy, Gautam Das, Sajal Das. 577-588 [doi]
• 35/44-Approximation for Asymmetric Maximum TSP with Triangle InequalityLukasz Kowalik, Marcin Mucha. 589-600 [doi]
• On Euclidean Vehicle Routing with AllocationJan Remy, Reto Spöhel, Andreas Weißl. 601-612 [doi]
• Optimal Lightweight Construction of Suffix Arrays for Constant AlphabetsGe Nong, Sen Zhang. 613-624 [doi]
• Range Non-overlapping Indexing and Successive List IndexingOrgad Keller, Tsvi Kopelowitz, Moshe Lewenstein. 625-636 [doi]
• Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton s Identities and Invertible Bloom FiltersDavid Eppstein, Michael T. Goodrich. 637-648 [doi]
• Dynamic TCP Acknowledgment with Sliding WindowHisashi Koga. 649-660 [doi]