On the Complexity of Circulations. - Esther M. Arkin; Christos H. Papadimitriou (J. Algorithms, 1986)

Scheduling jobs with fixed start and end times. - Esther M. Arkin; Ellen B. Silverberg (Discret. Appl. Math., 1987)

On Monotone Paths Among Obstacles with Applications to Planning Assemblies. - Esther M. Arkin; Robert Connelly; Joseph S. B. Mitchell (SCG, 1989)

Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. - Esther M. Arkin; Klara Kedem; Joseph S. B. Mitchell; Josef Sprinzak; Michael Werman (SODA, 1991)

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights. - Esther M. Arkin; Robin O. Roundy (Oper. Res., 1991)

Modularity of Cycles and Paths in Graphs. - Esther M. Arkin; Christos H. Papadimitriou; Mihalis Yannakakis (J. ACM, 1991)

An Efficiently Computable Metric for Comparing Polygonal Shapes. - Esther M. Arkin; L. Paul Chew; Daniel P. Huttenlocher; Klara Kedem; Joseph S. B. Mitchell (IEEE Trans. Pattern Anal. Mach. Intell., 1991)

Computing a Shortest k-Link Path in a Polygon - Joseph S. B. Mitchell; Christine D. Piatko; Esther M. Arkin (FOCS, 1992)

Optimal Link Path Queries in a Simple Polygon. - Esther M. Arkin; Joseph S. B. Mitchell; Subhash Suri (SODA, 1992)

Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms. - Esther M. Arkin; Klara Kedem; Joseph S. B. Mitchell; Josef Sprinzak; Michael Werman (INFORMS J. Comput., 1992)

The Lawnmower Problem. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (CCCG, 1993)

Point Probe Decision Trees for Geometric Concept Classes. - Esther M. Arkin; Michael T. Goodrich; Joseph S. B. Mitchell; David M. Mount; Christine D. Piatko; Steven Skiena (WADS, 1993)

Geometric Knapsack Problems. - Esther M. Arkin; Samir Khuller; Joseph S. B. Mitchell (Algorithmica, 1993)

Approximating the Tree and Tour Covers of a Graph. - Esther M. Arkin; Magnús M. Halldórsson; Refael Hassin (Inf. Process. Lett., 1993)

Hamilton Triangulations for Fast Rendering. - Esther M. Arkin; Martin Held; Joseph S. B. Mitchell; Steven Skiena (ESA, 1994)

Approximation Algorithms for the Geometric Covering Salesman Problem. - Esther M. Arkin; Refael Hassin (Discret. Appl. Math., 1994)

Arrangements of Segments that Share Endpoints Single Face Results. - Esther M. Arkin; Dan Halperin; Klara Kedem; Joseph S. B. Mitchell; Nir Naor (Discret. Comput. Geom., 1995)

Logarithmic-time link path queries in a simple polygon. - Esther M. Arkin; Joseph S. B. Mitchell; Subhash Suri (Int. J. Comput. Geom. Appl., 1995)

On Minimum-Area Hulls (Extended Abstract). - Esther M. Arkin; Yi-Jen Chiang; Martin Held; Joseph S. B. Mitchell; Vera Sacristán; Steven Skiena; Tae-Heng Yang (ESA, 1996)

Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract). - Esther M. Arkin; Martin Held; Christopher L. Smith (SODA, 1996)

Hamiltonian triangulations for fast rendering. - Esther M. Arkin; Martin Held; Joseph S. B. Mitchell; Steven Skiena (Vis. Comput., 1996)

Geometric Decision Trees for Optical Character Recognition (Extended Abstract). - George N. Sazaklis; Esther M. Arkin; Joseph S. B. Mitchell; Steven Skiena (SCG, 1997)

On Local Search for Weighted k-Set Packing. - Esther M. Arkin; Refael Hassin (ESA, 1997)

On the Maximum Scatter TSP (Extended Abstract). - Esther M. Arkin; Yi-Jen Chiang; Joseph S. B. Mitchell; Steven Skiena; Tae-Cheon Yang (SODA, 1997)

Testing Simple Polygons. - Esther M. Arkin; Patrice Belleville; Joseph S. B. Mitchell; David M. Mount; Kathleen Romanik; Steven Salzberg; Diane L. Souvaine (Comput. Geom., 1997)

Guest Editors' Foreword. - Esther M. Arkin; Joseph S. B. Mitchell; Steven Skiena (Int. J. Comput. Geom. Appl., 1997)

Restricted delivery problems on a network. - Esther M. Arkin; Refael Hassin; Limor Klein (Networks, 1997)

Resource-Constrained Geometric Network Optimization. - Esther M. Arkin; Joseph S. B. Mitchell; Giri Narasimhan (SCG, 1998)

On Minimum-Area Hulls. - Esther M. Arkin; Yi-Jen Chiang; Martin Held; Joseph S. B. Mitchell; Vera Sacristán; Steven Skiena; Tae-Heng Yang (Algorithmica, 1998)

Recognizing polygonal parts from width measurements. - Esther M. Arkin; Martin Held; Joseph S. B. Mitchell; Steven Skiena (Comput. Geom., 1998)

Graph partitions with minimum degree constraints. - Esther M. Arkin; Refael Hassin (Discret. Math., 1998)

Decision trees for geometric models. - Esther M. Arkin; Henk Meijer; Joseph S. B. Mitchell; David Rappaport; Steven Skiena (Int. J. Comput. Geom. Appl., 1998)

On Local Search for Weighted k-Set Packing. - Esther M. Arkin; Refael Hassin (Math. Oper. Res., 1998)

On the Maximum Scatter Traveling Salesperson Problem. - Esther M. Arkin; Yi-Jen Chiang; Joseph S. B. Mitchell; Steven Skiena; Tae-Cheon Yang (SIAM J. Comput., 1999)

Some Separability Problems in the Plane. - Esther M. Arkin; Ferran Hurtado; Joseph S. B. Mitchell; Carlos Seara; Steven Skiena (EuroCG, 2000)

Approximating the maximum quadratic assignment problem. - Esther M. Arkin; Refael Hassin (SODA, 2000)

Optimization Problems Related to Zigzag Pocket Machining. - Esther M. Arkin; Martin Held; Christopher L. Smith (Algorithmica, 2000)

Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining. - Martin Held; Esther M. Arkin (Comput. Aided Des., 2000)

Approximation algorithms for lawn mowing and milling. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (Comput. Geom., 2000)

Minimum-diameter covering problems. - Esther M. Arkin; Refael Hassin (Networks, 2000)

On the Reflexivity of Point Sets. - Esther M. Arkin; Sándor P. Fekete; Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy; Vera Sacristán; Saurabh Sethia (WADS, 2001)

Approximating the maximum quadratic assignment problem. - Esther M. Arkin; Refael Hassin; Maxim Sviridenko (Inf. Process. Lett., 2001)

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. - Vitus J. Leung; Esther M. Arkin; Michael A. Bender; David P. Bunde; Jeanette Johnston; Alok Lal; Joseph S. B. Mitchell; Cynthia A. Phillips; Steven S. Seiden (CLUSTER, 2002)

The freeze-tag problem: how to wake up a swarm of robots. - Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell; Martin Skutella (SODA, 2002)

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. - Esther M. Arkin; Refael Hassin; Shlomi Rubinstein; Maxim Sviridenko (SWAT, 2002)

Analysis of Heuristics for the Freeze-Tag Problem. - Marcelo O. Sztainberg; Esther M. Arkin; Michael A. Bender; Joseph S. B. Mitchell (SWAT, 2002)

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. - Tien-Ruey Hsiang; Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell (WAFR, 2002)

A note on orientations of mixed graphs. - Esther M. Arkin; Refael Hassin (Discret. Appl. Math., 2002)

Increasing digraph arc-connectivity by arc addition, reversal and complement. - Esther M. Arkin; Refael Hassin; Shimon Shahar (Discret. Appl. Math., 2002)

Online dispersion algorithms for swarms of robots. - Tien-Ruey Hsiang; Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell (SCG, 2003)

Improved approximation algorithms for the freeze-tag problem. - Esther M. Arkin; Michael A. Bender; Dongdong Ge (SPAA, 2003)

An algorithmic study of manufacturing paperclips and other folded structures. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (Comput. Geom., 2003)

The Lazy Bureaucrat scheduling problem. - Esther M. Arkin; Michael A. Bender; Joseph S. B. Mitchell; Steven Skiena (Inf. Comput., 2003)

Minimum-link watchman tours. - Esther M. Arkin; Joseph S. B. Mitchell; Christine D. Piatko (Inf. Process. Lett., 2003)

Matching Points with Circles and Squares. - Bernardo M. Ábrego; Esther M. Arkin; Silvia Fernández-Merchant; Ferran Hurtado; Mikio Kano; Joseph S. B. Mitchell; Jorge Urrutia (JCDCG, 2004)

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. - Esther M. Arkin; Refael Hassin; Shlomi Rubinstein; Maxim Sviridenko (Algorithmica, 2004)

When can you fold a map? - Esther M. Arkin; Michael A. Bender; Erik D. Demaine; Martin L. Demaine; Joseph S. B. Mitchell; Saurabh Sethia; Steven Skiena (Comput. Geom., 2004)

Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. - Marcelo O. Sztainberg; Esther M. Arkin; Michael A. Bender; Joseph S. B. Mitchell (IEEE Trans. Robotics, 2004)

Optimal Covering Tours with Turn Costs. - Esther M. Arkin; Michael A. Bender; Erik D. Demaine; Sándor P. Fekete; Joseph S. B. Mitchell; Saurabh Sethia (SIAM J. Comput., 2005)

Hamiltonian Cycles in Triangular Grids. - Valentin Polishchuk; Esther M. Arkin; Joseph S. B. Mitchell (CCCG, 2006)

Minimum-cost coverage of point sets by disks. - Helmut Alt; Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (SCG, 2006)

Algorithms for two-box covering. - Esther M. Arkin; Gill Barequet; Joseph S. B. Mitchell (SCG, 2006)

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. - Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell; Martin Skutella (Algorithmica, 2006)

Minimum-Cost Coverage of Point Sets by Disks - Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (CoRR, 2006)

Some Lower Bounds on Geometric Separability Problems. - Esther M. Arkin; Ferran Hurtado; Joseph S. B. Mitchell; Carlos Seara; Steven Skiena (Int. J. Comput. Geom. Appl., 2006)

Approximations for minimum and min-max vehicle routing problems. - Esther M. Arkin; Refael Hassin; Asaf Levin (J. Algorithms, 2006)

Two New Classes of Hamiltonian Graphs: (Extended Abstract). - Esther M. Arkin; Joseph S. B. Mitchell; Valentin Polishchuk (Electron. Notes Discret. Math., 2007)

The Embroidery Problem. - Esther M. Arkin; George Hart; Joondong Kim; Irina Kostitsyna; Joseph S. B. Mitchell; Girishkumar Sabhnani; Steven Skiena (CCCG, 2008)

The k-path tree matroid and its applications to survivable network design. - Esther M. Arkin; Refael Hassin (Discret. Optim., 2008)

Capturing crossings: Convex hulls of segment and plane intersections. - Esther M. Arkin; Joseph S. B. Mitchell; Jack Snoeyink (Inf. Process. Lett., 2008)

Not being (super)thin or solid is hard: A study of grid Hamiltonicity. - Esther M. Arkin; Sándor P. Fekete; Kamrul Islam 001; Henk Meijer; Joseph S. B. Mitchell; Yurai Núñez Rodríguez; Valentin Polishchuk; David Rappaport; Henry Xiao (Comput. Geom., 2009)

Matching Points with Squares. - Bernardo M. Ábrego; Esther M. Arkin; Silvia Fernández-Merchant; Ferran Hurtado; Mikio Kano; Joseph S. B. Mitchell; Jorge Urrutia (Discret. Comput. Geom., 2009)

Geometric stable roommates. - Esther M. Arkin; Sang Won Bae 001; Alon Efrat; Kazuya Okamoto; Joseph S. B. Mitchell; Valentin Polishchuk (Inf. Process. Lett., 2009)

The (K, k)-Capacitated Spanning Tree Problem. - Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin (AAIM, 2010)

Data transmission and base-station placement for optimizing network lifetime. - Esther M. Arkin; Valentin Polishchuk; Alon Efrat; Srinivasan Ramasubramanian; Javad Taheri; Joseph S. B. Mitchell; Swaminathan Sankararaman (DIALM-PODC, 2010)

Maximum thick paths in static and dynamic environments. - Esther M. Arkin; Joseph S. B. Mitchell; Valentin Polishchuk (Comput. Geom., 2010)

The snowblower problem. - Esther M. Arkin; Michael A. Bender; Joseph S. B. Mitchell; Valentin Polishchuk (Comput. Geom., 2011)

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box. - Esther M. Arkin; Alon Efrat; George Hart; Irina Kostitsyna; Alexander Kröller; Joseph S. B. Mitchell; Valentin Polishchuk (FUN, 2012)

The (K, k)-capacitated spanning tree problem. - Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin (Discret. Optim., 2012)

Separability of Point Sets by k-Level Linear Classification Trees. - Esther M. Arkin; Delia Garijo; Alberto Márquez 001; Joseph S. B. Mitchell; Carlos Seara (Int. J. Comput. Geom. Appl., 2012)

Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks. - Esther M. Arkin; Alon Efrat; Joseph S. B. Mitchell; Valentin Polishchuk; Srinivasan Ramasubramanian; Swaminathan Sankararaman; Javad Taheri (Ad Hoc Networks, 2014)

Convex transversals. - Esther M. Arkin; Claudia Dieckmann; Christian Knauer; Joseph S. B. Mitchell; Valentin Polishchuk; Lena Schlipf; Shang Yang (Comput. Geom., 2014)

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. - Helmut Alt; Esther M. Arkin; Alon Efrat; George Hart; Ferran Hurtado; Irina Kostitsyna; Alexander Kröller; Joseph S. B. Mitchell; Valentin Polishchuk (Theory Comput. Syst., 2014)

Conflict-free Covering. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (CCCG, 2015)

Optimal placement of protective jammers for securing wireless transmissions in a geographic domain. - Esther M. Arkin; Yuval Cassuto; Alon Efrat; Guy Grebla; Joseph S. B. Mitchell; Swaminathan Sankararaman; Michael Segal 001 (IPSN, 2015)

Choice Is Hard. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (ISAAC, 2015)

Optimizing Read Reversals for Sequence Compression - (Extended Abstract). - Zhong Sichen; Lu Zhao; Yan Liang; Mohammadzaman Zamani; Rob Patro; Rezaul Chowdhury; Esther M. Arkin; Joseph S. B. Mitchell; Steven Skiena (WABI, 2015)

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. - Esther M. Arkin; Antonio Fernández Anta; Joseph S. B. Mitchell; Miguel A. Mosteiro (Comput. Geom., 2015)

Bichromatic 2-center of pairs of points. - Esther M. Arkin; José Miguel Díaz-Báñez; Ferran Hurtado; Piyush Kumar; Joseph S. B. Mitchell; Belén Palop; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira (Comput. Geom., 2015)

The Shortest Separating Cycle Problem. - Esther M. Arkin; Jie Gao 001; Adam Hesterberg; Joseph S. B. Mitchell; Jiemin Zeng (WAOA, 2016)

Shortest path to a segment and quickest visibility queries. - Valentin Polishchuk; Esther M. Arkin; Alon Efrat; Christian Knauer; Joseph S. B. Mitchell; Günter Rote; Lena Schlipf; Topi Talvitie (J. Comput. Geom., 2016)

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. - Kin Sum Liu; Tyler Mayer; Hao-Tsung Yang; Esther M. Arkin; Jie Gao 001; Mayank Goswami 001; Matthew P. Johnson 001; Nirman Kumar; Shan Lin 001 (INFOCOM, 2017)

Network Optimization on Partitioned Pairs of Points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Su Jia; Matthew J. Katz; Tyler Mayer; Joseph S. B. Mitchell (ISAAC, 2017)

Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity. - Jiemin Zeng; Gaurish Telang; Matthew P. Johnson 001; Rik Sarkar; Jie Gao 001; Esther M. Arkin; Joseph S. B. Mitchell (MobiHoc, 2017)

Secure communication through jammers jointly optimized in geography and time. - Yair Allouche; Esther M. Arkin; Yuval Cassuto; Alon Efrat; Guy Grebla; Joseph S. B. Mitchell; Swaminathan Sankararaman; Michael Segal 001 (Pervasive Mob. Comput., 2017)

Selecting and covering colored points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (Discret. Appl. Math., 2018)

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. - Rathish Das; Shih-Yu Tsai; Sharmila Duppala; Jayson Lynch; Esther M. Arkin; Rezaul Chowdhury; Joseph S. B. Mitchell; Steven Skiena (SPAA, 2019)

Locating battery charging stations to facilitate almost shortest paths. - Esther M. Arkin; Paz Carmi; Matthew J. Katz; Joseph S. B. Mitchell; Michael Segal 001 (Discret. Appl. Math., 2019)

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. - Esther M. Arkin; Rathish Das; Jie Gao 001; Mayank Goswami 001; Joseph S. B. Mitchell; Valentin Polishchuk; Csaba D. Tóth (ESA, 2020)

Data inference from encrypted databases: a multi-dimensional order-preserving matching approach. - Yanjun Pan 001; Alon Efrat; Ming Li 003; Boyang Wang; Hanyu Quan; Joseph S. B. Mitchell; Jie Gao 001; Esther M. Arkin (MobiHoc, 2020)

Computing β-Stretch Paths in Drawings of Graphs. - Esther M. Arkin; Faryad Darabi Sahneh; Alon Efrat; Fabian Frank; Radoslav Fulek; Stephen G. Kobourov; Joseph S. B. Mitchell (SWAT, 2020)

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. - Hugo A. Akitaya; Esther M. Arkin; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Matias Korman; Belén Palop; Irene Parada; André van Renssen; Vera Sacristán (Algorithmica, 2021)

Fair subgraph selection for contagion containment (Brief Announcement). - Esther M. Arkin; Rezaul Alam Chowdhury; Mayank Goswami 001; Jason Huang; Joseph S. B. Mitchell; Valentin Polishchuk; Rakesh Ravindran (LAGOS, 2023)