An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. - Glenn K. Manacher; Terrance A. Mankus; Carol Joan Smith (Inf. Process. Lett., 1990)

Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. - Glenn K. Manacher; Terrance A. Mankus (Inf. Process. Lett., 1992)

Finding a Domatic Partition of an Interval Graph in Time O(n). - Glenn K. Manacher; Terrance A. Mankus (SIAM J. Discret. Math., 1996)

Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. - Glenn K. Manacher; Terrance A. Mankus (Int. J. Found. Comput. Sci., 1997)

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. - Glenn K. Manacher; Terrance A. Mankus (Networks, 2002)