Glenn K. Manacher

Publication Activity (10 Years)

Years Active: 1967-2002
Publications (10 Years): 0

Publications

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) (2002)
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) (1997)
Glenn K. Manacher, Terrance A. Mankus
Finding a Domatic Partition of an Interval Graph in Time O(n). SIAM J. Discret. Math. 9 (2) (1996)
Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing (1994)
Y. Daniel Liang, Glenn K. Manacher
Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science (1993)
Glenn K. Manacher, Terrance A. Mankus
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. Inf. Process. Lett. 42 (6) (1992)
Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher
Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31 (2) (1991)
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) (1990)
Glenn K. Manacher
Algorithmic Graph Theory (Alan Gibbons). SIAM Rev. 31 (1) (1989)
Glenn K. Manacher, Tien Dai Bui, Mai Thanh
Optimum combinations of sorting and merging. J. ACM 36 (2) (1989)
Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia
Finding a minimum independent dominating set in a permutation graph. Discret. Appl. Math. 21 (3) (1988)
Glenn K. Manacher
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. Inf. Process. Lett. 15 (2) (1982)
Glenn K. Manacher
The Ford-Johnson Sorting Algorithm Is Not Optimal. J. ACM 26 (3) (1979)
Glenn K. Manacher
Significant Improvements to the Hwang-Lin Merging Algorithm. J. ACM 26 (3) (1979)
Glenn K. Manacher, Albert L. Zobrist
Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. Inf. Process. Lett. 9 (1) (1979)
Glenn K. Manacher
An Improved Version of the Cocke-Younger-Kasami Algorithm. Comput. Lang. 3 (2) (1978)
Glenn K. Manacher
An Application of Pattern Matching to a Problem in Geometrical Complexity. Inf. Process. Lett. 5 (1) (1976)
Glenn K. Manacher
A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial Palindrome of a String. J. ACM 22 (3) (1975)
Glenn K. Manacher
On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer. VLDB (1975)
Glenn K. Manacher
A content-evaluating mode of computer-aided instruction. Symposium on Interactive Systems for Experimental Applied Mathematics (1967)
Glenn K. Manacher
Production and Stabilization of Real-Time Task Schedules. J. ACM 14 (3) (1967)