External Links

    Journal: J. Algorithms

    Volume 20, Issue 3

    445 -- 458Shietung Peng, Win-Tsung Lo. Efficient Algorithms for Finding a Core of a Tree with a Specified Length
    459 -- 478Danny Z. Chen. Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
    479 -- 511William R. Burley. Traversing Layered Graphs Using the Work Function Algorithm
    512 -- 525Ashok Subramanian. An Explanation of Splaying
    526 -- 544Kazuo Iwama, Chuzo Iwamoto. alpha-Connectivity: A Gradually Nonparallel Graph Problem
    545 -- 580Jirí Matousek. Derandomization in Computational Geometry
    581 -- 601Pankaj K. Agarwal, Sandeep Sen. Selection in Monotone Matrices and Computing ::::k::::th Nearest Neighbors
    602 -- 612Mikkel Thorup. Efficient Preprocessing of Simple Binay Pattern Forests
    613 -- 631Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi. Routing Problems on the Mesh of Buses
    runs on