Hiding people in polygons. - Thomas C. Shermer (Computing, 1989)

The Aquarium Keeper's Problem. - Jurek Czyzowicz; Peter Egyed; Hazel Everett; David Rappaport; Thomas C. Shermer; Diane L. Souvaine; Godfried T. Toussaint; Jorge Urrutia (SODA, 1991)

Computing Bushy and Thin Triangulations. - Thomas C. Shermer (Comput. Geom., 1991)

A Counterexample to the Algorithms for Determining Opaque Minimal Forests. - Thomas C. Shermer (Inf. Process. Lett., 1991)

Additive Spanners for Hypercubes. - Arthur L. Liestman; Thomas C. Shermer (Parallel Process. Lett., 1991)

Probing Polygons Minimally Is Hard. - Patrice Belleville; Thomas C. Shermer (Comput. Geom., 1992)

A Linear Algorithm for Bisecting a Polygon. - Thomas C. Shermer (Inf. Process. Lett., 1992)

Recent results in art galleries (geometry). - Thomas C. Shermer (Proc. IEEE, 1992)

The Continuous-graph Approach to Visibility Problems. - Thomas C. Shermer (CCCG, 1993)

Grid spanners. - Arthur L. Liestman; Thomas C. Shermer (Networks, 1993)

Additive graph spanners. - Arthur L. Liestman; Thomas C. Shermer (Networks, 1993)

On recognizing unions of two convex polygons and related problems. - Thomas C. Shermer (Pattern Recognit. Lett., 1993)

The Superman problem. - Naji Mouawad; Thomas C. Shermer (Vis. Comput., 1994)

Illuminating convex polygonswith vertex floodlight. - Joseph O'Rourke; Thomas C. Shermer; Ileana Streinu (CCCG, 1995)

Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons. - M. Sheelagh T. Carpendale; David J. Cowperthwaite; F. David Fracchia; Thomas C. Shermer (GD, 1995)

Illumination with Orthogonal Floodlights. - James Abello; Vladimir Estivill-Castro; Thomas C. Shermer; Jorge Urrutia (ISAAC, 1995)

The Chi-t-Coloring Problem. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (STACS, 1995)

Regular-Factors In The Complements Of Partial k-Trees. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (WADS, 1995)

Degree-Constrained Network Spanners with Nonconstant Delay. - Arthur L. Liestman; Thomas C. Shermer (SIAM J. Discret. Math., 1995)

On Rectangle Visibility Graphs. III. External Visibility and Complexity. - Thomas C. Shermer (CCCG, 1996)

On the Sectional Area of Convex Polytopes. - David Avis; Prosenjit Bose; Godfried T. Toussaint; Thomas C. Shermer; Binhai Zhu; Jack Snoeyink (SCG, 1996)

On Rectangle Visibility Graphs. - Prosenjit Bose; Alice M. Dean; Joan P. Hutchinson; Thomas C. Shermer (GD, 1996)

Vertex Partitioning Problems On Partial k-Trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (SWAT, 1996)

Generalized Guarding and Partitioning for Rectilinear Polygons. - Ervin Györi; Frank Hoffmann 002; Klaus Kriegel; Thomas C. Shermer (Comput. Geom., 1996)

Degree-constrained Spanners for Multidimensional Grids. - Arthur L. Liestman; Thomas C. Shermer; Christopher R. Stolte (Discret. Appl. Math., 1996)

Isomorphism of Spiral Polygons. - G. MacDonald; Thomas C. Shermer (Discret. Comput. Geom., 1996)

A Complete Roundness Classification Procedure. - Kurt Mehlhorn; Thomas C. Shermer; Chee-Keng Yap (SCG, 1997)

The generalized matching problem on partial $k$-trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (Contemporary Trends in Discrete Mathematics, 1997)

Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (GD, 1997)

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. - Christian Laforest; Arthur L. Liestman; Thomas C. Shermer; Dominique Sotteau (HICSS (1), 1997)

Guarding Polyhedral Terrains. - Prosenjit Bose; Thomas C. Shermer; Godfried T. Toussaint; Binhai Zhu (Comput. Geom., 1997)

Illumination of Orthogonal Polygons with Orthogonal Floodlights. - James Abello; Vladimir Estivill-Castro; Thomas C. Shermer; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1998)

A Visibility Representation for Graphs in Three Dimensions. - 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 (J. Graph Algorithms Appl., 1998)

On the Complements of Partial k-Trees. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (ICALP, 1999)

On representations of some thickness-two graphs. - Joan P. Hutchinson; Thomas C. Shermer; Andrew Vince (Comput. Geom., 1999)

Edge-disjoint spanners of complete graphs and complete digraphs. - Christian Laforest; Arthur L. Liestman; David Peleg; Thomas C. Shermer; Dominique Sotteau (Discret. Math., 1999)

Bounds for Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (J. Graph Algorithms Appl., 1999)

Visibility in the Plane. - Tetsuo Asano; Subir Kumar Ghosh; Thomas C. Shermer (Handbook of Computational Geometry, 2000)

Broadcasting Multiple Messages in Hypercubes (preliminary version). - Arthur L. Liestman; Thomas C. Shermer; Matthew J. Suderman (ISPAN, 2000)

Linear-Time Algorithms for Partial k-Tree Complements. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (Algorithmica, 2000)

Point Visibility Graphs and O-Convex Cover. - David Bremner; Thomas C. Shermer (Int. J. Comput. Geom. Appl., 2000)

Orthogonal Drawings with Few Layers. - Therese Biedl; John R. Johansen; Thomas C. Shermer; David R. Wood (GD, 2001)

Edge-disjoint spanners of complete bipartite graphs. - Christian Laforest; Arthur L. Liestman; Thomas C. Shermer; Dominique Sotteau (Discret. Math., 2001)

Finding Specified Sections of Arrangements: 2D Results. - Prosenjit Bose; Ferran Hurtado; Henk Meijer; Suneeta Ramaswami; David Rappaport; Vera Sacristán; Thomas C. Shermer; Godfried T. Toussaint (J. Math. Model. Algorithms, 2002)

Factor d-domatic colorings of graphs. - Noga Alon; Guillaume Fertin; Arthur L. Liestman; Thomas C. Shermer; Ladislav Stacho (Discret. Math., 2003)

Edge-disjoint spanners in Cartesian products of graphs. - Guillaume Fertin; Arthur L. Liestman; Thomas C. Shermer; Ladislav Stacho (Discret. Math., 2005)

A linear time algorithm to remove winding of a simple polygon. - Binay K. Bhattacharya; Subir Kumar Ghosh; Thomas C. Shermer (Comput. Geom., 2006)

Computing the maximum clique in the visibility graph of a simple polygon. - Subir Kumar Ghosh; Thomas C. Shermer; Binay K. Bhattacharya; Partha P. Goswami (J. Discrete Algorithms, 2007)

Edge-disjoint spanners in tori. - Arthur L. Liestman; Thomas C. Shermer; Ladislav Stacho (Discret. Math., 2009)

Parallel Scanning with Bitstream Addition: An XML Case Study. - Robert D. Cameron; Ehsan Amiri; Kenneth S. Herdy; Dan Lin 003; Thomas C. Shermer; Fred Popowich (Euro-Par (2), 2011)

Nonadaptive broadcasting in trees. - Hovhannes A. Harutyunyan; Arthur L. Liestman; Kazuhisa Makino; Thomas C. Shermer (Networks, 2011)

Bitwise data parallelism in regular expression matching. - Robert D. Cameron; Thomas C. Shermer; Arrvindh Shriraman; Kenneth S. Herdy; Dan Lin 003; Benjamin R. Hull; Meng Lin (PACT, 2014)

Transmitting Particles in a Polygonal Domain by Repulsion. - Amirhossein Mozafari; Thomas C. Shermer (COCOA, 2018)

Computing the k-Crossing Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Prosenjit Bose; Stephane Durocher; Thomas C. Shermer (IWOCA, 2019)

Gathering by repulsion. - Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2020)

Computing the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Prosenjit Bose; Stephane Durocher; Thomas C. Shermer (Theory Comput. Syst., 2020)

Piercing pairwise intersecting geodesic disks. - Prosenjit Bose; Paz Carmi; Thomas C. Shermer (Comput. Geom., 2021)

Attraction-convexity and normal visibility. - Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2021)

An Efficient Algorithm for the Proximity Connected Two Center Problem. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (IWOCA, 2022)

On the Zombie Number of Various Graph Classes. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (LATIN, 2022)

A combinatorial bound for beacon-based routing in orthogonal polygons. - Thomas C. Shermer (J. Comput. Geom., 2022)

A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (COCOON (2), 2023)

Supporting Exploration of Women's Print History Project Data via Interactively Constructing Networks of Interest. - Parnian Taghipour; Maryam Rezaie; Michelle Levy; Thomas C. Shermer; Sheelagh Carpendale (AVI, 2024)

Contiguous Boundary Guarding. - Ahmad Biniaz; Anil Maheshwari; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Thomas C. Shermer (CoRR, 2024)

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. - Ahmad Biniaz; Anil Maheshwari; Magnus Christian Ring Merrild; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Eliot W. Robson; Casper Moldrup Rysgaard; Jens Kristian Refsgaard Schou; Thomas C. Shermer; Jack Spalding-Jamieson; Rolf Svenning; et al. (SoCG, 2025)

Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (Discret. Math., 2025)

Piercing unit geodesic disks. - Ahmad Biniaz; Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2026)