Algorithmica, Volume 54, 2009

Volume 54, Number 1, May 2009

• Radu Mihaescu, Dan Levy, Lior Pachter:
  Why Neighbor-Joining Works. 1-24
  
• Giuseppe Di Battista, Fabrizio Frati:
  Small Area Drawings of Outerplanar Graphs. 25-53
  
• Rajiv Gandhi, Julián Mestre:
  Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. 54-71
  
• Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
  Casting an Object with a Core. 72-88
  
• Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
  Resource Allocation in Bounded Degree Trees. 89-106
  
• Hsiao-Fei Liu, Kun-Mao Chao:
  On Locating Disjoint Segments with Maximum Sum of Densities. 107-117
  
• Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik:
  Many-to-Many Communication in Radio Networks. 118-139
  

Volume 54, Number 2, June 2009

• Tetsuo Asano:
  Editorial. 141
  
• Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
  Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. 142-180
  
• Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov:
  On Two Techniques of Combining Branching and Treewidth. 181-207
  
• Saswata Shannigrahi, Sudebkumar Prasant Pal:
  Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. 208-225
  
• Ferdinando Cicalese, Fredrik Manne, Qin Xin:
  Faster Deterministic Communication in Radio Networks. 226-242
  
• Frank Neumann, Carsten Witt:
  Runtime Analysis of a Simple Ant Colony Optimization Algorithm. 243-255
  
• Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
  Negation-Limited Complexity of Parity and Inverters. 256-267
  

Volume 54, Number 3, July 2009

• Sashka Davis, Russell Impagliazzo:
  Models of Greedy Algorithms for Graph Problems. 269-317
  
• Boris Aronov, Paz Carmi, Matthew J. Katz:
  Minimum-Cost Load-Balancing Partitions. 318-336
  
• Lars Arge, Vasilis Samoladas, Ke Yi:
  Optimal External Memory Planar Point Enclosure. 337-352
  
• Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu:
  Smallest Bipartite Bridge-Connectivity Augmentation. 353-378
  
• Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson:
  Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. 379-399
  
• Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
  A Note on Multiflows and Treewidth. 400-412
  
• Anil Maheshwari, Norbert Zeh:
  I/O-Efficient Algorithms for Graphs of Bounded Treewidth. 413-469
  

Volume 54, Number 4, August 2009

• Guohui Lin, Zhipeng Cai:
  Editorial, COCOON 2007 Special Issue. 471
  
• Jianer Chen, Songjian Lu:
  Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. 472-489
  
• Hamid Zarrabi-Zadeh, Timothy M. Chan:
  An Improved Algorithm for Online Unit Clustering. 490-500
  
• Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang:
  Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. 501-529
  
• Yunlong Liu, Jianer Chen, Jianxin Wang:
  On Counting 3-D Matchings of Size k. 530-543
  
• Noga Alon, Shai Gutner:
  Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. 544-556
  
• Yong Zhang, Francis Y. L. Chin, Hong Zhu:
  A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. 557-567