Algorithmica, Volume 47, 2007

Volume 47, Number 1, January 2007

• Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter:
  External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. 1-25
  
• Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
  Tree Spanners for Bipartite Graphs and Probe Interval Graphs. 27-51
  
• Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar:
  Approximation Algorithms for the Unsplittable Flow Problem. 53-78
  
• Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
  Selfish Load Balancing and Atomic Congestion Games. 79-96
  
• Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik:
  Deterministic Communication in Radio Networks with Large Labels. 97-117
  

Volume 47, Number 2, February 2007

• Stavros D. Nikolopoulos, Leonidas Palios:
  Detecting Holes and Antiholes in Graphs. 119-138
  
• Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster:
  Safe Reduction Rules for Weighted Treewidth. 139-158
  
• Siu-Wing Cheng, Antoine Vigneron:
  Motorcycle Graphs and Straight Skeletons. 159-182
  
• Paz Carmi, Matthew J. Katz:
  Power Assignment in Radio Networks with Two Power Levels. 183-201
  
• Paolo D'Alberto, Alexandru Nicolau:
  R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks. 203-213
  

Volume 47, Number 3, April 2007

• Alessandro Panconesi:
  Foreword. 215
  
• Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
  Call Control in Rings. 217-238
  
• Susanne Albers, Rob van Stee:
  A Study of Integrated Document and Connection Caching in the WWW. 239-252
  
• Nir Avrahami, Yossi Azar:
  Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. 253-268
  
• Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
  An Algorithmic View on OVSF Code Assignment. 269-298
  
• Alexander Hall, Katharina Langkau, Martin Skutella:
  An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. 299-321
  
• Klaus Jansen, Guochuan Zhang:
  Maximizing the Total Profit of Rectangles Packed into a Rectangle. 323-342
  
• Joseph Naor, Hadas Shachnai, Tami Tamir:
  Real-Time Scheduling with a Budget. 343-364
  

Volume 47, Number 4, May 2007

• János Pach, Farhad Shahrokhi:
  Guest Editors' Foreword. 365
  
• Greg Aloupis, Prosenjit Bose, Pat Morin:
  Reconfiguring Triangulations with Edge Flips and Point Moves. 367-378
  
• Reid Andersen, Fan R. K. Chung, Linyuan Lu:
  No-Three-in-Line-in-3D. 379-397
  
• Reid Andersen, Fan R. K. Chung, Linyuan Lu:
  Drawing Power Law Graphs Using a Local/Global Decomposition. 397
  
• Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
  Convex Drawings of 3-Connected Plane Graphs. 399-420
  
• Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
  Random Geometric Graph Diameter in the Unit Ball. 421-438
  
• David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
  Confluent Layered Drawings. 439-452
  
• Hubert de Fraysseix, Patrice Ossona de Mendez:
  Representations by Contact and Intersection of Segments. 453-463
  
• Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
  Train Tracks and Confluent Drawings. 465-479
  
• Attila Pór, David R. Wood:
  No-Three-in-Line-in-3D. 481-488