The following pages link to Thomas C. Shermer (Q186179):
Displaying 41 items.
- (Q676571) (redirect page) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- A counterexample to the algorithms for determining opaque minimal forests (Q1183430) (← links)
- A linear algorithm for bisecting a polygon (Q1186591) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- Probing polygons minimally is hard (Q1803270) (← links)
- Factor \(d\)-domatic colorings of graphs (Q1868834) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- Degree-constrained spanners for multidimensional grids (Q1917351) (← links)
- On representations of some thickness-two graphs (Q1961382) (← links)
- Attraction-convexity and normal visibility (Q1984610) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Gathering by repulsion (Q2206731) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Computing the \(k\)-crossing visibility region of a point in a polygon (Q2301732) (← links)
- Transmitting particles in a polygonal domain by repulsion (Q2327129) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Covering and guarding polygons using \(L_ k\)-sets (Q2640882) (← links)
- (Q3043732) (← links)
- Nonadaptive broadcasting in trees (Q3082604) (← links)
- (Q3138983) (← links)
- On recognizing unions of two convex polygons and related problems (Q4274658) (← links)
- A Visibility Representation for Graphs in Three Dimensions (Q4397214) (← links)
- Illumination of Orthogonal Polygons with Orthogonal Floodlights (Q4513201) (← links)
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← links)
- Degree-Constrained Network Spanners with Nonconstant Delay (Q4837655) (← links)
- (Q4945520) (← links)
- (Q5077653) (← links)
- Gathering by Repulsion. (Q5116477) (← links)
- Grid spanners (Q5287445) (← links)
- Additive graph spanners (Q5289379) (← links)
- Edge-disjoint spanners of complete bipartite graphs (Q5936052) (← links)
- Illumination with orthogonal floodlights (Q6487984) (← links)
- A sub-quadratic time algorithm for computing the beacon kernel of simple polygons (Q6591621) (← links)
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6602482) (← links)
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6635086) (← links)
