The following pages link to Esther M. Arkin (Q233538):
Displaying 50 items.
- Convex transversals (Q390129) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- On local search for weighted \(k\)-set packing (Q826067) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- Geometric stable roommates (Q976079) (← links)
- Matching points with squares (Q1006403) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- (Q1121771) (redirect page) (← links)
- Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Recognizing polygonal parts width measurements (Q1384211) (← links)
- On minimum-area hulls (Q1386468) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- Graph partitions with minimum degree constraints (Q1584392) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- An algorithmic study of manufacturing paperclips and other folded structures. (Q1873158) (← links)
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems (Q1882632) (← links)
- When can you fold a map? (Q1883580) (← links)
- Arrangements of segments that share endpoints: Single face results (Q1892408) (← links)
- The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
- Optimization problems related to zigzag pocket machining (Q1969954) (← 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)
- Testing simple polygons. (Q2482903) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- On Local Search for Weighted <i>k</i>-Set Packing (Q2757555) (← links)
- (Q2768284) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- (Q3024770) (← links)
- Analysis of Heuristics for the Freeze-Tag Problem (Q3046501) (← links)
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems (Q3046502) (← links)
- (Q3138886) (← links)
- (Q3138938) (← links)
- Choice Is Hard (Q3459872) (← links)
- Two New Classes of Hamiltonian Graphs (Q3503520) (← links)
- The Snowblower Problem (Q3564308) (← links)
- The (K,k)-Capacitated Spanning Tree Problem (Q3578356) (← links)
- (Q3601572) (← links)
