Journal of Algorithms, Volume 42

Volume 42, Number 1, January 2002

• Ulrich Meyer, Jop F. Sibeyn:
  Oblivious Gossiping on Tori. 1-19
  
• Reuven Bar-Yehuda, Dror Rawitz:
  Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. 20-40
  
• Matti Nykänen, Esko Ukkonen:
  The Exact Path Length Problem. 41-53
  
• Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
  Locating Sources to Meet Flow Demands in Undirected Networks. 54-68
  
• Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
  On Graph Powers for Leaf-Labeled Trees. 69-108
  
• Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
  The 2-Center Problem with Obstacles. 109-134
  
• Pangfeng Liu:
  Broadcast Scheduling Optimization for Heterogeneous Cluster Systems. 135-152
  
• C. R. Subramanian, C. E. Veni Madhavan:
  General Partitioning on Random Graphs. 153-172
  
• Takao Asano, David P. Williamson:
  Improved Approximation Algorithms for MAX SAT. 173-202
  

Volume 42, Number 2, February 2002

• Mikkel Thorup:
  Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. 205-230
  
• Brenda S. Baker, Raffaele Giancarlo:
  Sparse Dynamic Programming for Longest Common Subsequence from Fragments. 231-254
  
• Mirela Damian-Iordache, Sriram V. Pemmaraju:
  A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. 255-276
  
• Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
  Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. 277-303
  
• Hatem M. Bahig, Ken Nakamula:
  Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True. 304-316
  
• Nicholas Pippenger:
  Analysis of Carry Propagation in Addition: An Elementary Approach. 317-333
  
• Magnús M. Halldórsson, Guy Kortsarz:
  Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. 334-366