J. Mark Keil

	2008
36		J. Mark Keil, Tzvetalin S. Vassilev: The relative neighbourhood graph is a part of every 30degree-triangulation. Inf. Process. Lett. 109(2): 93-97 (2008)
	2007
35		Chris Worman, J. Mark Keil: Polygon Decomposition and the Orthogonal Art Gallery Problem. Int. J. Comput. Geometry Appl. 17(2): 105-138 (2007)
	2006
34		Mark D. Watson, J. Mark Keil: Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks. ICCSA (1) 2006: 121-130
33		J. Mark Keil, Tzvetalin S. Vassilev: Algorithms for optimal area triangulations of a convex polygon. Comput. Geom. 35(3): 173-187 (2006)
32		J. Mark Keil, Lorna Stewart: Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discrete Applied Mathematics 154(14): 1983-1995 (2006)
	2005
31		J. Mark Keil, Tzvetalin S. Vassilev: The relative neighbourhood graph is a part of every 30°-triangulation. EWCG 2005: 9-12
	2004
30		Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)
29		J. Mark Keil, Patrice Belleville: Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. Discrete Applied Mathematics 140(1-3): 73-89 (2004)
	2003
28		J. Mark Keil, Tzvetalin S. Vassilev: An algorithm for the MaxMin area triangulation of a convex polygon. CCCG 2003: 145-149
27		Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42
	2002
26		Michael J. Spriggs, J. Mark Keil: A new bound for map labeling with uniform circle pairs. Inf. Process. Lett. 81(1): 47-53 (2002)
25		J. Mark Keil, Jack Snoeyink: On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geometry Appl. 12(3): 181-192 (2002)
24		Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, J. David Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)
	2000
23		Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111
	1999
22		Michael J. Spriggs, J. Mark Keil: Minimum spanning trees on polyhedra. CCCG 1999
	1998
21		J. Mark Keil, Jack Snoeyink: On the time bound for convex decomposition of simple polygons. CCCG 1998
	1997
20		Matthew Dickerson, J. Mark Keil, Mark H. Montague: A Large Subgraph of the Minimum Weight Triangulation. Discrete & Computational Geometry 18(3): 289-304 (1997)
19		J. Mark Keil: Covering Orthogonal Polygons with Non-Piercing Rectangles. Int. J. Comput. Geometry Appl. 7(5): 473-484 (1997)
18		Leizhen Cai, J. Mark Keil: Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geometry Appl. 7(6): 515-538 (1997)
	1996
17		Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink: On Computing Edges That Are In All Minimum-Weight Triangulations. Symposium on Computational Geometry 1996: V-7-V-8
	1994
16		J. Mark Keil: Computing a Subgraph of the Minimum Weight Triangulation. Comput. Geom. 4: 18-26 (1994)
	1993
15		J. Mark Keil: The Complexity of Domination Problems in Circle Graphs. Discrete Applied Mathematics 42(1): 51-63 (1993)
14		Leizhen Cai, J. Mark Keil: Degree-Bounded Spanners. Parallel Processing Letters 3: 457-468 (1993)
	1992
13		J. Mark Keil, Carl A. Gutwin: Classes of Graphs Which Approximate the Complete Euclidean Graph. Discrete & Computational Geometry 7: 13-28 (1992)
12		J. Mark Keil, Doug Schaefer: An optimal algorithm for finding dominating cycles in circular-arc graphs. Discrete Applied Mathematics 36(1): 25-34 (1992)
11		Hossam ElGindy, J. Mark Keil: Efficient Algorithms for the Capacitated 1-Median Problem. INFORMS Journal on Computing 4(4): 418-425 (1992)
	1989
10		J. Mark Keil, Carl A. Gutwin: The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. WADS 1989: 47-56
9		Larry Aupperle, J. Mark Keil: Polynomial algorithms for restricted Euclidean p-centre problems. Discrete Applied Mathematics 23(1): 25-31 (1989)
	1988
8		J. Mark Keil: Approximating the Complete Euclidean Graph. SWAT 1988: 208-213
7		Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. Symposium on Computational Geometry 1988: 252-257
	1986
6		J. Mark Keil: Minimally Covering a Horizontally Convex Orthogonal Polygon. Symposium on Computational Geometry 1986: 43-51
5		J. Mark Keil: Total Domination in Interval Graphs. Inf. Process. Lett. 22(4): 171-174 (1986)
	1985
4		J. Mark Keil: Finding Hamiltonian Circuits in Interval Graphs. Inf. Process. Lett. 20(4): 201-206 (1985)
3		Martin Farber, J. Mark Keil: Domination in Permutation Graphs. J. Algorithms 6(3): 309-321 (1985)
2		J. Mark Keil: Decomposing a Polygon into Simpler Components. SIAM J. Comput. 14(4): 799-817 (1985)
	1983
1		Derek G. Corneil, J. Mark Keil: A note on a conjecture by Gavril on clique separable graphs. Discrete Mathematics 46(3): 317-318 (1983)

Coauthor Index

1	Tetsuo Asano	[7]
2	Larry Aupperle	[9]
3	Patrice Belleville	[17] [29]
4	Sergey Bereg (Sergei Bespamyatnikh)	[23] [24] [27] [30]
5	Binay K. Bhattacharya	[7] [23] [24]
6	Leizhen Cai	[14] [18]
7	Derek G. Corneil	[1]
8	Matthew Dickerson (Matthew T. Dickerson)	[20]
9	Hossam ElGindy	[11]
10	Martin Farber	[3]
11	Carl A. Gutwin	[10] [13]
12	David G. Kirkpatrick	[23]
13	J. David Kirkpatrick	[24]
14	Michael McAllister	[17]
15	Mark H. Montague	[20]
16	Doug Schaefer	[12]
17	Michael Segal	[23] [24] [27] [30]
18	Jack Snoeyink	[17] [21] [25] [27] [30]
19	Michael J. Spriggs	[22] [26] [27] [30]
20	Lorna Stewart (Lorna K. Stewart)	[32]
21	Tzvetalin S. Vassilev	[28] [31] [33] [36]
22	Mark D. Watson	[34]
23	Chris Worman	[35]
24	F. Frances Yao (Frances F. Yao, Foong Frances Yao)	[7]

Colors in the list of coauthors