External Links

    Journal: Algorithmica

    Volume 8, Issue 3

    177 -- 194Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs
    195 -- 208Amy J. Briggs. An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty
    209 -- 231Mikhail J. Atallah, Jyh-Jong Tsay. On the Parallel-Decomposability of Geometric Problems
    233 -- 249Chung-Kuan Cheng, T. C. Hu. Maximum Concurrent Flows and Minimum Cuts
    251 -- 256Christos Levcopoulos, Andrzej Lingas. There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees
    runs on