 | 2002 |
|---|
| 18 |       | 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): 68-72 (2002) |
| 1997 |
|---|
| 17 |  | 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): 469- (1997) |
| 1994 |
|---|
| 16 | | 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: 45-57 |
| 1993 |
|---|
| 15 | | Y. Daniel Liang,
Glenn K. Manacher:
An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.
ACM Conference on Computer Science 1993: 390-397 |
| 1992 |
|---|
| 14 | | Glenn K. Manacher,
Terrance A. Mankus:
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms.
Inf. Process. Lett. 42(6): 293-294 (1992) |
| 1991 |
|---|
| 13 | | Srinivasa Rao Arikati,
C. Pandu Rangan,
Glenn K. Manacher:
Efficient Reduction for Path Problems on Circular-Arc Graphs.
BIT 31(2): 182-193 (1991) |
| 1990 |
|---|
| 12 | | 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): 205-211 (1990) |
| 1989 |
|---|
| 11 | | Glenn K. Manacher,
T. D. Bui,
T. Mai:
Optimum combinations of sorting and merging.
J. ACM 36(2): 290-334 (1989) |
| 1988 |
|---|
| 10 | | Mikhail J. Atallah,
Glenn K. Manacher,
Jorge Urrutia:
Finding a minimum independent dominating set in a permutation graph.
Discrete Applied Mathematics 21(3): 177-183 (1988) |
| 1982 |
|---|
| 9 | | Glenn K. Manacher:
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM.
Inf. Process. Lett. 15(2): 47-52 (1982) |
| 1979 |
|---|
| 8 | | 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): 31-34 (1979) |
| 7 | | Glenn K. Manacher:
Significant Improvements to the Hwang-Lin Merging Algorithm.
J. ACM 26(3): 434-440 (1979) |
| 6 | | Glenn K. Manacher:
The Ford-Johnson Sorting Algorithm Is Not Optimal.
J. ACM 26(3): 441-456 (1979) |
| 1978 |
|---|
| 5 | | Glenn K. Manacher:
An Improved Version of the Cocke-Younger-Kasami Algorithm.
Comput. Lang. 3(2): 127-133 (1978) |
| 1976 |
|---|
| 4 | | Glenn K. Manacher:
An Application of Pattern Matching to a Problem in Geometrical Complexity.
Inf. Process. Lett. 5(1): 6-7 (1976) |
| 1975 |
|---|
| 3 | | Glenn K. Manacher:
On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer.
VLDB 1975: 175-201 |
| 2 | | Glenn K. Manacher:
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String.
J. ACM 22(3): 346-351 (1975) |
| 1967 |
|---|
| 1 | | Glenn K. Manacher:
Production and Stabilization of Real-Time Task Schedules.
J. ACM 14(3): 439-465 (1967) |
