Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Glenn K. Manacher
Observed names:
G. K. Manacher,
G.K. MANACHER,
Glenn Manacher
Institution:
University of Illinois Chicago
Observed institutions:
University of Illinois Urbana-Champaign,
Indian Institute of Technology Madras,
University of Illinois Chicago,
University of Chicago
OpenAlex ID:
A5031865197
Works
28
Awards
1
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
1975
·
Glenn Manacher
·
Journal of the ACM
·
178
PDF
Production and Stabilization of Real-Time Task Schedules
1967
·
G. K. Manacher
·
Journal of the ACM
·
108
PDF
Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
1979
·
Glenn K. Manacher
, Albert L. Zobrist
·
Information Processing Letters
·
75
An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals
1990
·
Glenn K. Manacher
, Terrance A. Mankus
, et al.
·
Information Processing Letters
·
42
Finding a minimum independent dominating set in a permutation graph
1988
·
Mikhail J. Atallah
, Glenn K. Manacher
, et al.
·
Discrete Applied Mathematics
·
39
An application of pattern matching to a problem in geometrical complexity
1976
·
Glenn Manacher
·
Information Processing Letters
·
37
The Ford-Johnson Sorting Algorithm Is Not Optimal
1979
·
Glenn K. Manacher
·
Journal of the ACM
·
32
PDF
Significant Improvements to the Hwang-Lin Merging Algorithm
1979
·
Glenn K. Manacher
·
Journal of the ACM
·
25
PDF
Efficient reduction for path problems on circular-arc graphs
1991
·
Srinivasa R. Arikati
, C. Pandu Rangan
, et al.
·
BIT Numerical Mathematics
·
13
Optimum combinations of sorting and merging
1989
·
G. K. Manacher
, T. D. Bui
, et al.
·
Journal of the ACM
·
13
PDF
On the feasibility of implementing a large relational data base with optimal performance on a minicomputer
1975
·
Glenn K. Manacher
·
Proceedings of the VLDB Endowment
·
11
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
2002
·
Glenn K. Manacher
, Terrance A. Mankus
·
Networks
·
8
Incorporating negative-weight vertices in certain vertex-search graph algorithms
1992
·
Glenn K. Manacher
, Terrance A. Mankus
·
Information Processing Letters
·
8
An improved version of the Cocke-Younger-Kasami algorithm
1978
·
Glenn K. Manacher
·
Computer Languages
·
8
Finding a Domatic Partition of an Interval Graph in Time $O(n)$
1996
·
Glenn K. Manacher
, Terrance A. Mankus
·
SIAM Journal on Discrete Mathematics
·
7
An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs
1993
·
Y. Daniel Liang
, G. K. Manacher
·
ACM Annual Conference on Computer Science (CSC)
·
6
A Linear Algorithm for Finding Hamiltonian Circuits in circular-Arc Graphs
1994
·
Yan Liang
, Glenn K. Manacher
, et al.
·
4
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
1997
·
Glenn K. Manacher
, Terrance A. Mankus
·
International Journal of Foundations of Computer Science
·
3
Steady-paced-output and fractional-on-line algorithms on a ram
1982
·
Glenn K. Manacher
·
Information Processing Letters
·
3
Algorithmic Graph Theory (Alan Gibbons)
1989
·
Glenn K. Manacher
·
SIAM Review
·
2
A fast, space-efficient average-case algorithm for the 'Greedy' Triangulation of a point set, and a proof that the Greedy Triangulation is not approximately optimal
1979
·
Glenn K. Manacher
, A. L. Zobrist
·
Allerton Conference on Communication, Control, and Computing
·
2
A Content-Evaluating Mode of Computer-Aided Instruction
1968
·
G.K. MANACHER
·
Elsevier eBooks
·
2
A content-evaluating mode of computer-aided instruction
1967
·
G. K. Manacher
·
ACM Symposium on Interactive Systems for Experimental Applied Mathematics
·
2
PDF
New optimum algorithms for unweighted and weighted interval, circular arc and circle graphs and their models
1999
·
Glenn K. Manacher
, Terrance A. Mankus
·
1
NC2 Algorithms regarding Hamiltonian paths and circuits in interval graphs: Extended abstract
1994
·
Y. Daniel Liang
, Raymond Greenlaw
, et al.
·
Lecture notes in computer science
Show more works
View as search
Works count:
28
Citation count:
629
H-index:
11
I10-index:
11
Year
Topic
Type