dblp.uni-trier.dewww.uni-trier.de

Thomas C. Shermer Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
44EESubir 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
43EEBinay 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
42EEGuillaume 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
41EENoga 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
39EETherese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood: Orthogonal Drawings with Few Layers. Graph Drawing 2001: 297-311
38EEChristian 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
37EEArthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman: Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281
36EEArvind 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
34EEArvind 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)
32EEChristian 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)
31EETherese 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
30EEProsenjit 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)
28EEProsenjit 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
26EEChristian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau: Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) 1997: 191-199
25EEKurt 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
21EEArvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer: Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172
20EEDavid 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)
18EEG. MacDonald, Thomas C. Shermer: Isomorphism of Spiral Polygons. Discrete & Computational Geometry 16(3): 277-304 (1996)
17EEArthur 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
14EEJames Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371
13EEDamon 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
11EEArthur 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
7EEThomas 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)