default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas C. Shermer
Person information
- affiliation: Simon Fraser University, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j37]Prosenjit Bose, Jean-Lou De Carufel
, Thomas C. Shermer:
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. 348(1): 114220 (2025)- 2024
- [c34]Parnian Taghipour, Maryam Rezaie, Michelle Levy, Thomas C. Shermer, Sheelagh Carpendale:
Supporting Exploration of Women's Print History Project Data via Interactively Constructing Networks of Interest. AVI 2024: 6:1-6:9 - 2023
- [c33]Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. CCCG 2023: 43-49 - [c32]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) 2023: 69-81 - 2022
- [j36]Thomas C. Shermer:
A combinatorial bound for beacon-based routing in orthogonal polygons. J. Comput. Geom. 13(1): 13-51 (2022) - [c31]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC 2022: 56:1-56:13 - [c30]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
An Efficient Algorithm for the Proximity Connected Two Center Problem. IWOCA 2022: 199-213 - [c29]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
On the Zombie Number of Various Graph Classes. LATIN 2022: 527-543 - [i4]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
An Efficient Algorithm for the Proximity Connected Two Center Problem. CoRR abs/2204.08754 (2022) - [i3]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR abs/2204.11926 (2022) - 2021
- [j35]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and normal visibility. Comput. Geom. 96: 101748 (2021) - [j34]Prosenjit Bose, Paz Carmi, Thomas C. Shermer:
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98: 101774 (2021) - 2020
- [j33]Prosenjit Bose, Thomas C. Shermer:
Gathering by repulsion. Comput. Geom. 90: 101627 (2020) - [j32]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. 64(7): 1292-1306 (2020)
2010 – 2019
- 2019
- [c28]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and Normal Visibility. CCCG 2019: 110-116 - [c27]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21 - 2018
- [c26]Amirhossein Mozafari, Thomas C. Shermer:
Transmitting Particles in a Polygonal Domain by Repulsion. COCOA 2018: 495-508 - [c25]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. SWAT 2018: 13:1-13:12 - [i2]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. CoRR abs/1809.09792 (2018) - 2016
- [e1]Thomas C. Shermer:
Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada. Simon Fraser University, Vancouver, British Columbia, Canada 2016 [contents] - 2015
- [c24]Thomas C. Shermer:
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CCCG 2015 - [i1]Thomas C. Shermer:
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CoRR abs/1507.03509 (2015) - 2014
- [c23]Robert D. Cameron, Thomas C. Shermer, Arrvindh Shriraman, Kenneth S. Herdy, Dan Lin, Benjamin R. Hull, Meng Lin:
Bitwise data parallelism in regular expression matching. PACT 2014: 139-150 - 2011
- [j31]Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer:
Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011) - [c22]Robert D. Cameron, Ehsan Amiri, Kenneth S. Herdy, Dan Lin, Thomas C. Shermer, Fred Popowich:
Parallel Scanning with Bitstream Addition: An XML Case Study. Euro-Par (2) 2011: 2-13
2000 – 2009
- 2009
- [j30]Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in tori. Discret. Math. 309(8): 2239-2249 (2009) - 2007
- [j29]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
- [j28]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
- [j27]Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. 296(2-3): 167-186 (2005) - 2003
- [j26]Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Factor d-domatic colorings of graphs. Discret. Math. 262(1-3): 17-25 (2003) - 2002
- [j25]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - 2001
- [j24]Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234(1-3): 65-76 (2001) - [c21]Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood:
Orthogonal Drawings with Few Layers. GD 2001: 297-311 - 2000
- [j23]Arvind Gupta, Damon Kaller, Thomas C. Shermer:
Linear-Time Algorithms for Partial k-Tree Complements. Algorithmica 27(3): 254-274 (2000) - [j22]David Bremner, Thomas C. Shermer:
Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. 10(1): 55-71 (2000) - [c20]Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman:
Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281 - [p1]Tetsuo Asano, Subir Kumar Ghosh, Thomas C. Shermer:
Visibility in the Plane. Handbook of Computational Geometry 2000: 829-876
1990 – 1999
- 1999
- [j21]Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince:
On representations of some thickness-two graphs. Comput. Geom. 13(3): 161-171 (1999) - [j20]Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203(1-3): 133-159 (1999) - [j19]Therese 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) - [c19]Arvind Gupta, Damon Kaller, Thomas C. Shermer:
On the Complements of Partial k-Trees. ICALP 1999: 382-391 - 1998
- [j18]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geom. Appl. 8(1): 25-38 (1998) - [j17]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(3): 1-16 (1998) - [c18]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - 1997
- [j16]Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu:
Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997) - [c17]Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap:
A Complete Roundness Classification Procedure. SCG 1997: 129-138 - [c16]Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics 1997: 143-158 - [c15]Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath:
Orthogonal 3-D Graph Drawing. GD 1997: 76-86 - [c14]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 - 1996
- [j15]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996) - [j14]Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte:
Degree-constrained Spanners for Multidimensional Grids. Discret. Appl. Math. 68(1-2): 119-144 (1996) - [j13]G. MacDonald, Thomas C. Shermer:
Isomorphism of Spiral Polygons. Discret. Comput. Geom. 16(3): 277-304 (1996) - [c13]Thomas C. Shermer:
On Rectangle Visibility Graphs. III. External Visibility and Complexity. CCCG 1996: 234-239 - [c12]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c11]Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer:
On Rectangle Visibility Graphs. GD 1996: 25-44 - [c10]Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172 - 1995
- [j12]Arthur L. Liestman, Thomas C. Shermer:
Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discret. Math. 8(2): 291-321 (1995) - [c9]Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu:
Illuminating convex polygonswith vertex floodlight. CCCG 1995: 151-156 - [c8]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. GD 1995: 127-139 - [c7]Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince:
On Representations of Some Thickness-Two Graphs. GD 1995: 324-332 - [c6]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371 - [c5]Damon Kaller, Arvind Gupta, Thomas C. Shermer:
The Chi-t-Coloring Problem. STACS 1995: 409-420 - [c4]Damon Kaller, Arvind Gupta, Thomas C. Shermer:
Regular-Factors In The Complements Of Partial k-Trees. WADS 1995: 403-414 - 1994
- [j11]Naji Mouawad, Thomas C. Shermer:
The Superman problem. Vis. Comput. 10(8): 459-473 (1994) - [c3]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307 - 1993
- [j10]Arthur L. Liestman, Thomas C. Shermer:
Grid spanners. Networks 23(2): 123-133 (1993) - [j9]Arthur L. Liestman, Thomas C. Shermer:
Additive graph spanners. Networks 23(4): 343-363 (1993) - [j8]Thomas C. Shermer:
On recognizing unions of two convex polygons and related problems. Pattern Recognit. Lett. 14(9): 737-745 (1993) - [c2]Thomas C. Shermer:
The Continuous-graph Approach to Visibility Problems. CCCG 1993: 321-321 - 1992
- [j7]Patrice Belleville, Thomas C. Shermer:
Probing Polygons Minimally Is Hard. Comput. Geom. 2: 255-265 (1992) - [j6]Thomas C. Shermer:
A Linear Algorithm for Bisecting a Polygon. Inf. Process. Lett. 41(3): 135-140 (1992) - [j5]Thomas C. Shermer:
Recent results in art galleries (geometry). Proc. IEEE 80(9): 1384-1399 (1992) - 1991
- [j4]Thomas C. Shermer:
Computing Bushy and Thin Triangulations. Comput. Geom. 1: 115-125 (1991) - [j3]Thomas C. Shermer:
A Counterexample to the Algorithms for Determining Opaque Minimal Forests. Inf. Process. Lett. 40(1): 41-42 (1991) - [j2]Arthur L. Liestman, Thomas C. Shermer:
Additive Spanners for Hypercubes. Parallel Process. Lett. 1: 35-42 (1991) - [c1]Jurek 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
1980 – 1989
- 1989
- [j1]Thomas C. Shermer:
Hiding people in polygons. Computing 42(2-3): 109-131 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
