- CSB - MetaPress - Google - Bing - Yahoo
 | 2002 | |
|---|---|---|
| j16 |      | 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 | ||
| j15 | | 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) |
| 1996 | ||
| j14 | | Glenn K. Manacher, Terrance A. Mankus: Finding a Domatic Partition of an Interval Graph in Time O(n). SIAM J. Discrete Math. 9(2): 167-172 (1996) |
| 1994 | ||
| c3 | | 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 | ||
| c2 | | 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 | ||
| j13 | | 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 | ||
| j12 |  | 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 | ||
| j11 | | 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 | ||
| j10 | | |
| 1988 | ||
| j9 | | 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 | ||
| j8 | | Glenn K. Manacher: Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. Inf. Process. Lett. 15(2): 47-52 (1982) |
| 1979 | ||
| j7 | | 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) |
| j6 | | Glenn K. Manacher: Significant Improvements to the Hwang-Lin Merging Algorithm. J. ACM 26(3): 434-440 (1979) |
| j5 | | |
| 1978 | ||
| j4 | | Glenn K. Manacher: An Improved Version of the Cocke-Younger-Kasami Algorithm. Comput. Lang. 3(2): 127-133 (1978) |
| 1976 | ||
| j3 | | Glenn K. Manacher: An Application of Pattern Matching to a Problem in Geometrical Complexity. Inf. Process. Lett. 5(1): 6-7 (1976) |
| 1975 | ||
| j2 | | 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) |
| c1 | | Glenn K. Manacher: On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer. VLDB 1975: 175-201 |
| 1967 | ||
| j1 | | Glenn K. Manacher: Production and Stabilization of Real-Time Task Schedules. J. ACM 14(3): 439-465 (1967) |
| 1 | Srinivasa Rao Arikati | |
| 2 | Mikhail J. Atallah | |
| 3 | Tien D. Bui (Tien Dai Bui, T. D. Bui) | |
| 4 | Raymond Greenlaw | |
| 5 | Y. Daniel Liang | |
| 6 | T. Mai | |
| 7 | Terrance A. Mankus | |
| 8 | C. Pandu Rangan (Chandrasekaran Pandu Rangan) | |
| 9 | Carol Joan Smith | |
| 10 | Jorge Urrutia | |
| 11 | Albert L. Zobrist |
Colors in the list of coauthors
Last update Sun May 19 05:14:54 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page