An efficiently computable metric for comparing polygonal shapes EM Arkin, LP Chew, DP Huttenlocher, K Kedem, JSB Mitchell Cornell University Operations Research and Industrial Engineering, 1989 | 1087 | 1989 |

Approximation algorithms for the geometric covering salesman problem EM Arkin, R Hassin Discrete Applied Mathematics 55 (3), 197-218, 1994 | 436 | 1994 |

Scheduling jobs with fixed start and end times EM Arkin, EB Silverberg Discrete Applied Mathematics 18 (1), 1-8, 1987 | 416 | 1987 |

Computational complexity of uncapacitated multi-echelon production planning problems E Arkin, D Joneja, R Roundy Operations research letters 8 (2), 61-66, 1989 | 361 | 1989 |

Approximation algorithms for lawn mowing and milling EM Arkin, SP Fekete, JSB Mitchell Computational Geometry 17 (1-2), 25-50, 2000 | 350 | 2000 |

Approximations for minimum and min-max vehicle routing problems EM Arkin, R Hassin, A Levin Journal of Algorithms 59 (1), 1-18, 2006 | 191 | 2006 |

Hamiltonian triangulations for fast rendering EM Arkin, M Held, JSB Mitchell, SS Skiena The Visual Computer 12, 429-444, 1996 | 188 | 1996 |

Algorithms for rapidly dispersing robot swarms in unknown environments TR Hsiang, EM Arkin, MA Bender, SP Fekete, JSB Mitchell Algorithmic Foundations of Robotics V, 77-93, 2004 | 149 | 2004 |

Optimal covering tours with turn costs EM Arkin, MA Bender, ED Demaine, SP Fekete, JSB Mitchell, S Sethia SIAM Journal on Computing 35 (3), 531-566, 2005 | 145 | 2005 |

Minimum-cost coverage of point sets by disks H Alt, EM Arkin, H Brönnimann, J Erickson, SP Fekete, C Knauer, ... Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 133 | 2006 |

On local search for weighted k-set packing EM Arkin, R Hassin Mathematics of Operations Research 23 (3), 640-648, 1998 | 132 | 1998 |

Resource-constrained geometric network optimization EM Arkin, JSB Mitchell, G Narasimhan Proceedings of the fourteenth annual symposium on Computational geometry …, 1998 | 120 | 1998 |

Approximating the tree and tour covers of a graph EM Arkin, MM Halldórsson, R Hassin Information Processing Letters 47 (6), 275-282, 1993 | 100 | 1993 |

When can you fold a map? EM Arkin, MA Bender, ED Demaine, ML Demaine, JSB Mitchell, S Sethia, ... Computational Geometry 29 (1), 23-46, 2004 | 99 | 2004 |

On monotone paths among obstacles with applications to planning assemblies EM Arkin, R Connelly, JS Mitchell Proceedings of the fifth annual symposium on Computational geometry, 334-343, 1989 | 98 | 1989 |

Weighted-tardiness scheduling on parallel machines with proportional weights EM Arkin, RO Roundy Operations Research 39 (1), 64-81, 1991 | 97 | 1991 |

Decision trees for geometric models EM Arkin, H Meijer, JSB Mitchell, D Rappaport, SS Skiena Proceedings of the ninth annual symposium on Computational geometry, 369-378, 1993 | 95 | 1993 |

Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies VJ Leung, EM Arkin, MA Bender, D Bunde, J Johnston, A Lal, JSB Mitchell, ... Proceedings. IEEE International Conference on Cluster Computing, 296-304, 2002 | 90 | 2002 |

Optimization problems related to zigzag pocket machining EM Arkin, M Held, CL Smith Algorithmica 26 (2), 197-236, 2000 | 85 | 2000 |

The freeze-tag problem: how to wake up a swarm of robots EM Arkin, MA Bender, SP Fekete, JSB Mitchell, M Skutella Algorithmica 46, 193-221, 2006 | 71 | 2006 |