Algorithmica(15)
* Constrained Edit Distance between Unordered Labeled Trees, A
Algorithms(1)
* Parallel Algorithm For Constructing Minimum Spanning Trees, A
Algorithms(2)
* Linear Algorithm for Computing the Visibility Polygon from a Point, A
* O(N) Algorithm to Find a Near-Optimum Partition of a Convex Polygon, An
Algorithms(4)
* Efficient Algorithms for Computing the Maximum Distance
* Finding the Convex Hull of a Simple Polygon
Algorithms(5)
* O(N Log N) Algorithm For Finding All Repetitions In A String, An
Algorithms(7)
* Bipartite Graph Matching for Points on a Line or a Circle