The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Esther M. Arkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (1, 0)][DBLP]
    SODA, 1990, pp:129-137 [Conf]
  2. Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis
    Modularity of Cycles and Paths in Graphs. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:255-274 [Journal]
  3. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:387- [Conf]
  4. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    The Lawnmower Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:461-466 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2002, pp:296-304 [Conf]
  6. Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell
    Algorithms for two-box covering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:459-467 [Conf]
  7. Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell
    On Monotone Paths Among Obstacles with Applications to Planning Assemblies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:334-343 [Conf]
  8. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints: Single Face Results. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:324-333 [Conf]
  9. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
    Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:369-378 [Conf]
  10. Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan
    Resource-Constrained Geometric Network Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:307-316 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  12. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Online dispersion algorithms for swarms of robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:382-383 [Conf]
  13. George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena
    Geometric Decision Trees for Optical Character Recognition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:394-396 [Conf]
  14. 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). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:334-348 [Conf]
  15. Esther M. Arkin, Refael Hassin
    On Local Search for Weighted k-Set Packing. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:13-22 [Conf]
  16. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Hamilton Triangulations for Fast Rendering. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:36-47 [Conf]
  17. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Separability Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:51-54 [Conf]
  18. Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin
    Computing a Shortest k-Link Path in a Polygon [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:573-582 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:1-15 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:138-147 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:568-577 [Conf]
  22. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang
    On the Maximum Scatter TSP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:211-220 [Conf]
  23. Esther M. Arkin, Refael Hassin
    Approximating the maximum quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:889-890 [Conf]
  24. Esther M. Arkin, Martin Held, Christopher L. Smith
    Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:419-428 [Conf]
  25. Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman
    Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:42-51 [Conf]
  26. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Optimal Link Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:269-279 [Conf]
  27. Esther M. Arkin, Michael A. Bender, Dongdong Ge
    Improved approximation algorithms for the freeze-tag problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:295-303 [Conf]
  28. Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
    Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:280-287 [Conf]
  29. Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell
    Analysis of Heuristics for the Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:270-279 [Conf]
  30. 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? [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:401-413 [Conf]
  31. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:122-133 [Conf]
  32. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:192-204 [Conf]
  33. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:95-106 [Conf]
  34. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:165-176 [Conf]
  35. Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
    Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:2, pp:175-187 [Journal]
  36. Esther M. Arkin, Martin Held, Christopher L. Smith
    Optimization Problems Related to Zigzag Pocket Machining. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:197-236 [Journal]
  37. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:5, pp:399-427 [Journal]
  38. Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang
    On Minimum-Area Hulls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:119-136 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:193-221 [Journal]
  40. Martin Held, Esther M. Arkin
    Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2000, v:32, n:10, pp:617-619 [Journal]
  41. 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? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:23-46 [Journal]
  42. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal]
  43. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    Approximation algorithms for lawn mowing and milling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:25-50 [Journal]
  44. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An algorithmic study of manufacturing paperclips and other folded structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:117-138 [Journal]
  45. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Recognizing polygonal parts from width measurements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:4, pp:237-246 [Journal]
  46. 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? [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  47. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  48. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  51. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  52. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  53. Esther M. Arkin, Refael Hassin
    A note on orientations of mixed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:3, pp:271-278 [Journal]
  54. Esther M. Arkin, Refael Hassin
    Approximation Algorithms for the Geometric Covering Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:3, pp:197-218 [Journal]
  55. Esther M. Arkin, Refael Hassin, Shimon Shahar
    Increasing digraph arc-connectivity by arc addition, reversal and complement. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:13-22 [Journal]
  56. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints Single Face Results. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:257-270 [Journal]
  57. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat scheduling problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:129-146 [Journal]
  58. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Lower Bounds on Geometric Separability Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:1, pp:1-26 [Journal]
  59. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
    Decision trees for geometric models. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:343-364 [Journal]
  60. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Logarithmic-time link path queries in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:369-395 [Journal]
  61. Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:1-0 [Journal]
  62. Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin
    Approximating the Tree and Tour Covers of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:6, pp:275-282 [Journal]
  63. Esther M. Arkin, Refael Hassin, Maxim Sviridenko
    Approximating the maximum quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:13-16 [Journal]
  64. Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko
    Minimum-link watchman tours. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:4, pp:203-207 [Journal]
  65. Esther M. Arkin, Refael Hassin, Asaf Levin
    Approximations for minimum and min-max vehicle routing problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:1, pp:1-18 [Journal]
  66. Esther M. Arkin, Christos H. Papadimitriou
    On the Complexity of Circulations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:134-145 [Journal]
  67. Esther M. Arkin, Refael Hassin
    Minimum-diameter covering problems. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:3, pp:147-155 [Journal]
  68. Esther M. Arkin, Refael Hassin, Limor Klein
    Restricted delivery problems on a network. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:205-216 [Journal]
  69. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:3, pp:209-216 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
  71. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang
    On the Maximum Scatter Traveling Salesperson Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:515-544 [Journal]
  72. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Hamiltonian triangulations for fast rendering. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1996, v:12, n:9, pp:429-444 [Journal]
  73. Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell
    Hamiltonian Cycles in Triangular Grids. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  74. Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
    Capturing Crossings: Convex Hulls of Segment and Plane Intersections. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:9-11 [Conf]
  75. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk
    The Snowblower Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  76. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  77. Esther M. Arkin, Refael Hassin
    Graph partitions with minimum degree constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:55-65 [Journal]

  78. The (K, k)-Capacitated Spanning Tree Problem. [Citation Graph (, )][DBLP]


  79. The Embroidery Problem. [Citation Graph (, )][DBLP]


  80. Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]


  81. Data transmission and base-station placement for optimizing network lifetime. [Citation Graph (, )][DBLP]


  82. The Snowblower Problem. [Citation Graph (, )][DBLP]


  83. Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP]


  84. Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]


  85. Matching Points with Squares. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002