Esther Arkin | Academic Influence

Esther Arkin's AcademicInfluence.com Rankings

Esther Arkin

Mathematics

#3676

World Rank

#5381

Historical Rank

Operations Research

#86

World Rank

#88

Historical Rank

Measure Theory

#3190

World Rank

#3777

Historical Rank

mathematics Degrees

Esther Arkin

Computer Science

#5573

World Rank

#5886

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Esther Arkin's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Esther Arkin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Esther M. Arkin is an Israeli–American mathematician and computer scientist whose research interests include operations research, computational geometry, combinatorial optimization, and the design and analysis of algorithms. She is a professor of applied mathematics and statistics at Stony Brook University. At Stony Brook, she also directs the undergraduate program in applied mathematics and statistics, and is an affiliated faculty member with the department of computer science.

(See a Problem?)

Esther Arkin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An efficiently computable metric for comparing polygonal shapes (1991) (794)
Approximation Algorithms for the Geometric Covering Salesman Problem (1994) (325)
Scheduling jobs with fixed start and end times (1987) (302)
Computational complexity of uncapacitated multi-echelon production planning problems (1989) (281)
Approximation algorithms for lawn mowing and milling (2000) (250)
Approximations for minimum and min-max vehicle routing problems (2006) (141)
On Local Search for Weighted k-Set Packing (1997) (126)
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments (2002) (123)
Optimal covering tours with turn costs (2001) (119)
Minimum-cost coverage of point sets by disks (2006) (98)
Resource-constrained geometric network optimization (1998) (95)
Hamiltonian triangulations for fast rendering (1996) (85)
When can you fold a map? (2000) (79)
Approximating the Tree and Tour Covers of a Graph (1993) (77)
Decision trees for geometric models (1993) (74)
On monotone paths among obstacles with applications to planning assemblies (1989) (70)
Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights (1991) (69)
Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies (2002) (68)
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots (2002) (60)
Optimization Problems Related to Zigzag Pocket Machining (1996) (59)
Geometric stable roommates (2009) (56)
Not being (super)thin or solid is hard: A study of grid Hamiltonicity (2009) (50)
Computing a shortest k-link path in a polygon (1992) (49)
Minimum-link watchman tours (2003) (47)
On Minimum-Area Hulls (1998) (43)
Approximating the maximum quadratic assignment problem (2000) (43)
Minimum-diameter covering problems (2000) (39)
Hamilton Triangulations for Fast Rendering (1994) (38)
The Lawnmower Problem (1993) (35)
On the Reflexivity of Point Sets (2001) (34)
Modularity of cycles and paths in graphs (1991) (33)
Optimal link path queries in a simple polygon (1992) (33)
The Lazy Bureaucrat scheduling problem (1999) (31)
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms (1992) (30)
On the Maximum Scatter Traveling Salesperson Problem (1999) (29)
A note on orientations of mixed graphs (2002) (29)
Maximum thick paths in static and dynamic environments (2008) (29)
Geometric knapsack problems (1991) (28)
Bicriteria Shortest Path Problems in the Plane ( extended abstract ) (28)
Restricted delivery problems on a network (1997) (25)
Bichromatic 2-center of pairs of points (2012) (25)
Matching points into noise regions: combinatorial bounds and algorithms (1991) (25)
On the maximum scatter TSP (1997) (24)
Matching Points with Squares (2009) (24)
Some Lower Bounds on Geometric Separability Problems (2006) (24)
The snowblower problem (2006) (21)
Logarithmic-time link path queries in a simple polygon (1995) (20)
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (2019) (20)
Improved approximation algorithms for the freeze-tag problem (2003) (20)
Online dispersion algorithms for swarms of robots (2003) (20)
Choice is hard (2001) (18)
Analysis of Heuristics for the Freeze-Tag Problem (2002) (18)
Convex transversals (2011) (18)
Conflict-free Covering (2015) (17)
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks (2014) (16)
Shortest path to a segment and quickest visibility queries (2015) (15)
Secure Communication through Jammers Jointly Optimized in Geography and Time (2015) (15)
Matching Points with Circles and Squares (2004) (15)
An algorithmic study of manufacturing paperclips and other folded structures (2002) (14)
Point Probe Decision Trees for Geometric Concept Classes (1993) (13)
Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity (2017) (13)
Arrangements of segments that share endpoints: Single face results (1991) (13)
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems (2004) (12)
On the Complexity of Circulations (1986) (12)
On negative cycles in mixed graphs (1985) (10)
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions (2011) (10)
Testing Simple Polygons (1997) (10)
Hamiltonian Cycles in Triangular Grids (2006) (10)
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain (2015) (10)
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem (2004) (9)
Data transmission and base-station placement for optimizing network lifetime (2010) (8)
Graph partitions with minimum degree constraints (1998) (8)
Some Separability Problems in the Plane (2000) (8)
Algorithms for two-box covering (2006) (8)
Geometric decision trees for optical character recognition (extended abstract) (1997) (8)
The (K, k)-capacitated spanning tree problem (2010) (7)
Some path planning algorithms in computational geometry and air traffic management (2012) (7)
Selecting and covering colored points (2018) (7)
Locating Battery Charging Stations to Facilitate Almost Shortest Paths (2019) (6)
Recognizing polygonal parts from width measurements (1998) (5)
On the Manufacturability of Paperclips and Sheet Metal Structures (1999) (5)
Two New Classes of Hamiltonian Graphs: (Extended Abstract) (2007) (5)
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems (2002) (5)
Shortest Tour of a Sequence of Disjoint Segments in L1 (2007) (5)
Complexity of the Multiple Product Single Facility Stockout Avoidance Problem (1988) (5)
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths (2019) (5)
A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weights (1988) (4)
The Shortest Separating Cycle Problem (2016) (4)
On the Maximum Scatter TSP (Extended Abstract) (1997) (4)
Matching regions in the plane using non-crossing segments (2015) (4)
Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining (2000) (4)
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee (2017) (4)
Complexity of cycle and path problems in graphs (1986) (4)
The districting problem (2009) (3)
An Optimal Visibility Algorithm for A Simple Polygon with Star-Shaped Holes (1987) (3)
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach (2020) (3)
The k-path tree matroid and its applications to survivable network design (2008) (3)
Optimizing Read Reversals for Sequence Compression - (Extended Abstract) (2015) (3)
Matching points with geometric objects : Combinatorial results (2004) (3)
Increasing digraph arc-connectivity by arc addition, reversal and complement (2002) (2)
Two New Classes of Hamiltonian Graphs (2007) (2)
Optimal enclosure problems (1990) (2)
Network Optimization on Partitioned Pairs of Points (2017) (2)
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization (2020) (2)
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box (2012) (2)
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (2021) (2)
The Lazy Bureau rat S heduling Problem ? (2002) (1)
Acknowledgments Discussions With (1996) (1)
On Matching Robustness (2007) (1)
Hybrid Algorithms for Scheduling Sensors for Guarding Polygonal Domains (2014) (1)
The Problem of the Stability of the Human Organism (1933) (1)
Computing β-Stretch Paths in Drawings of Graphs (2020) (1)
The Length of the Longest Edge in Multi-dimensional Delaunay Graphs (2010) (1)
Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract) (1996) (1)
How to Water Carrots : Geometric Coverage Problems for Point Sets (2005) (1)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2014) (1)
Capturing Crossings: Convex Hulls of Segment and Plane Intersections (2007) (0)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2013) (0)
Weighted-Tardiness Scheduling with Weights Proportional to Processing Times (1988) (0)
The $r$-Gather Problem in Euclidean Space (2015) (0)
Algorithms for Rapidly Dispersing RobotSwarms in Unknown (2002) (0)
Reconfiguring edge-connected pivoting modular robots (2019) (0)
Separability of Point Sets by k-Level Linear Classification Trees (2012) (0)
Manufacturing: An Application Domain for Computational Geometry (1995) (0)
Link distance query problems in polygons (1991) (0)
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland (2014) (0)
The Pencil Packing Problem ∗ (2019) (0)
C G ] 2 O ct 2 00 2 On the Reflexivity of Point Sets (2008) (0)
Online Dispersion Algorithms of Robot Swarms (2003) (0)
Guest Editors' Foreword (1997) (0)
Beautification is Hard (1988) (0)
The Embroidery Problem (2008) (0)
Optimal Cutting of a Polygon by Lasers (2016) (0)
The lawnmower problem and other geometric path covering problems (1994) (0)
roceedings of The 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2017) (2017) (0)
On Geometric Stable Roommates and MinimumWeight Matching Robustness ( Extended Abstract ) ∗ (2007) (0)
On Minimum-Area Hulls (Extended Abstract) (1996) (0)

This paper list is powered by the following services:

Other Resources About Esther Arkin

en.wikipedia.org

What Schools Are Affiliated With Esther Arkin?

Esther Arkin is affiliated with the following schools: