Thomas C. Shermer

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 20

Top Topics

Digital Convexity

Data Parallelism

Top Venues

Publications

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)
Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
Piercing Unit Geodesic Disks. CCCG (2023)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) (2023)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
An Efficient Algorithm for the Proximity Connected Two Center Problem. CoRR (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
On the Zombie Number of Various Graph Classes. LATIN (2022)
Thomas C. Shermer
A combinatorial bound for beacon-based routing in orthogonal polygons. J. Comput. Geom. 13 (1) (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR (2022)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
An Efficient Algorithm for the Proximity Connected Two Center Problem. IWOCA (2022)
Prosenjit Bose, Paz Carmi, Thomas C. Shermer
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98 (2021)
Prosenjit Bose, Thomas C. Shermer
Attraction-convexity and normal visibility. Comput. Geom. 96 (2021)
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) (2020)
Prosenjit Bose, Thomas C. Shermer
Gathering by repulsion. Comput. Geom. 90 (2020)
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA (2019)
Prosenjit Bose, Thomas C. Shermer
Attraction-convexity and Normal Visibility. CCCG (2019)
Prosenjit Bose, Thomas C. Shermer
Gathering by Repulsion. SWAT (2018)
Amirhossein Mozafari, Thomas C. Shermer
Transmitting Particles in a Polygonal Domain by Repulsion. COCOA (2018)
Prosenjit Bose, Thomas C. Shermer
Gathering by Repulsion. CoRR (2018)
Thomas C. Shermer
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CoRR (2015)
Thomas C. Shermer
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CCCG (2015)
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)
Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
Nonadaptive broadcasting in trees. Networks 57 (2) (2011)
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)
Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in tori. Discret. Math. 309 (8) (2009)
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) (2007)
Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33 (3) (2006)
Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. 296 (2-3) (2005)
Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
-domatic colorings of graphs. Discret. Math. 262 (1-3) (2003)
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) (2002)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234 (1-3) (2001)
Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
Orthogonal Drawings with Few Layers. Graph Drawing (2001)
David Bremner, Thomas C. Shermer
Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Arvind Gupta, Damon Kaller, Thomas C. Shermer
-Tree Complements. Algorithmica 27 (3) (2000)
Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman
Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN (2000)
Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
On representations of some thickness-two graphs. Comput. Geom. 13 (3) (1999)
Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3 (4) (1999)
Arvind Gupta, Damon Kaller, Thomas C. Shermer
On the Complements of Partial k-Trees. ICALP (1999)
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) (1999)
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)
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) (1998)
James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia
Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geom. Appl. 8 (1) (1998)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics (1997)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) (1997)
Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
A Complete Roundness Classification Procedure. SCG (1997)
Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
Orthogonal 3-D Graph Drawing. Graph Drawing (1997)
Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu
Guarding Polyhedral Terrains. Comput. Geom. 7 (1997)
Thomas C. Shermer
On Rectangle Visibility Graphs. III. External Visibility and Complexity. CCCG (1996)
David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
On the Sectional Area of Convex Polytopes. SCG (1996)
Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte
Degree-constrained Spanners for Multidimensional Grids. Discret. Appl. Math. 68 (1-2) (1996)
G. MacDonald, Thomas C. Shermer
Isomorphism of Spiral Polygons. Discret. Comput. Geom. 16 (3) (1996)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6 (1996)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
Vertex Partitioning Problems On Partial k-Trees. SWAT (1996)
Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer
On Rectangle Visibility Graphs. Graph Drawing (1996)
James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia
Illumination with Orthogonal Floodlights. ISAAC (1995)
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)
Arthur L. Liestman, Thomas C. Shermer
Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discret. Math. 8 (2) (1995)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
The Chi-t-Coloring Problem. STACS (1995)
Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
On Representations of Some Thickness-Two Graphs. Graph Drawing (1995)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
Regular-Factors In The Complements Of Partial k-Trees. WADS (1995)
Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu
Illuminating convex polygonswith vertex floodlight. CCCG (1995)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG (1994)
Naji Mouawad, Thomas C. Shermer
The Superman problem. Vis. Comput. 10 (8) (1994)
Thomas C. Shermer
The Continuous-graph Approach to Visibility Problems. CCCG (1993)
Thomas C. Shermer
On recognizing unions of two convex polygons and related problems. Pattern Recognit. Lett. 14 (9) (1993)
Arthur L. Liestman, Thomas C. Shermer
Additive graph spanners. Networks 23 (4) (1993)
Arthur L. Liestman, Thomas C. Shermer
Grid spanners. Networks 23 (2) (1993)
Patrice Belleville, Thomas C. Shermer
Probing Polygons Minimally Is Hard. Comput. Geom. 2 (1992)
Thomas C. Shermer
Recent results in art galleries (geometry). Proc. IEEE 80 (9) (1992)
Thomas C. Shermer
A Linear Algorithm for Bisecting a Polygon. Inf. Process. Lett. 41 (3) (1992)
Thomas C. Shermer
Computing Bushy and Thin Triangulations. Comput. Geom. 1 (1991)
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)
Arthur L. Liestman, Thomas C. Shermer
Additive Spanners for Hypercubes. Parallel Process. Lett. 1 (1991)
Thomas C. Shermer
A Counterexample to the Algorithms for Determining Opaque Minimal Forests. Inf. Process. Lett. 40 (1) (1991)
Thomas C. Shermer
Hiding people in polygons. Computing 42 (2-3) (1989)