1. Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search

   • P. de la Torre
   • C. P. Kruskal

   OriginalPaper 01 January 2001 Pages: 275 - 298

2. An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs

   • D. Caucal
   • T. Knapik

   OriginalPaper 01 January 2001 Pages: 299 - 336

3. Computing the Optimal Bridge between Two Polygons

   • Sung Kwon Kim
   • Chan-Su Shin

   OriginalPaper 01 January 2001 Pages: 337 - 352

4. A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders

   • R. Becker
   • I. Lari
   • B. Simeone

   OriginalPaper 01 January 2001 Pages: 353 - 374

5. Special Factors and Uniqueness Conditions in Rational Trees

   • A. Carpi
   • A. de Luca
   • S. Varricchio

   OriginalPaper 01 January 2001 Pages: 375 - 395