| 2009 |
|---|
| 85 | EE | Bernardo M. Ábrego,
Esther M. Arkin,
Silvia Fernández-Merchant,
Ferran Hurtado,
Mikio Kano,
Joseph S. B. Mitchell,
Jorge Urrutia:
Matching Points with Squares.
Discrete & Computational Geometry 41(1): 77-95 (2009) |
| 84 | EE | Esther M. Arkin,
Sang Won Bae,
Alon Efrat,
Kazuya Okamoto,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Geometric stable roommates.
Inf. Process. Lett. 109(4): 219-224 (2009) |
| 2008 |
|---|
| 83 | | Esther M. Arkin,
George Hart,
Joondong Kim,
Irina Kostitsyna,
Joseph S. B. Mitchell,
Girishkumar Sabhnani,
Steven Skiena:
The Embroidery Problem.
CCCG 2008 |
| 82 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Maximum thick paths in static and dynamic environments.
Symposium on Computational Geometry 2008: 20-27 |
| 81 | EE | Esther M. Arkin,
Refael Hassin:
The k-path tree matroid and its applications to survivable network design.
Discrete Optimization 5(2): 314-322 (2008) |
| 80 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Jack Snoeyink:
Capturing crossings: Convex hulls of segment and plane intersections.
Inf. Process. Lett. 107(5): 194-197 (2008) |
| 2007 |
|---|
| 79 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections.
CCCG 2007: 9-11 |
| 78 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Two New Classes of Hamiltonian Graphs: (Extended Abstract).
Electronic Notes in Discrete Mathematics 29: 565-569 (2007) |
| 2006 |
|---|
| 77 | EE | Valentin Polishchuk,
Esther M. Arkin,
Joseph S. B. Mitchell:
Hamiltonian Cycles in Triangular Grids.
CCCG 2006 |
| 76 | EE | Helmut Alt,
Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-cost coverage of point sets by disks.
Symposium on Computational Geometry 2006: 449-458 |
| 75 | EE | Esther M. Arkin,
Gill Barequet,
Joseph S. B. Mitchell:
Algorithms for two-box covering.
Symposium on Computational Geometry 2006: 459-467 |
| 74 | EE | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Valentin Polishchuk:
The Snowblower Problem.
WAFR 2006: 219-234 |
| 73 | EE | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
Algorithmica 46(2): 193-221 (2006) |
| 72 | EE | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Valentin Polishchuk:
The Snowblower Problem
CoRR abs/cs/0603026: (2006) |
| 71 | EE | Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks
CoRR abs/cs/0604008: (2006) |
| 70 | EE | Esther M. Arkin,
Ferran Hurtado,
Joseph S. B. Mitchell,
Carlos Seara,
Steven Skiena:
Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geometry Appl. 16(1): 1-26 (2006) |
| 69 | EE | Esther M. Arkin,
Refael Hassin,
Asaf Levin:
Approximations for minimum and min-max vehicle routing problems.
J. Algorithms 59(1): 1-18 (2006) |
| 2005 |
|---|
| 68 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs.
SIAM J. Comput. 35(3): 531-566 (2005) |
| 2004 |
|---|
| 67 | EE | Bernardo M. Ábrego,
Esther M. Arkin,
Silvia Fernández-Merchant,
Ferran Hurtado,
Mikio Kano,
Joseph S. B. Mitchell,
Jorge Urrutia:
Matching Points with Circles and Squares.
JCDCG 2004: 1-15 |
| 66 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica 39(2): 175-187 (2004) |
| 65 | EE | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
CoRR cs.DS/0402045: (2004) |
| 64 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When can you fold a map?
Comput. Geom. 29(1): 23-46 (2004) |
| 2003 |
|---|
| 63 | EE | Esther M. Arkin,
Michael A. Bender,
Dongdong Ge:
Improved approximation algorithms for the freeze-tag problem.
SPAA 2003: 295-303 |
| 62 | EE | Tien-Ruey Hsiang,
Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots.
Symposium on Computational Geometry 2003: 382-383 |
| 61 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs
CoRR cs.DS/0309014: (2003) |
| 60 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
An algorithmic study of manufacturing paperclips and other folded structures.
Comput. Geom. 25(1-2): 117-138 (2003) |
| 59 | EE | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat scheduling problem.
Inf. Comput. 184(1): 129-146 (2003) |
| 58 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Christine D. Piatko:
Minimum-link watchman tours.
Inf. Process. Lett. 86(4): 203-207 (2003) |
| 2002 |
|---|
| 57 | EE | 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:
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
CLUSTER 2002: 296-304 |
| 56 | EE | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots.
SODA 2002: 568-577 |
| 55 | EE | Marcelo O. Sztainberg,
Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell:
Analysis of Heuristics for the Freeze-Tag Problem.
SWAT 2002: 270-279 |
| 54 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT 2002: 280-287 |
| 53 | EE | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
CoRR cs.CG/0209034: (2002) |
| 52 | EE | Esther M. Arkin,
Sándor P. Fekete,
Ferran Hurtado,
Joseph S. B. Mitchell,
Marc Noy,
Vera Sacristan,
Saurabh Sethia:
On the Reflexivity of Point Sets
CoRR cs.CG/0210003: (2002) |
| 51 | EE | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat Scheduling Problem
CoRR cs.DS/0210024: (2002) |
| 50 | EE | Tien-Ruey Hsiang,
Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments
CoRR cs.RO/0212022: (2002) |
| 49 | | Esther M. Arkin,
Refael Hassin:
A note on orientations of mixed graphs.
Discrete Applied Mathematics 116(3): 271-278 (2002) |
| 48 | | Esther M. Arkin,
Refael Hassin,
Shimon Shahar:
Increasing digraph arc-connectivity by arc addition, reversal and complement.
Discrete Applied Mathematics 122(1-3): 13-22 (2002) |
| 2001 |
|---|
| 47 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal covering tours with turn costs.
SODA 2001: 138-147 |
| 46 | EE | Esther M. Arkin,
Sándor P. Fekete,
Ferran Hurtado,
Joseph S. B. Mitchell,
Marc Noy,
Vera Sacristan,
Saurabh Sethia:
On the Reflexivity of Point Sets.
WADS 2001: 192-204 |
| 45 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
WADS 2001: 401-413 |
| 44 | EE | Esther M. Arkin,
Refael Hassin,
Maxim Sviridenko:
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett. 77(1): 13-16 (2001) |
| 2000 |
|---|
| 43 | | Esther M. Arkin,
Ferran Hurtado,
Joseph S. B. Mitchell,
Carlos Seara,
Steven Skiena:
Some Separability Problems in the Plane.
EWCG 2000: 51-54 |
| 42 | EE | Esther M. Arkin,
Refael Hassin:
Approximating the maximum quadratic assignment problem.
SODA 2000: 889-890 |
| 41 | EE | Esther M. Arkin,
Martin Held,
Christopher L. Smith:
Optimization Problems Related to Zigzag Pocket Machining.
Algorithmica 26(2): 197-236 (2000) |
| 40 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
CoRR cs.CG/0011026: (2000) |
| 39 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Approximation algorithms for lawn mowing and milling.
Comput. Geom. 17(1-2): 25-50 (2000) |
| 38 | EE | Martin Held,
Esther M. Arkin:
Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining.
Computer-Aided Design 32(10): 617-619 (2000) |
| 37 | EE | Esther M. Arkin,
Refael Hassin:
Minimum-diameter covering problems.
Networks 36(3): 147-155 (2000) |
| 1999 |
|---|
| 36 | EE | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat Scheduling Problem.
WADS 1999: 122-133 |
| 35 | | Esther M. Arkin,
Yi-Jen Chiang,
Joseph S. B. Mitchell,
Steven Skiena,
Tae-Cheon Yang:
On the Maximum Scatter Traveling Salesperson Problem.
SIAM J. Comput. 29(2): 515-544 (1999) |
| 1998 |
|---|
| 34 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Giri Narasimhan:
Resource-Constrained Geometric Network Optimization.
Symposium on Computational Geometry 1998: 307-316 |
| 33 | | Esther M. Arkin,
Yi-Jen Chiang,
Martin Held,
Joseph S. B. Mitchell,
Vera Sacristan,
Steven Skiena,
Tae-Heng Yang:
On Minimum-Area Hulls.
Algorithmica 21(1): 119-136 (1998) |
| 32 | | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Recognizing polygonal parts from width measurements.
Comput. Geom. 9(4): 237-246 (1998) |
| 31 | EE | Esther M. Arkin,
Refael Hassin:
Graph partitions with minimum degree constraints.
Discrete Mathematics 190(1-3): 55-65 (1998) |
| 30 | | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision trees for geometric models.
Int. J. Comput. Geometry Appl. 8(3): 343-364 (1998) |
| 1997 |
|---|
| 29 | | Esther M. Arkin,
Refael Hassin:
On Local Search for Weighted k-Set Packing.
ESA 1997: 13-22 |
| 28 | | Esther M. Arkin,
Yi-Jen Chiang,
Joseph S. B. Mitchell,
Steven Skiena,
Tae-Cheon Yang:
On the Maximum Scatter TSP (Extended Abstract).
SODA 1997: 211-220 |
| 27 | EE | George N. Sazaklis,
Esther M. Arkin,
Joseph S. B. Mitchell,
Steven Skiena:
Geometric Decision Trees for Optical Character Recognition (Extended Abstract).
Symposium on Computational Geometry 1997: 394-396 |
| 26 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
Comput. Geom. 8: 97-114 (1997) |
| 25 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Steven Skiena:
Guest Editors' Foreword.
Int. J. Comput. Geometry Appl. 7(1/2): 1- (1997) |
| 24 | EE | Esther M. Arkin,
Refael Hassin,
Limor Klein:
Restricted delivery problems on a network.
Networks 29(4): 205-216 (1997) |
| 1996 |
|---|
| 23 | | Esther M. Arkin,
Yi-Jen Chiang,
Martin Held,
Joseph S. B. Mitchell,
Vera Sacristan,
Steven Skiena,
Tae-Heng Yang:
On Minimum-Area Hulls (Extended Abstract).
ESA 1996: 334-348 |
| 22 | | Esther M. Arkin,
Martin Held,
Christopher L. Smith:
Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract).
SODA 1996: 419-428 |
| 21 | EE | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Hamiltonian triangulations for fast rendering.
The Visual Computer 12(9): 429-444 (1996) |
| 1995 |
|---|
| 20 | | Esther M. Arkin,
Dan Halperin,
Klara Kedem,
Joseph S. B. Mitchell,
Nir Naor:
Arrangements of Segments that Share Endpoints Single Face Results.
Discrete & Computational Geometry 13: 257-270 (1995) |
| 19 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Subhash Suri:
Logarithmic-time link path queries in a simple polygon.
Int. J. Comput. Geometry Appl. 5(4): 369-395 (1995) |
| 1994 |
|---|
| 18 | | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Hamilton Triangulations for Fast Rendering.
ESA 1994: 36-47 |
| 17 | EE | Esther M. Arkin,
Refael Hassin:
Approximation Algorithms for the Geometric Covering Salesman Problem.
Discrete Applied Mathematics 55(3): 197-218 (1994) |
| 1993 |
|---|
| 16 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
CCCG 1993: 387 |
| 15 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
The Lawnmower Problem.
CCCG 1993: 461-466 |
| 14 | EE | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision Trees for Geometric Models.
Symposium on Computational Geometry 1993: 369-378 |
| 13 | | Esther M. Arkin,
Michael T. Goodrich,
Joseph S. B. Mitchell,
David M. Mount,
Christine D. Piatko,
Steven Skiena:
Point Probe Decision Trees for Geometric Concept Classes.
WADS 1993: 95-106 |
| 12 | | Esther M. Arkin,
Samir Khuller,
Joseph S. B. Mitchell:
Geometric Knapsack Problems.
Algorithmica 10(5): 399-427 (1993) |
| 11 | | Esther M. Arkin,
Magnús M. Halldórsson,
Refael Hassin:
Approximating the Tree and Tour Covers of a Graph.
Inf. Process. Lett. 47(6): 275-282 (1993) |
| 1992 |
|---|
| 10 | | Joseph S. B. Mitchell,
Christine D. Piatko,
Esther M. Arkin:
Computing a Shortest k-Link Path in a Polygon
FOCS 1992: 573-582 |
| 9 | EE | Esther M. Arkin,
Joseph S. B. Mitchell,
Subhash Suri:
Optimal Link Path Queries in a Simple Polygon.
SODA 1992: 269-279 |
| 1991 |
|---|
| 8 | | Esther M. Arkin,
Klara Kedem,
Joseph S. B. Mitchell,
Josef Sprinzak,
Michael Werman:
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms.
SODA 1991: 42-51 |
| 7 | EE | Esther M. Arkin,
Dan Halperin,
Klara Kedem,
Joseph S. B. Mitchell,
Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results.
Symposium on Computational Geometry 1991: 324-333 |
| 6 | | Esther M. Arkin,
Samir Khuller,
Joseph S. B. Mitchell:
Geometric Knapsack Problems.
WADS 1991: 165-176 |
| 5 | EE | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) |
| 4 | EE | Esther M. Arkin,
Christos H. Papadimitriou,
Mihalis Yannakakis:
Modularity of Cycles and Paths in Graphs.
J. ACM 38(2): 255-274 (1991) |
| 1990 |
|---|
| 3 | | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
SODA 1990: 129-137 |
| 1989 |
|---|
| 2 | EE | Esther M. Arkin,
Robert Connelly,
Joseph S. B. Mitchell:
On Monotone Paths Among Obstacles with Applications to Planning Assemblies.
Symposium on Computational Geometry 1989: 334-343 |
| 1986 |
|---|
| 1 | | Esther M. Arkin,
Christos H. Papadimitriou:
On the Complexity of Circulations.
J. Algorithms 7(1): 134-145 (1986) |
