Glenn K. Manacher

发表

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

Glenn K. Manacher, Terrance A. Mankus, 2002, Networks.

Finding a minimum independent dominating set in a permutation graph

Mikhail J. Atallah, Jorge Urrutia, Glenn K. Manacher, 1988, Discret. Appl. Math..

An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs

Y. Daniel Liang, Glenn K. Manacher, 1993, CSC '93.

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, 1990, Inf. Process. Lett..

Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation

Glenn K. Manacher, Albert L. Zobrist, A. Zobrist, 1979, Inf. Process. Lett..

Efficient reduction for path problems on circular-arc graphs

C. Pandu Rangan, Srinivasa Rao Arikati, Glenn K. Manacher, 1991, BIT Comput. Sci. Sect..

An Application of Pattern Matching to a Problem in Geometrical Complexity

Glenn K. Manacher, G. Manacher, 1976, Inf. Process. Lett..

Significant Improvements to the Hwang-Lin Merging Algorithm

Glenn K. Manacher, G. Manacher, 1979, JACM.

Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications

Glenn K. Manacher, Terrance A. Mankus, 1997, Int. J. Found. Comput. Sci..

An Improved Version of the Cocke-Younger-Kasami Algorithm

Glenn K. Manacher, G. Manacher, 1978, Comput. Lang..

Algorithmic Graph Theory (Alan Gibbons)

Glenn K. Manacher, 1989, SIAM Rev..

Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms

Glenn K. Manacher, Terrance A. Mankus, G. Manacher, 1992, Inf. Process. Lett..

On the feasibility of implementing a large relational data base with optimal performance on a minicomputer

Glenn K. Manacher, 1975, VLDB '75.

A benchmark calculation for retrieval by confluence of binary attributes in a random-access computer

Glenn K. Manacher, 1969 .

Finding a Domatic Partition of an Interval Graph in Time O(n)

Glenn K. Manacher, Terrance A. Mankus, 1996, SIAM J. Discret. Math..

The Ford-Johnson Sorting Algorithm Is Not Optimal

Glenn K. Manacher, G. Manacher, 1979, JACM.

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)

Raymond Greenlaw, Y. Daniel Liang, Glenn K. Manacher, 1994, Canada-France Conference on Parallel and Distributed Computing.

Production and Stabilization of Real-Time Task Schedules

Glenn K. Manacher, G. Manacher, 1967, JACM.

ESPL: a low-level language in the style of Algol

Glenn K. Manacher, 1971 .

A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

Glenn K. Manacher, G. Manacher, 1975, JACM.

Optimum combinations of sorting and merging

Tien D. Bui, T. D. Bui, Glenn K. Manacher, 1989, JACM.

Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM

Glenn K. Manacher, G. Manacher, 1982, Inf. Process. Lett..