• Publications
• Influence
Touring a sequence of polygons
• Computer Science, Mathematics
• STOC '03
• 9 June 2003
Given a sequence of <i>k</i> polygons in the plane, a start point <i>s</i>, and a target point, <i>t</i>, we seek a shortest path that starts at <i>s</i>, visits in order each of the polygons, andExpand
• 129
• 21
Geometry Helps in Bottleneck Matching and Related Problems
• Mathematics, Computer Science
• Algorithmica
• 2001
Abstract. Let A and B be two sets of n objects in \realsd , and let Match be a (one-to-one) matching between A and B . Let min(Match ), max(Match ), and Σ(Match) denote the length of the shortestExpand
• 136
• 17
The resilience of WDM networks to probabilistic geographical failures
• Computer Science
• INFOCOM
• 10 April 2011
Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (such as anExpand
• 83
• 12
Approximation algorithms for two optimal location problems in sensor networks
• Computer Science
• 2nd International Conference on Broadband…
• 3 October 2005
This paper study two problems that arise in optimization of sensor networks: First, we devise provable approximation schemes for locating a base station and constructing a network among a set ofExpand
• 156
• 10
Guarding galleries and terrains
• Mathematics, Computer Science
• Inf. Process. Lett.
• 25 August 2002
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficient approximationExpand
• 106
• 10
Matching planar maps
• Computer Science, Mathematics
• SODA '03
• 12 January 2003
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. MoreExpand
• 190
• 9
The complexity of the union of (α, β)-covered objects
• A. Efrat
• Computer Science, Mathematics
• SCG '99
• 13 June 1999
An (α, β)-covered object is a simply connected planar region c with the property that for each point p ∈ ∂c there exists a triangle contained in c and having p as a vertex, such that all its anglesExpand
• 60
• 8
Using and Determining Location in a Context-Sensitive Tour Guide
• Computer Science
• Computer
• 1 August 2001
In a study that provided unique insights into the challenges associated with developing location-based applications, the Lancaster Guide project used members of the general public to test aExpand
• 225
• 7
On simultaneous planar graph embeddings
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another inExpand
• 86
• 6
The Resilience of WDM Networks to Probabilistic Geographical Failures
• Computer Science
• IEEE/ACM Transactions on Networking
• 1 October 2013
Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures in their physical infrastructure, resulting from physical attacks (such as anExpand
• 107
• 6