Journal of Algorithms, Volume 50

Volume 50, Number 1, January 2004

• Sorina Dumitrescu, Xiaolin Wu:
  Algorithms for optimal multi-resolution quantization. 1-22
  
• Markus Bläser:
  An 8/13-approximation algorithm for the asymmetric maximum TSP. 23-48
  
• Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
  Multiway cuts in node weighted graphs. 49-61
  
• Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
  Rectangular drawings of planar graphs. 62-78
  
• Lenore Cowen, Christopher G. Wagner:
  Compact roundtrip routing in directed networks. 79-95
  
• Yijie Han:
  Deterministic sorting in O(nloglogn) time and linear space. 96-105
  
• Weijia Jia, Chuanlin Zhang, Jianer Chen:
  An efficient parameterized algorithm for m-set packing. 106-117
  
• Noga Alon, Gregory Gutin, Michael Krivelevich:
  Algorithms with large domination ratio. 118-131
  

Volume 50, Number 2, February 2004

• David B. Shmoys:
  Foreword. 133
  
• Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
  The complexity of finding small triangulations of convex 3-polytopes. 134-167
  
• William S. Evans, David G. Kirkpatrick:
  Restructuring ordered binary trees. 168-193
  
• Michel X. Goemans, Martin Skutella:
  Cooperative facility location games. 194-214
  
• László Babai, Igor Pak:
  Strong bias of group generators: an obstacle to the "product replacement algorithm". 215-231
  
• Matthew Andrews:
  Instability of FIFO in session-oriented networks. 232-245
  
• Sundar Vishwanathan:
  An approximation algorithm for finding long paths in Hamiltonian graphs. 246-256
  
• Amihood Amir, Moshe Lewenstein, Ely Porat:
  Faster algorithms for string matching with k mismatches. 257-275
  

Last update Sat May 25 20:37:45 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page