The following pages link to Joseph S. B. Mitchell (Q244519):
Displaying 42 items.
- Optimizing Read Reversals for Sequence Compression (Q5283828) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
- On the Continuous Fermat-Weber Problem (Q5322073) (← links)
- On the continuous Weber and <i>k</i> -median problems (extended abstract) (Q5361517) (← links)
- Simplifying a polygonal subdivision while keeping it simple (Q5361557) (← links)
- Farthest neighbors and center points in the presence of rectngular obstacles (Q5361573) (← links)
- Computing the visibility graph of points within a polygon (Q5361651) (← links)
- New results on shortest paths in three dimensions (Q5361664) (← links)
- Shortest path to a segment and quickest visibility queries (Q5368719) (← links)
- Preprocessing Imprecise Points and Splitting Triangulations (Q5390584) (← links)
- Algorithms and Data Structures (Q5394249) (← links)
- Algorithms and Data Structures (Q5394261) (← links)
- Guarding polyominoes (Q5404453) (← links)
- A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane (Q5405881) (← links)
- Geometric algorithms for optimal airspace design and air traffic controller workload balancing (Q5406204) (← links)
- THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding (Q5432364) (← links)
- Matching Points with Circles and Squares (Q5449749) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
- Optimal Covering Tours with Turn Costs (Q5470702) (← links)
- Algorithms – ESA 2005 (Q5475827) (← links)
- (Q5501798) (← links)
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE (Q5687652) (← links)
- (Q5692695) (← links)
- Approximating Watchman Routes (Q5741768) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- (Q5875486) (← links)
- The snowblower problem (Q5894212) (← links)
- Algorithms and Data Structures (Q5900758) (← links)
- Maximum thick paths in static and dynamic environments (Q5901409) (← links)
- Maximum thick paths in static and dynamic environments (Q5902231) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Minimum membership covering and hitting (Q5919661) (← links)
- Locked and unlocked chains of planar shapes (Q5962351) (← links)
- Computing β-Stretch Paths in Drawings of Graphs. (Q6059163) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
- (Q6124759) (← links)
- Probing a set of trajectories to maximize captured information (Q6487600) (← links)
- On some applications of computational geometry in manufacturing and virtual environments (extended abstract) (Q6560219) (← links)
- On flipping the Fréchet distance (Q6610317) (← links)
- On flipping the Fréchet distance (Q6647773) (← links)
