The following pages link to Joseph S. B. Mitchell (Q244519):
Displaying 50 items.
- Convex transversals (Q390129) (← links)
- Optimizing restriction site placement for synthetic genomes (Q418177) (← links)
- Routing multi-class traffic flows in the plane (Q427052) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (Q456117) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Packing and covering with segments (Q782181) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Special issue: Selected papers based on the presentations at the 21th annual symposium on computational geometry (SCG '05), Pisa, Italy, June 6--8, 2005 (Q859792) (← links)
- The minimum backlog problem (Q888427) (← links)
- On a triangle counting problem (Q909463) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- Triangulating input-constrained planar point sets (Q975526) (← links)
- Geometric stable roommates (Q976079) (← links)
- Matching points with squares (Q1006403) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- (Q1380798) (redirect page) (← links)
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Recognizing polygonal parts width measurements (Q1384211) (← links)
- On minimum-area hulls (Q1386468) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami (Q1567302) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Edit distance of run-length encoded strings. (Q1853090) (← links)
- New similarity measures between polylines with applications to morphing and polygon sweeping (Q1864114) (← links)
- An algorithmic study of manufacturing paperclips and other folded structures. (Q1873158) (← links)
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles (Q1880211) (← links)
- When can you fold a map? (Q1883580) (← links)
