Algorithmica, Volume 36, 2003

Volume 36, Number 1, February 2003

• Pascal Ferraro, Christophe Godin:
  An Edit Distance between Quotiented Trees. 1-39
  
• Louay Bazzi, Sanjoy K. Mitter:
  The Solution of Linear Probabilistic Recurrence Relations. 41-57
  
• Matthew J. Katz, Frank Nielsen, Michael Segal:
  Maintenance of a Piercing Set for Intervals with Applications. 59-73
  
• Holger Bast, Kurt Mehlhorn, Guido Schäfer:
  A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. 75-88
  
• Xiaoming Sun:
  A 3-Party Simultaneous Protocol for SUM-INDEX. 89-111
  
• Ying Xu:
  An O(n^1.5) Deterministic Gossiping Algorithm for Radio Networks. 93-96
  

Volume 36, Number 2, April 2003

• Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
  Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. 97-122
  
• Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
  Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. 123-152
  
• Seok-Hee Hong, Peter Eades:
  Drawing Trees Symmetrically in Three Dimensions. 153-178
  
• Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky:
  A New Approximation Algorithm for Finding Heavy Planar Subgraphs. 179-205
  

Volume 36, Number 3, May 2003

• Anna R. Karlin, Claire Kenyon, Dana Randall:
  Dynamic TCP Acknowledgment and Other Stories about e/(e-1). 209-224
  
• Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
  Competitive On-Line Switching Policies. 225-247
  
• Avrim Blum, Shuchi Chawla, Adam Kalai:
  Static Optimality and Dynamic Search-Optimality in Lists and Trees. 249-260
  
• Steven S. Seiden, Rob van Stee:
  New Bounds for Multidimensional Packing. 261-293
  
• Amitai Armon, Yossi Azar, Leah Epstein:
  Temporary Tasks Assignment Resolved. 295-314
  
• Jeff Edmonds, Kirk Pruhs:
  Multicast Pull Scheduling: When Fairness Is Fine. 315-330
  

Volume 36, Number 4, May 2003

• Satoru Iwata:
  Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. 331-341
  
• Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
  Escaping a Grid by Edge-Disjoint Paths. 343-359
  
• Anna Galluccio, Guido Proietti:
  Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. 361-374
  
• Hans L. Bodlaender, Udi Rotics:
  Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. 375-408