Search the dblp DataBase
Glenn K. Manacher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Glenn K. Manacher
On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer. [Citation Graph (4, 9)][DBLP]
VLDB, 1975, pp:175-201 [Conf] - Y. Daniel Liang, Glenn K. Manacher
An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
ACM Conference on Computer Science, 1993, pp:390-397 [Conf] - Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
Canada-France Conference on Parallel and Distributed Computing, 1994, pp:45-57 [Conf] - Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher
Efficient Reduction for Path Problems on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:2, pp:182-193 [Journal] - Glenn K. Manacher
An Improved Version of the Cocke-Younger-Kasami Algorithm. [Citation Graph (0, 0)][DBLP]
Comput. Lang., 1978, v:3, n:2, pp:127-133 [Journal] - Glenn K. Manacher, Terrance A. Mankus
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1997, v:8, n:4, pp:469-0 [Journal] - Glenn K. Manacher
An Application of Pattern Matching to a Problem in Geometrical Complexity. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1976, v:5, n:1, pp:6-7 [Journal] - Glenn K. Manacher
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1982, v:15, n:2, pp:47-52 [Journal] - Glenn K. Manacher, Terrance A. Mankus
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:42, n:6, pp:293-294 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1990, v:35, n:4, pp:205-211 [Journal] - Glenn K. Manacher, Albert L. Zobrist
Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1979, v:9, n:1, pp:31-34 [Journal] - Glenn K. Manacher
Production and Stabilization of Real-Time Task Schedules. [Citation Graph (0, 0)][DBLP]
J. ACM, 1967, v:14, n:3, pp:439-465 [Journal] - Glenn K. Manacher
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:3, pp:346-351 [Journal] - Glenn K. Manacher
Significant Improvements to the Hwang-Lin Merging Algorithm. [Citation Graph (0, 0)][DBLP]
J. ACM, 1979, v:26, n:3, pp:434-440 [Journal] - Glenn K. Manacher
The Ford-Johnson Sorting Algorithm Is Not Optimal. [Citation Graph (0, 0)][DBLP]
J. ACM, 1979, v:26, n:3, pp:441-456 [Journal] - Glenn K. Manacher, T. D. Bui, T. Mai
Optimum combinations of sorting and merging. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:2, pp:290-334 [Journal] - Glenn K. Manacher, Terrance A. Mankus
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. [Citation Graph (0, 0)][DBLP]
Networks, 2002, v:39, n:2, pp:68-72 [Journal]
Finding a minimum independent dominating set in a permutation graph. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002