Schedulers for larger classes of pinwheel instances M. Y. ChanFrancis Chin OriginalPaper Pages: 425 - 462
An 11/6-approximation algorithm for the network steiner problem A. Z. Zelikovsky OriginalPaper Pages: 463 - 470
Selecting distances in the plane Pankaj K. AgarwalBoris AronovSubhash Suri OriginalPaper Pages: 495 - 514
An addendum to parallel methods for visibility and shortest-path problems in simple polygons Michael T. GoodrichSteven B. ShauckSumanta Guha OriginalPaper Pages: 515 - 516
