External Links

    Journal: Algorithmica

    Volume 17, Issue 4

    331 -- 356Piotr Berman, Bhaskar DasGupta. Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
    357 -- 379Elon Rimon. Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For?
    380 -- 398Marco Pellegrini. On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching
    399 -- 415Yijie Han, Victor Y. Pan, John H. Reif. Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs
    416 -- 425Sergio De Agostino, Rossella Petreschi, Andrea Sterbini. An O(n³) Recognition Algorithm for Bithreshold Graphs
    426 -- 448Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction
    449 -- 462Noga Alon, Aravind Srinivasan. Improved Parallel Approximation of a Class of Integer Programming Problems
    runs on