Glenn K. Manacher

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