![]() | ![]() |
2002 | ||
---|---|---|
4 | EE | Glenn K. Manacher, Terrance A. Mankus: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks 39(2): 68-72 (2002) |
1997 | ||
3 | Glenn K. Manacher, Terrance A. Mankus: Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. Int. J. Found. Comput. Sci. 8(4): 469- (1997) | |
1992 | ||
2 | Glenn K. Manacher, Terrance A. Mankus: Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. Inf. Process. Lett. 42(6): 293-294 (1992) | |
1990 | ||
1 | Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith: An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Inf. Process. Lett. 35(4): 205-211 (1990) |
1 | Glenn K. Manacher | [1] [2] [3] [4] |
2 | Carol Joan Smith | [1] |