Table of Contents

• On the Power of the Semi-Separated Pair DecompositionMohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid. 1-12 [doi]
• Plane Graphs with Parity ConstraintsOswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber. 13-24 [doi]
• Straight-Line Rectangular Drawings of Clustered GraphsPatrizio Angelini, Fabrizio Frati, Michael Kaufmann. 25-36 [doi]
• Online Priority Steiner Tree ProblemsSpyros Angelopoulos. 37-48 [doi]
• Connect the Dot: Computing Feed-Links with Minimum DilationBoris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann. 49-60 [doi]
• Minimal Locked TreesBrad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon. 61-73 [doi]
• Approximating Transitive Reductions for Directed NetworksPiotr Berman, Bhaskar DasGupta, Marek Karpinski. 74-85 [doi]
• 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2Piotr Berman, Marek Karpinski, Alexander Zelikovsky. 86-97 [doi]
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text IndexingProsenjit Bose, Meng He, Anil Maheshwari, Pat Morin. 98-109 [doi]
• A Distribution-Sensitive Dictionary with Low Space OverheadProsenjit Bose, John Howat, Pat Morin. 110-118 [doi]
• A Comparison of Performance Measures for Online AlgorithmsJoan Boyar, Sandy Irani, Kim S. Larsen. 119-130 [doi]
• Delaunay Triangulation of Imprecise Points Simplified and ExtendedKevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer. 131-143 [doi]
• An Improved SAT Algorithm in Terms of Formula LengthJianer Chen, Yang Liu 0002. 144-155 [doi]
• Shortest Path Problems on a Polyhedral SurfaceAtlas F. Cook, Carola Wenk. 156-167 [doi]
• Approximation Algorithms for Buy-at-Bulk Geometric Network DesignArtur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski. 168-180 [doi]
• Rank-Sensitive Priority QueuesBrian C. Dean, Zachary H. Jones. 181-192 [doi]
• Skip-Splay: Toward Achieving the Unified Bound in the BST ModelJonathan Derryberry, Daniel Dominic Sleator. 194-205 [doi]
• Drawing Graphs with Right Angle CrossingsWalter Didimo, Peter Eades, Giuseppe Liotta. 206-217 [doi]
• Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff DistanceReza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala. 218-229 [doi]
• Efficient Construction of Near-Optimal Binary and Multiway Search TreesProsenjit Bose, Karim Douïeb. 230-241 [doi]
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering ProblemWenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker. 242-253 [doi]
• On Reconfiguration of Disks in the Plane and Related ProblemsAdrian Dumitrescu, Minghui Jiang. 254-265 [doi]
• Orientation-Constrained Rectangular LayoutsDavid Eppstein, Elena Mumford. 266-277 [doi]
• The ::::h::::-Index of a Graph and Its Application to Dynamic Subgraph StatisticsDavid Eppstein, Emma S. Spiro. 278-289 [doi]
• Optimal Embedding into Star MetricsDavid Eppstein, Kevin A. Wortman. 290-301 [doi]
• Online Square PackingSándor P. Fekete, Tom Kamphans, Nils Schweer. 302-314 [doi]
• New Results on Visibility in Simple PolygonsAlexander Gilbers, Rolf Klein. 327-338 [doi]
• Dynamic Graph Clustering Using Minimum-Cut TreesRobert Görke, Tanja Hartmann, Dorothea Wagner. 339-350 [doi]
• Rank-Balanced TreesBernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan. 351-362 [doi]
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line SegmentsFarzad Hassanzadeh, David Rappaport. 363-374 [doi]
• Reconfiguration of List Edge-Colorings in a GraphTakehiro Ito, Marcin Kaminski, Erik D. Demaine. 375-386 [doi]
• The Simultaneous Representation Problem for Chordal, Comparability and Permutation GraphsKrishnam Raju Jampani, Anna Lubiw. 387-398 [doi]
• Two for One: Tight Approximation of 2D Bin PackingKlaus Jansen, Lars Prädel, Ulrich M. Schwarz. 399-410 [doi]
• Fault Tolerant External Memory AlgorithmsGerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave. 411-422 [doi]
• Inspecting a Set of Strips OptimallyTom Kamphans, Elmar Langetepe. 423-434 [doi]
• A Pseudopolynomial Algorithm for Alexandrov s TheoremDaniel M. Kane, Gregory N. Price, Erik D. Demaine. 435-446 [doi]
• A Scheme for Computing Minimum Covers within Simple RegionsMatthew J. Katz, Gila Morgenstern. 447-458 [doi]
• Better Approximation Algorithms for the Maximum Internal Spanning Tree ProblemMartin Knauer, Joachim Spoerhase. 459-470 [doi]
• Two Approximation Algorithms for ATSP with Strengthened Triangle InequalityLukasz Kowalik, Marcin Mucha. 471-482 [doi]
• Streaming Embeddings with SlackChristiane Lammersen, Anastasios Sidiropoulos, Christian Sohler. 483-494 [doi]
• Computing the Implicit Voronoi Diagram in Triple PrecisionDavid L. Millman, Jack Snoeyink. 495-506 [doi]
• Efficient Approximation of Combinatorial Problems by Moderately Exponential AlgorithmsNicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. 507-518 [doi]
• Integer Programming: Optimization and Evaluation Are EquivalentJames B. Orlin, Abraham P. Punnen, Andreas S. Schulz. 519-529 [doi]
• Resolving Loads with Positive Interior StressesGünter Rote, André Schulz. 530-541 [doi]
• On Making Directed Graphs TransitiveMathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. 542-553 [doi]
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled TreesHiroaki Yamamoto, Daichi Takenouchi. 554-565 [doi]
• Compact and Low Delay Routing Labeling Scheme for Unit Disk GraphsChenyu Yan, Yang Xiang, Feodor F. Dragan. 566-577 [doi]