Glenn K. Manacher

According to our database, Glenn K. Manacher authored at least 21 papers between 1967 and 2002.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2002

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

1997

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

1996

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

Glenn K. Manacher, Terrance A. Mankus

SIAM J. Discret. Math., 1996

1994

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

Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher

Proceedings of the Parallel and Distributed Computing, 1994

1993

An <i>O(n</i>log<i>n)</i> Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.

Y. Daniel Liang, Glenn K. Manacher

Proceedings of the ACM 21th Conference on Computer Science, 1993

1992

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

Glenn K. Manacher, Terrance A. Mankus

Inf. Process. Lett., 1992

1991

Efficient Reduction for Path Problems on Circular-Arc Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher

BIT, 1991

1990

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

1989

Algorithmic Graph Theory (Alan Gibbons).

Glenn K. Manacher

SIAM Rev., 1989

Optimum combinations of sorting and merging.

Glenn K. Manacher, Tien Dai Bui, Mai Thanh

J. ACM, 1989

1988

Finding a minimum independent dominating set in a permutation graph.

Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia

Discret. Appl. Math., 1988

1982

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

Glenn K. Manacher

Inf. Process. Lett., 1982

1979

The Ford-Johnson Sorting Algorithm Is Not Optimal.

Glenn K. Manacher

J. ACM, 1979

Significant Improvements to the Hwang-Lin Merging Algorithm.

Glenn K. Manacher

J. ACM, 1979

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

Glenn K. Manacher, Albert L. Zobrist

Inf. Process. Lett., 1979

1978

An Improved Version of the Cocke-Younger-Kasami Algorithm.

Glenn K. Manacher

Comput. Lang., 1978

1976

An Application of Pattern Matching to a Problem in Geometrical Complexity.

Glenn K. Manacher

Inf. Process. Lett., 1976

1975

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

Glenn K. Manacher

J. ACM, 1975

On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer.

Glenn K. Manacher

Proceedings of the International Conference on Very Large Data Bases, 1975

1967

Production and Stabilization of Real-Time Task Schedules.

Glenn K. Manacher

J. ACM, 1967

A content-evaluating mode of computer-aided instruction.

Glenn K. Manacher

Proceedings of the ACM Symposium on Interactive Systems for Experimental Applied Mathematics, 1967