Glenn K. Manacher - Citegraph

Author Info

Name	Affiliation	Papers
GLENN K. MANACHER	Department of Information Engineering and Computer Center, University of Illinois, Chicago, IL 60680, U.S.A.	17
Collaborators	Citations	PageRank
8	205	98.95
Referers	Referees	References
329	85	61

Search Limit

100329

Publications (17 rows)

Collaborators (8 rows)

Referers (100 rows)

Referees (85 rows)

Title	Citations	PageRank	Year
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone	6	0.70	2002
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications	0	0.34	1997
Finding a domatic partition of an interval graph in time O(n)	3	0.45	1996
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)	0	0.34	1994
An O(n log n) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.	3	0.39	1993
Incorporating negative-weight vertices in certain vertex-search graph algorithms	7	0.94	1992
Efficient reduction for path problems on circular-arc graphs	7	0.68	1991
Algorithmic Graph Theory (Alan Gibbons)	0	0.34	1989
Finding a minimum independent dominating set in a permutation graph	24	2.32	1988
Steady-paced-output and fractional-on-line algorithms on a ram	2	0.36	1982
The Ford-Johnson Sorting Algorithm Is Not Optimal	12	6.67	1979
Significant Improvements to the Hwang-Lin Merging Algorithm	9	6.70	1979
Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation	35	14.30	1979
An improved version of the Cocke-Younger-Kasami algorithm	1	2.36	1978
An application of pattern matching to a problem in geometrical complexity	23	16.02	1976
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String	61	14.72	1975
On the feasibility of implementing a large relational data base with optimal performance on a minicomputer	12	31.33	1975

1