Glenn K. Manacher

Available identifiers

Publication	Date of Publication	Type
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone	2002-07-01	Paper
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications	1998-05-25	Paper
Finding a Domatic Partition of an Interval Graph in Time $O(n)$	1996-09-22	Paper
Incorporating negative-weight vertices in certain vertex-search graph algorithms	1993-01-16	Paper
Efficient reduction for path problems on circular-arc graphs	1991-01-01	Paper
An optimum $\Theta$ (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals	1990-01-01	Paper
Finding a minimum independent dominating set in a permutation graph	1988-01-01	Paper
Steady-paced-output and fractional-on-line algorithms on a RAM	1982-01-01	Paper
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation	1979-01-01	Paper
The Ford-Johnson Sorting Algorithm Is Not Optimal	1979-01-01	Paper
Significant Improvements to the Hwang-Lin Merging Algorithm	1979-01-01	Paper
An improved version of the Cocke-Younger-Kasami algorithm	1978-01-01	Paper
An application of pattern matching to a problem in geometrical complexity	1976-01-01	Paper
A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5183087	1971-01-01	Paper

This page was built for person: Glenn K. Manacher