Complexities of efficient solutions of rectilinear polygon cover problems P. BermanB. DasGupta OriginalPaper Pages: 331 - 356
Construction of C-space roadmaps from local sensory data. What should the sensors look for? E. Rimon OriginalPaper Pages: 357 - 379
On counting pairs of intersecting segments and off-line triangle range searching M. Pellegrini OriginalPaper Pages: 380 - 398
Efficient parallel algorithms for computing all pair shortest paths in directed graphs Yijie HanV. Y. PanJ. H. Reif OriginalPaper Pages: 399 - 415
AnO(n 3) recognition algorithm for bithreshold graphs S. De AgostinoR. PetreschiA. Sterbini OriginalPaper Pages: 416 - 425
New algorithms for minimizing the longest wire length during circuit compaction S. E. HambruschHung-Yi Tu OriginalPaper Pages: 426 - 448
Improved parallel approximation of a class of integer programming problems N. AlonA. Srinivasan OriginalPaper Pages: 449 - 462