Thomas C. Shermer

	2007
44		Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami: Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5(3): 524-532 (2007)
	2006
43		Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer: A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33(3): 165-173 (2006)
	2005
42		Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics 296(2-3): 167-186 (2005)
	2003
41		Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Factor d-domatic colorings of graphs. Discrete Mathematics 262(1-3): 17-25 (2003)
	2002
40		Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002)
	2001
39		Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood: Orthogonal Drawings with Few Layers. Graph Drawing 2001: 297-311
38		Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau: Edge-disjoint spanners of complete bipartite graphs. Discrete Mathematics 234(1-3): 65-76 (2001)
	2000
37		Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman: Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281
36		Arvind Gupta, Damon Kaller, Thomas C. Shermer: Linear-Time Algorithms for Partial k-Tree Complements. Algorithmica 27(3): 254-274 (2000)
35		David Bremner, Thomas C. Shermer: Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geometry Appl. 10(1): 55-71 (2000)
	1999
34		Arvind Gupta, Damon Kaller, Thomas C. Shermer: On the Complements of Partial k-Trees. ICALP 1999: 382-391
33		Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince: On representations of some thickness-two graphs. Comput. Geom. 13(3): 161-171 (1999)
32		Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau: Edge-disjoint spanners of complete graphs and complete digraphs. Discrete Mathematics 203(1-3): 133-159 (1999)
31		Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3(4): 63-79 (1999)
	1998
30		Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding specified sections of arrangements: 2d results. CCCG 1998
29		James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geometry Appl. 8(1): 25-38 (1998)
28		Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle: A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(2): (1998)
	1997
27		Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Orthogonal 3-D Graph Drawing. Graph Drawing 1997: 76-86
26		Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau: Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) 1997: 191-199
25		Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap: A Complete Roundness Classification Procedure. Symposium on Computational Geometry 1997: 129-138
24		Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu: Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997)
	1996
23		Thomas C. Shermer: On Rectangle Visibility Graphs. III. External Visibility and Complexity. CCCG 1996: 234-239
22		Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer: On Rectangle Visibility Graphs. Graph Drawing 1996: 25-44
21		Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer: Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172
20		David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink: On the Sectional Area of Convex Polytopes. Symposium on Computational Geometry 1996: C-11-C-12
19		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996)
18		G. MacDonald, Thomas C. Shermer: Isomorphism of Spiral Polygons. Discrete & Computational Geometry 16(3): 277-304 (1996)
17		Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte: Degree-constrained Spanners for Multidimensional Grids. Discrete Applied Mathematics 68(1-2): 119-144 (1996)
	1995
16		M. Sheelagh T. Carpendale, David J. Cowperthwaite, F. David Fracchia, Thomas C. Shermer: Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons. Graph Drawing 1995: 127-139
15		Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince: On Representations of Some Thickness-Two Graphs. Graph Drawing 1995: 324-332
14		James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371
13		Damon Kaller, Arvind Gupta, Thomas C. Shermer: The Chi-t-Coloring Problem. STACS 1995: 409-420
12		Damon Kaller, Arvind Gupta, Thomas C. Shermer: Regular-Factors In The Complements Of Partial k-Trees. WADS 1995: 403-414
11		Arthur L. Liestman, Thomas C. Shermer: Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discrete Math. 8(2): 291-321 (1995)
	1994
10		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307
9		Naji Mouawad, Thomas C. Shermer: The Superman problem. The Visual Computer 10(8): 459-473 (1994)
	1993
8		Thomas C. Shermer: The Continuous-graph Approach to Visibility Problems. CCCG 1993: 321-321
7		Thomas C. Shermer: On recognizing unions of two convex polygons and related problems. Pattern Recognition Letters 14(9): 737-745 (1993)
	1992
6		Patrice Belleville, Thomas C. Shermer: Probing Polygons Minimally Is Hard. Comput. Geom. 2: 255-265 (1992)
5		Thomas C. Shermer: A Linear Algorithm for Bisecting a Polygon. Inf. Process. Lett. 41(3): 135-140 (1992)
	1991
4		Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia: The Aquarium Keeper's Problem. SODA 1991: 459-464
3		Thomas C. Shermer: Computing Bushy and Thin Triangulations. Comput. Geom. 1: 115-125 (1991)
2		Thomas C. Shermer: A Counterexample to the Algorithms for Determining Opaque Minimal Forests. Inf. Process. Lett. 40(1): 41-42 (1991)
1		Arthur L. Liestman, Thomas C. Shermer: Additive Spanners for Hypercubes. Parallel Processing Letters 1: 35-42 (1991)

Coauthor Index

1	James Abello	[14] [29]
2	Vera Sacristán Adinolfi (Vera Sacristan)	[30] [40]
3	Noga Alon	[41]
4	David Avis	[20]
5	Patrice Belleville	[6]
6	Binay K. Bhattacharya	[43] [44]
7	Therese C. Biedl	[27] [31] [39]
8	Prosenjit Bose	[20] [22] [24] [28] [30] [40]
9	David Bremner	[35]
10	M. Sheelagh T. Carpendale	[16]
11	David J. Cowperthwaite	[16]
12	Jirel Czyzowicz	[4]
13	Alice M. Dean	[22]
14	Peter Egyed	[4]
15	Vladimir Estivill-Castro	[14] [29]
16	Hazel Everett	[4] [28]
17	Sándor P. Fekete	[28]
18	Guillaume Fertin	[41] [42]
19	F. David Fracchia	[16]
20	Subir Kumar Ghosh	[43] [44]
21	Partha P. Goswami	[44]
22	Arvind Gupta	[12] [13] [21] [34] [36]
23	Ervin Györi	[10] [19]
24	Frank Hoffmann	[10] [19]
25	Michael E. Houle	[28]
26	Ferran Hurtado	[30] [40]
27	Joan P. Hutchinson	[15] [22] [33]
28	John R. Johansen	[39]
29	Damon Kaller	[12] [13] [21] [34] [36]
30	Klaus Kriegel	[10] [19]
31	Christian Laforest	[26] [32] [38]
32	Arthur L. Liestman	[1] [11] [17] [26] [32] [37] [38] [41] [42]
33	Anna Lubiw	[28]
34	G. MacDonald	[18]
35	Sanjeev Mahajan	[21]
36	Kurt Mehlhorn	[25]
37	Henk Meijer	[28] [30] [40]
38	Naji Mouawad	[9]
39	David Peleg	[32]
40	Suneeta Ramaswami	[30] [40]
41	David Rappaport	[4] [30] [40]
42	Kathleen Romanik	[28]
43	Günter Rote	[28]
44	Jack Snoeyink	[20]
45	Dominique Sotteau	[26] [32] [38]
46	Diane L. Souvaine	[4]
47	Ladislav Stacho	[41] [42]
48	Christopher R. Stolte	[17]
49	Matthew Suderman (Matthew J. Suderman)	[37]
50	Godfried T. Toussaint	[4] [20] [24] [30] [40]
51	Jorge Urrutia	[4] [14] [29]
52	Andrew Vince	[15] [33]
53	Sue Whitesides	[27] [28] [31]
54	Stephen K. Wismath	[27] [31]
55	David R. Wood	[39]
56	Chee-Keng Yap (Chee Yap)	[25]
57	Christian Zelle	[28]
58	Binhai Zhu	[20] [24]

Colors in the list of coauthors