Thomas C. Shermer

From MaRDI portal
Person:186179

Available identifiers

zbMath Open shermer.thomas-catonMaRDI QIDQ186179

List of research outcomes

PublicationDate of PublicationType
On the zombie number of various graph classes2023-07-26Paper
An efficient algorithm for the proximity connected two center problem2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50776532022-05-18Paper
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor2022-04-25Paper
Piercing pairwise intersecting geodesic disks2021-09-17Paper
Attraction-convexity and normal visibility2021-09-16Paper
Computing the \(k\)-visibility region of a point in a polygon2021-06-11Paper
Gathering by repulsion2020-10-23Paper
Gathering by Repulsion.2020-08-25Paper
Computing the \(k\)-crossing visibility region of a point in a polygon2020-02-25Paper
Transmitting particles in a polygonal domain by repulsion2019-10-11Paper
Nonadaptive broadcasting in trees2011-03-16Paper
Edge-disjoint spanners in tori2009-06-19Paper
Computing the maximum clique in the visibility graph of a simple polygon2008-01-11Paper
A linear time algorithm to remove winding of a simple polygon2006-04-28Paper
Edge-disjoint spanners in Cartesian products of graphs2005-08-17Paper
POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q30437322004-08-06Paper
Factor \(d\)-domatic colorings of graphs2003-04-28Paper
Edge-disjoint spanners of complete bipartite graphs2002-03-29Paper
https://portal.mardi4nfdi.de/entity/Q49455202000-11-13Paper
Illumination of Orthogonal Polygons with Orthogonal Floodlights2000-11-07Paper
Degree-Constrained Network Spanners with Nonconstant Delay2000-07-04Paper
On representations of some thickness-two graphs2000-01-17Paper
Edge-disjoint spanners of complete graphs and complete digraphs1999-12-20Paper
A Visibility Representation for Graphs in Three Dimensions1998-07-05Paper
Guarding polyhedral terrains1997-03-18Paper
Degree-constrained spanners for multidimensional grids1996-11-25Paper
Generalized guarding and partitioning for rectilinear polygons1996-11-04Paper
On recognizing unions of two convex polygons and related problems1994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31389831993-10-20Paper
Grid spanners1993-09-05Paper
Additive graph spanners1993-08-23Paper
Probing polygons minimally is hard1993-06-29Paper
Computing bushy and thin triangulations1992-09-27Paper
A counterexample to the algorithms for determining opaque minimal forests1992-06-28Paper
A linear algorithm for bisecting a polygon1992-06-28Paper
Covering and guarding polygons using \(L_ k\)-sets1991-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas C. Shermer