The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas C. Shermer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  44. Edge-disjoint spanners in tori. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002