Esther M. Arkin
Impact in
-
- Computational Geometry and Mesh Generation
-
- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
- Scheduling and Optimization Algorithms
Papers in
-
- Computational Geometry and Mesh Generation 51
-
- Optimization and Packing Problems 20
- Vehicle Routing Optimization Methods 10
- Co-authors
- Joseph S. B. MitchellRefael HassinKlara KedemL. Paul ChewSándor P. FeketeR. RoundyD.P. HuttenlocherSteven Skiena
- Journals
- Computational Geometry (11 papers)Discrete Applied Mathematics (6 papers)Algorithmica (5 papers)Networks (3 papers)Discrete & Computational Geometry (2 papers)
- Partner nations
- United StatesIsraelFinland
In The Last Decade
Esther M. Arkin
95 papers receiving 2.3k citations
Peers
Comparison fields: 5 of 114
- Computer Graphics and Computer-Aided Design 517
- Industrial and Manufacturing Engineering 779
- Computer Vision and Pattern Recognition 831
- Computer Networks and Communications 660
- Computational Theory and Mathematics 393
Countries citing papers authored by Esther M. Arkin
This map shows the geographic impact of Esther M. Arkin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Esther M. Arkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Esther M. Arkin more than expected).
Fields of papers citing papers by Esther M. Arkin
This network shows the impact of papers produced by Esther M. Arkin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Esther M. Arkin. The network helps show where Esther M. Arkin may publish in the future.
Co-authors
The 25 scholars most cited alongside Esther M. Arkin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 4 | |
| 2 | 2019 | 1 | |
| 3 | 2007 | 2 | |
| 4 | Hamiltonian Cycles in Triangular Grids. | 2006 | 3 |
| 5 | Shortest Tour of a Sequence of Disjoint Segments in L1 | 2006 | 0 |
| 6 | 2004 | 25 | |
| 7 | 2003 | 11 | |
| 8 | 2002 | 13 | |
| 9 | 2002 | 1 | |
| 10 | 2002 | 11 | |
| 11 | 2001 | 17 | |
| 12 | 2000 | 178 | |
| 13 | Some Separability Problems in the Plane. | 2000 | 4 |
| 14 | 1997 | 4 | |
| 15 | 1997 | 2 | |
| 16 | 1996 | 6 | |
| 17 | The Lawnmower Problem. | 1993 | 20 |
| 18 | Optimal link path queries in a simple polygon | 1992 | 12 |
| 19 | 1991 | 14 | |
| 20 | 1990 | 58 |
About Esther M. Arkin
Esther M. Arkin is a scholar working on Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering, Computer Vision and Pattern Recognition, Computational Theory and Mathematics and Computer Networks and Communications, having authored 99 papers that have together received 2.5k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (51 papers), Optimization and Packing Problems (20 papers), Robotic Path Planning Algorithms (18 papers), Optimization and Search Problems (17 papers), Advanced Graph Theory Research (15 papers), Complexity and Algorithms in Graphs (12 papers), Vehicle Routing Optimization Methods (10 papers) and Graph Theory and Algorithms (8 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (517 citations), Industrial and Manufacturing Engineering (779 citations), Computer Vision and Pattern Recognition (831 citations), Computer Networks and Communications (660 citations) and Computational Theory and Mathematics (393 citations). Esther M. Arkin has collaborated with scholars based in United States, Israel and Finland. Frequent co-authors include Joseph S. B. Mitchell, Refael Hassin, Klara Kedem, L. Paul Chew, Sándor P. Fekete, R. Roundy, D.P. Huttenlocher, Steven Skiena, Martin Held and Asaf Levin. Their work appears in journals such as Computational Geometry, Discrete Applied Mathematics, Algorithmica, Networks and Discrete & Computational Geometry.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.