The following pages link to Joseph S. B. Mitchell (Q244519):
Displaying 50 items.
- Arrangements of segments that share endpoints: Single face results (Q1892408) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\) (Q1971507) (← links)
- New results on a family of geometric hitting set problems in the plane (Q2180170) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions (Q2261582) (← links)
- Don't rock the boat: algorithms for balanced dynamic loading and unloading (Q2294706) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- Testing simple polygons. (Q2482903) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- Optimal covering tours with turn costs (Q2768284) (← links)
- Beacon-Based Algorithms for Geometric Routing (Q2842154) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- Watchman Routes for Lines and Segments (Q2904541) (← links)
- Scheduling aircraft to reduce controller workload (Q2917317) (← links)
- A constant-factor approximation algorithm for optimal terrain guarding (Q2921708) (← links)
- (Q2934576) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- (Q3024770) (← links)
- The Discrete Geodesic Problem (Q3028357) (← links)
- (Q3046480) (← links)
- Analysis of Heuristics for the Freeze-Tag Problem (Q3046501) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
- (Q3138886) (← links)
- (Q3138938) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Choice Is Hard (Q3459872) (← links)
- Two New Classes of Hamiltonian Graphs (Q3503520) (← links)
- Improved Approximation Algorithms for Relay Placement (Q3541099) (← links)
- A Near-Tight Approximation Algorithm for the Robot Localization Problem (Q3558011) (← links)
- An Experimental Study of Weighted k-Link Shortest Path Algorithms (Q3564306) (← links)
- The Snowblower Problem (Q3564308) (← links)
- Optimizing Restriction Site Placement for Synthetic Genomes (Q3575258) (← links)
- Touring a sequence of polygons (Q3581275) (← links)
- Finding large sticks and potatoes in polygons (Q3581499) (← links)
- Preprocessing Imprecise Points and Splitting Triangulations (Q3596748) (← links)
- (Q3601523) (← links)
- (Q3601572) (← links)
- (Q3601573) (← links)
- (Q3601580) (← links)
- Thick non-crossing paths and minimum-cost flows in polygonal domains (Q3602854) (← links)
- Routing a maximum number of disks through a scene of moving obstacles (Q3602923) (← links)
