The following pages link to Glenn K. Manacher (Q802883):
Displayed 16 items.
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- Steady-paced-output and fractional-on-line algorithms on a RAM (Q1170881) (← links)
- Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) (← links)
- (Q1234595) (redirect page) (← links)
- An application of pattern matching to a problem in geometrical complexity (Q1234596) (← links)
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860) (← links)
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String (Q4061953) (← links)
- An improved version of the Cocke-Younger-Kasami algorithm (Q4155838) (← links)
- Significant Improvements to the Hwang-Lin Merging Algorithm (Q4188747) (← links)
- The Ford-Johnson Sorting Algorithm Is Not Optimal (Q4190150) (← links)
- Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications (Q4385200) (← links)
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611) (← links)
- Finding a Domatic Partition of an Interval Graph in Time $O(n)$ (Q4881283) (← links)
- (Q5183087) (← links)