Journal of Algorithms, Volume 43

Volume 43, Number 1, April 2002

• Wen-Lian Hsu:
  A Simple Test for the Consecutive Ones Property. 1-16
  
• Volker Heun, Ernst W. Mayr:
  Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. 17-50
  
• Volker Heun, Ernst W. Mayr:
  Efficient Dynamic Embeddings of Binary Trees into Hypercubes. 51-84
  
• Robert W. Irving, David Manlove:
  The Stable Roommates Problem with Ties. 85-105
  
• Hans L. Bodlaender, Dieter Kratsch:
  Kayles and Nimbers. 106-119
  
• Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic:
  The Dyadic Stream Merging Algorithm. 120-137
  
• Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti:
  Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. 138-152
  

Volume 43, Number 2, May 2002

• Kazuhisa Makino:
  A linear time algorithm for recognizing regular Boolean functions. 155-176
  
• Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
  Fast broadcasting and gossiping in radio networks. 177-189
  
• Hans L. Bodlaender, Fedor V. Fomin:
  Approximation of pathwidth of outerplanar graphs. 190-200
  
• Uriel Feige, Marek Karpinski, Michael Langberg:
  Improved approximation of Max-Cut on graphs of bounded degree. 201-219
  
• Richard Edwin Stearns, Harry B. Hunt III:
  Exploiting structure in quantified formulas. 220-263
  
• David Liben-Nowell:
  Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. 264-283