11. WADS 2009: Banff, Canada

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

Last update Fri May 25 08:47:28 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page