default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGlenn K. Manacher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j17]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
- [j16]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
- [j15]Glenn K. Manacher, Terrance A. Mankus:
Finding a Domatic Partition of an Interval Graph in Time O(n). SIAM J. Discret. Math. 9(2): 167-172 (1996) - 1992
- [j14]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
- [j13]Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher:
Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 181-193 (1991) - 1990
- [j12]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
- [j11]Glenn K. Manacher, Tien Dai Bui, Mai Thanh:
Optimum combinations of sorting and merging. J. ACM 36(2): 290-334 (1989) - [j10]Glenn K. Manacher:
Algorithmic Graph Theory (Alan Gibbons). SIAM Rev. 31(1): 145-147 (1989) - 1988
- [j9]Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia:
Finding a minimum independent dominating set in a permutation graph. Discret. Appl. Math. 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]Glenn K. Manacher:
The Ford-Johnson Sorting Algorithm Is Not Optimal. J. ACM 26(3): 441-456 (1979) - 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) - 1967
- [j1]Glenn K. Manacher:
Production and Stabilization of Real-Time Task Schedules. J. ACM 14(3): 439-465 (1967)
Conference and Workshop Papers
- 1994
- [c4]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
- [c3]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 - 1975
- [c2]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
- [c1]Glenn K. Manacher:
A content-evaluating mode of computer-aided instruction. Symposium on Interactive Systems for Experimental Applied Mathematics 1967: 286-293
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
