The following pages link to Matthew J. Katz (Q364842):
Displayed 50 items.
- Item:Q364842 (redirect page) (← links)
- Symmetric connectivity with directional antennas (Q364844) (← links)
- Bottleneck non-crossing matching in the plane (Q390164) (← links)
- Polychromatic 4-coloring of cubic bipartite plane graphs (Q409414) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Switching to directional antennas with constant increase in radius and hop distance (Q517801) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Stable roommates spanner (Q691764) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST (Q832851) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Power assignment in radio networks with two power levels (Q870460) (← links)
- Improved bounds on the average distance to the Fermat-Weber center of a convex object (Q976108) (← links)
- Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
- Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066) (← links)
- Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Maintenance of a piercing set for intervals with applications (Q1402217) (← links)
- Guarding scenes against invasive hypercubes. (Q1405005) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Models and motion planning (Q1614069) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Geographic quorum system approximations (Q1774150) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Realistic input models for geometric algorithms (Q1849788) (← links)
- Walking around fat obstacles. (Q1853053) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon (Q1944045) (← links)
- On the union of \(\kappa\)-curved objects (Q1969596) (← links)
- Discrete rectilinear 2-center problems (Q1975961) (← links)
- Dynamic data structures for fat objects and their applications (Q1975962) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST (Q2088886) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Tracking paths (Q2185723) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- Efficient nearest-neighbor query and clustering of planar curves (Q2285081) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- On the Fermat-Weber center of a convex object (Q2571212) (← links)