1. An efficient algorithm for finding the CSG representation of a simple polygon

   • David Dobkin
   • Leonidas Guibas
   • Jack Snoeyink

   OriginalPaper Pages: 1 - 23

2. Optimal algorithms for dissemination of information in some interconnection networks

   • Juraj Hromkovič
   • Claus -Dieter Jeschke
   • Burkhard Monien

   OriginalPaper Pages: 24 - 40

3. Planning a time-minimal motion among moving obstacles

   • Kikuo Fujimura
   • Hanan Samet

   OriginalPaper Pages: 41 - 63

4. Extracting maximal information about sets of minimum cuts

   • Dan Gusfield
   • Dalit Naor

   OriginalPaper Pages: 64 - 89