Glenn K. Manacher

University of Illinois Chicago — United States

Computer Science · Physical Sciences

10h-index549citations28works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(10), Algorithms and Data Compression(9), Computational Geometry and Mesh Generation(6), Complexity and Algorithms in Graphs(5), Natural Language Processing Techniques(3)

Publications28 total

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
Networks·2002· 8 cited
New optimum algorithms for unweighted and weighted interval, circular arc and circle graphs and their models
1999
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
International Journal of Foundations of Computer Science·1997· 2 cited
Finding a Domatic Partition of an Interval Graph in Time $O(n)$
SIAM Journal on Discrete Mathematics·1996· 7 cited
A Linear Algorithm for Finding Hamiltonian Circuits in circular-Arc Graphs
1994· 3 cited
NC2 Algorithms regarding Hamiltonian paths and circuits in interval graphs
Lecture notes in computer science·1994· 1 cited
An <i>O(n</i>log<i>n)</i> algorithm for finding minimal path cover in circular-arc graphs
1993· 6 cited
Incorporating negative-weight vertices in certain vertex-search graph algorithms
Information Processing Letters·1992· 8 cited
Efficient reduction for path problems on circular-arc graphs
BIT Numerical Mathematics·1991· 11 cited
An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals
Information Processing Letters·1990· 40 cited
Optimum combinations of sorting and merging
Journal of the ACM·1989· 11 citedOpen Access
Algorithmic Graph Theory (Alan Gibbons)
SIAM Review·1989· 2 cited
Finding a minimum independent dominating set in a permutation graph
Discrete Applied Mathematics·1988· 37 cited
Steady-paced-output and fractional-on-line algorithms on a ram
Information Processing Letters·1982· 3 cited
Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
Information Processing Letters·1979· 68 cited
The Ford-Johnson Sorting Algorithm Is Not Optimal
Journal of the ACM·1979· 28 citedOpen Access
Significant Improvements to the Hwang-Lin Merging Algorithm
Journal of the ACM·1979· 22 citedOpen Access
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
Allerton Conference on Communication, Control, and Computing·1979· 2 cited
An improved version of the Cocke-Younger-Kasami algorithm
Computer Languages·1978· 6 cited
Sorting on a Mesh- Connected Parallel Computer
1977
page 1 of 2Next →

Frequent Co-authors

Terrance A. Mankus(7), A. L. Zobrist(2), Y. Daniel Liang(2), C. Smith(1), Mikhail J. Atallah(1), Jorge Urrutia(1), Srinivasa R. Arikati(1), C. Pandu Rangan(1), Tu Bui(1), Thanh Mai(1), Yan Liang(1), Chongkye Rhee(1), Raymond Greenlaw(1), Stuart L. Graham(1)