Terrance A. Mankus

	2002
5		Glenn K. Manacher, Terrance A. Mankus: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks 39(2): 68-72 (2002)
	1997
4		Glenn K. Manacher, Terrance A. Mankus: Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. Int. J. Found. Comput. Sci. 8(4): 469- (1997)
	1996
3		Glenn K. Manacher, Terrance A. Mankus: Finding a Domatic Partition of an Interval Graph in Time O(n). SIAM J. Discrete Math. 9(2): 167-172 (1996)
	1992
2		Glenn K. Manacher, Terrance A. Mankus: Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. Inf. Process. Lett. 42(6): 293-294 (1992)
	1990
1		Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith: An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Inf. Process. Lett. 35(4): 205-211 (1990)

Coauthor Index

1	Glenn K. Manacher	[1] [2] [3] [4] [5]
2	Carol Joan Smith	[1]

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page