Thomas C. Shermer

80 papers A* 3A 6B 6C 3Journal 43Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Piercing unit geodesic disks. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
2025	A*	`conf`	Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. SoCG 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, Da Wei Zheng
2025	J	`jnl`	Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
2024	J	`jnl`	Contiguous Boundary Guarding. CoRR Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Thomas C. Shermer
2024	B	`conf`	Supporting Exploration of Women's Print History Project Data via Interactively Constructing Networks of Interest. AVI Parnian Taghipour, Maryam Rezaie, Michelle Levy, Thomas C. Shermer, Sheelagh Carpendale
2023	—	`conf`	A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2023	—	`conf`	Piercing Unit Geodesic Disks. CCCG Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
2022	J	`jnl`	A combinatorial bound for beacon-based routing in orthogonal polygons. J. Comput. Geom. Thomas C. Shermer
2022	C	`conf`	An Efficient Algorithm for the Proximity Connected Two Center Problem. IWOCA Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022	J	`jnl`	An Efficient Algorithm for the Proximity Connected Two Center Problem. CoRR Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022	B	`conf`	On the Zombie Number of Various Graph Classes. LATIN Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
2022	B	`conf`	Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
2022	J	`jnl`	Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
2021	J	`jnl`	Attraction-convexity and normal visibility. Comput. Geom. Prosenjit Bose, Thomas C. Shermer
2021	J	`jnl`	Piercing pairwise intersecting geodesic disks. Comput. Geom. Prosenjit Bose, Paz Carmi, Thomas C. Shermer
2020	J	`jnl`	Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
2020	J	`jnl`	Gathering by repulsion. Comput. Geom. Prosenjit Bose, Thomas C. Shermer
2019	—	`conf`	Attraction-convexity and Normal Visibility. CCCG Prosenjit Bose, Thomas C. Shermer
2019	C	`conf`	Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
2018	—	`conf`	Gathering by Repulsion. SWAT Prosenjit Bose, Thomas C. Shermer
2018	J	`jnl`	Gathering by Repulsion. CoRR Prosenjit Bose, Thomas C. Shermer
2018	C	`conf`	Transmitting Particles in a Polygonal Domain by Repulsion. COCOA Amirhossein Mozafari, Thomas C. Shermer
2016	—	`ed.`	Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada CCCG Thomas C. Shermer
2015	—	`conf`	A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CCCG Thomas C. Shermer
2015	J	`jnl`	A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. CoRR Thomas C. Shermer
2014	B	`conf`	Bitwise data parallelism in regular expression matching. PACT Robert D. Cameron, Thomas C. Shermer, Arrvindh Shriraman, Kenneth S. Herdy, Dan Lin, Benjamin R. Hull, Meng Lin
2011	J	`jnl`	Nonadaptive broadcasting in trees. Networks Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
2011	—	`conf`	Parallel Scanning with Bitstream Addition: An XML Case Study. Euro-Par (2) Robert D. Cameron, Ehsan Amiri, Kenneth S. Herdy, Dan Lin, Thomas C. Shermer, Fred Popowich
2009	J	`jnl`	Edge-disjoint spanners in tori. Discret. Math. Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2007	J	`jnl`	Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami
2006	J	`jnl`	A linear time algorithm to remove winding of a simple polygon. Comput. Geom. Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
2005	J	`jnl`	Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003	J	`jnl`	Factor Discret. Math. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2002	J	`jnl`	Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
2001	J	`jnl`	Edge-disjoint spanners of complete bipartite graphs. Discret. Math. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
2001	A	`conf`	Orthogonal Drawings with Few Layers. GD Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
2000	—	`conf`	Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman
2000	J	`jnl`	Linear-Time Algorithms for Partial Algorithmica Arvind Gupta, Damon Kaller, Thomas C. Shermer
2000	J	`jnl`	Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. David Bremner, Thomas C. Shermer
2000	—	`ch.`	Visibility in the Plane. Handbook of Computational Geometry Tetsuo Asano, Subir Kumar Ghosh, Thomas C. Shermer
1999	J	`jnl`	Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1999	J	`jnl`	Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
1999	J	`jnl`	On representations of some thickness-two graphs. Comput. Geom. Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
1999	A*	`conf`	On the Complements of Partial k-Trees. ICALP Arvind Gupta, Damon Kaller, Thomas C. Shermer
1998	J	`jnl`	A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 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
1998	—	`conf`	Finding specified sections of arrangements: 2d results. CCCG Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
1998	J	`jnl`	Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geom. Appl. James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia
1997	—	`conf`	A Complete Roundness Classification Procedure. SCG Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap
1997	—	`conf`	Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
1997	J	`jnl`	Guarding Polyhedral Terrains. Comput. Geom. Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu
1997	A	`conf`	Orthogonal 3-D Graph Drawing. GD Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1997	—	`conf`	The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
1996	J	`jnl`	Degree-constrained Spanners for Multidimensional Grids. Discret. Appl. Math. Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte
1996	J	`jnl`	Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
1996	J	`jnl`	Isomorphism of Spiral Polygons. Discret. Comput. Geom. G. MacDonald, Thomas C. Shermer
1996	A	`conf`	On Rectangle Visibility Graphs. GD Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer
1996	—	`conf`	On Rectangle Visibility Graphs. III. External Visibility and Complexity. CCCG Thomas C. Shermer
1996	—	`conf`	On the Sectional Area of Convex Polytopes. SCG David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
1996	—	`conf`	Vertex Partitioning Problems On Partial k-Trees. SWAT Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
1995	J	`jnl`	Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discret. Math. Arthur L. Liestman, Thomas C. Shermer
1995	A	`conf`	Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons. GD M. Sheelagh T. Carpendale, David J. Cowperthwaite, F. David Fracchia, Thomas C. Shermer
1995	—	`conf`	Illuminating convex polygonswith vertex floodlight. CCCG Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu
1995	B	`conf`	Illumination with Orthogonal Floodlights. ISAAC James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia
1995	A	`conf`	On Representations of Some Thickness-Two Graphs. GD Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince
1995	B	`conf`	Regular-Factors In The Complements Of Partial k-Trees. WADS Damon Kaller, Arvind Gupta, Thomas C. Shermer
1995	A	`conf`	The Chi-t-Coloring Problem. STACS Damon Kaller, Arvind Gupta, Thomas C. Shermer
1994	—	`conf`	Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
1994	J	`jnl`	The Superman problem. Vis. Comput. Naji Mouawad, Thomas C. Shermer
1993	J	`jnl`	Additive graph spanners. Networks Arthur L. Liestman, Thomas C. Shermer
1993	J	`jnl`	Grid spanners. Networks Arthur L. Liestman, Thomas C. Shermer
1993	J	`jnl`	On recognizing unions of two convex polygons and related problems. Pattern Recognit. Lett. Thomas C. Shermer
1993	—	`conf`	The Continuous-graph Approach to Visibility Problems. CCCG Thomas C. Shermer
1992	J	`jnl`	A Linear Algorithm for Bisecting a Polygon. Inf. Process. Lett. Thomas C. Shermer
1992	J	`jnl`	Probing Polygons Minimally Is Hard. Comput. Geom. Patrice Belleville, Thomas C. Shermer
1992	J	`jnl`	Recent results in art galleries (geometry). Proc. IEEE Thomas C. Shermer
1991	J	`jnl`	A Counterexample to the Algorithms for Determining Opaque Minimal Forests. Inf. Process. Lett. Thomas C. Shermer
1991	J	`jnl`	Additive Spanners for Hypercubes. Parallel Process. Lett. Arthur L. Liestman, Thomas C. Shermer
1991	J	`jnl`	Computing Bushy and Thin Triangulations. Comput. Geom. Thomas C. Shermer
1991	A*	`conf`	The Aquarium Keeper's Problem. SODA Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
1989	J	`jnl`	Hiding people in polygons. Computing Thomas C. Shermer