Esther M. Arkin

According to our database1, Esther M. Arkin authored at least 123 papers between 1986 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Selecting and covering colored points.
Discrete Applied Mathematics, 2018

2017
Secure communication through jammers jointly optimized in geography and time.
Pervasive and Mobile Computing, 2017

Network Optimization on Partitioned Pairs of Points.
CoRR, 2017

Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity.
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

Network Optimization on Partitioned Pairs of Points.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016
Shortest path to a segment and quickest visibility queries.
JoCG, 2016

The Shortest Separating Cycle Problem.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.
Comput. Geom., 2015

Optimizing Read Reversals for Sequence Compression - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Secure Communication through Jammers Jointly Optimized in Geography and Time.
Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2015

Choice Is Hard.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Optimal placement of protective jammers for securing wireless transmissions in a geographic domain.
Proceedings of the 14th International Conference on Information Processing in Sensor Networks, 2015

Shortest Path to a Segment and Quickest Visibility Queries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Conflict-free Covering.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

Convex transversals.
Comput. Geom., 2014

Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks.
Ad Hoc Networks, 2014

Locating Battery Charging Stations to Facilitate Almost Shortest Paths.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2012
Separability of Point Sets by k-Level Linear Classification Trees.
Int. J. Comput. Geometry Appl., 2012

The (K, k)-capacitated spanning tree problem.
Discrete Optimization, 2012

Bichromatic 2-Center of Pairs of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
CoRR, 2011

The snowblower problem.
Comput. Geom., 2011

Convex Transversals.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Maximum thick paths in static and dynamic environments.
Comput. Geom., 2010

Data transmission and base-station placement for optimizing network lifetime.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

The (K, k)-Capacitated Spanning Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Geometric stable roommates.
Inf. Process. Lett., 2009

Matching Points with Squares.
Discrete & Computational Geometry, 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.
Comput. Geom., 2009

2008
Capturing crossings: Convex hulls of segment and plane intersections.
Inf. Process. Lett., 2008

The k-path tree matroid and its applications to survivable network design.
Discrete Optimization, 2008

Maximum thick paths in static and dynamic environments.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

The Embroidery Problem.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Two New Classes of Hamiltonian Graphs: (Extended Abstract).
Electronic Notes in Discrete Mathematics, 2007

Capturing Crossings: Convex Hulls of Segment and Plane Intersections.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Approximations for minimum and min-max vehicle routing problems.
J. Algorithms, 2006

Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geometry Appl., 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

The Snowblower Problem
CoRR, 2006

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
Algorithmica, 2006

The Snowblower Problem.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Algorithms for two-box covering.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Hamiltonian Cycles in Triangular Grids.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Optimal Covering Tours with Turn Costs.
SIAM J. Comput., 2005

2004
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem.
IEEE Trans. Robotics, 2004

The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
CoRR, 2004

When can you fold a map?
Comput. Geom., 2004

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica, 2004

Matching Points with Circles and Squares.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

2003
Minimum-link watchman tours.
Inf. Process. Lett., 2003

The Lazy Bureaucrat scheduling problem.
Inf. Comput., 2003

Optimal Covering Tours with Turn Costs
CoRR, 2003

An algorithmic study of manufacturing paperclips and other folded structures.
Comput. Geom., 2003

Improved approximation algorithms for the freeze-tag problem.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Online dispersion algorithms for swarms of robots.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Increasing digraph arc-connectivity by arc addition, reversal and complement.
Discrete Applied Mathematics, 2002

A note on orientations of mixed graphs.
Discrete Applied Mathematics, 2002

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments
CoRR, 2002

The Lazy Bureaucrat Scheduling Problem
CoRR, 2002

On the Reflexivity of Point Sets
CoRR, 2002

An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
CoRR, 2002

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments.
Proceedings of the Algorithmic Foundations of Robotics V, 2002

Analysis of Heuristics for the Freeze-Tag Problem.
Proceedings of the Algorithm Theory, 2002

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Proceedings of the Algorithm Theory, 2002

The freeze-tag problem: how to wake up a swarm of robots.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2001
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett., 2001

On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

When Can You Fold a Map?
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Optimal covering tours with turn costs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Minimum-diameter covering problems.
Networks, 2000

When Can You Fold a Map?
CoRR, 2000

Approximation algorithms for lawn mowing and milling.
Comput. Geom., 2000

Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining.
Computer-Aided Design, 2000

Optimization Problems Related to Zigzag Pocket Machining.
Algorithmica, 2000

Approximating the maximum quadratic assignment problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Some Separability Problems in the Plane.
EuroCG, 2000

1999
On the Maximum Scatter Traveling Salesperson Problem.
SIAM J. Comput., 1999

The Lazy Bureaucrat Scheduling Problem.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
On Local Search for Weighted k-Set Packing.
Math. Oper. Res., 1998

Decision trees for geometric models.
Int. J. Comput. Geometry Appl., 1998

Graph partitions with minimum degree constraints.
Discrete Mathematics, 1998

Recognizing polygonal parts from width measurements.
Comput. Geom., 1998

On Minimum-Area Hulls.
Algorithmica, 1998

Resource-Constrained Geometric Network Optimization.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Restricted delivery problems on a network.
Networks, 1997

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 1997

Testing Simple Polygons.
Comput. Geom., 1997

On the Maximum Scatter TSP (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

On Local Search for Weighted k-Set Packing.
Proceedings of the Algorithms, 1997

Geometric Decision Trees for Optical Character Recognition (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Hamiltonian triangulations for fast rendering.
The Visual Computer, 1996

Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

On Minimum-Area Hulls (Extended Abstract).
Proceedings of the Algorithms, 1996

1995
Logarithmic-time link path queries in a simple polygon.
Int. J. Comput. Geometry Appl., 1995

Arrangements of Segments that Share Endpoints Single Face Results.
Discrete & Computational Geometry, 1995

1994
Approximation Algorithms for the Geometric Covering Salesman Problem.
Discrete Applied Mathematics, 1994

Hamilton Triangulations for Fast Rendering.
Proceedings of the Algorithms, 1994

1993
Approximating the Tree and Tour Covers of a Graph.
Inf. Process. Lett., 1993

Geometric Knapsack Problems.
Algorithmica, 1993

Point Probe Decision Trees for Geometric Concept Classes.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Decision Trees for Geometric Models.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

The Lawnmower Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Testing Simple Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
INFORMS Journal on Computing, 1992

Optimal Link Path Queries in a Simple Polygon.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Computing a Shortest k-Link Path in a Polygon
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Modularity of Cycles and Paths in Graphs.
J. ACM, 1991

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights.
Operations Research, 1991

Geometric Knapsack Problems.
Proceedings of the Algorithms and Data Structures, 1991

Matching Points into Noise Regions: Combinatorial Bounds and Algorithms.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Arrangements of Segments that Share Endpoints: Single Face Results.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
An Efficiently Computable Metric for Comparing Polygonal Shapes.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
On Monotone Paths Among Obstacles with Applications to Planning Assemblies.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1987
Scheduling jobs with fixed start and end times.
Discrete Applied Mathematics, 1987

1986
On the Complexity of Circulations.
J. Algorithms, 1986


  Loading...