Alon Efrat

According to our database1, Alon Efrat authored at least 109 papers between 1993 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Multi-Level Steiner Trees.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

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

Nearest-Neighbor Searching Under Uncertainty I.
Discrete & Computational Geometry, 2017

2016
Improved Approximation Algorithms for Relay Placement.
ACM Trans. Algorithms, 2016

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

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

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

Robust data mule networks with remote healthcare applications in the Amazon region: A fountain code approach.
Proceedings of the 17th International Conference on E-health Networking, 2015

Data recovery after geographic correlated attacks.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

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

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

Memory efficient and scalable address mapping for flash storage devices.
Journal of Systems Architecture - Embedded Systems Design, 2014

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

MapSets: Visualizing Embedded and Clustered Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

2013
Collecting data in ad-hoc networks with reduced uncertainty.
Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

MobiSLIC: Content-Aware Energy Saving for Educational Videos on Mobile Devices.
Proceedings of the Mobile and Ubiquitous Systems: Computing, Networking, and Services, 2013

Sweeping a terrain by collaborative aerial vehicles.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012
Nearest-neighbor searching under uncertainty.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Optimization schemes for protective jamming.
Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012

Client-side backprojection of presentation slides into educational video.
Proceedings of the 20th ACM Multimedia Conference, MM '12, Nara, Japan, October 29, 2012

Extent Mapping Scheme for Flash Memory Devices.
Proceedings of the 20th IEEE International Symposium on Modeling, 2012

Geographic max-flow and min-cut under a circular disk failure model.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Efficient algorithms for pursuing moving evaders in terrains.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 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
Robust Spatiotemporal Matching of Electronic Slides to Presentation Videos.
IEEE Trans. Image Processing, 2011

Expanding the point: automatic enlargement of presentation video elements.
Proceedings of the 19th International Conference on Multimedia 2011, Scottsdale, AZ, USA, November 28, 2011

The resilience of WDM networks to probabilistic geographical failures.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Distributed localization and clustering using data correlation and the Occam's razor principle.
Proceedings of the Distributed Computing in Sensor Systems, 2011

2010
Force-directed approaches to sensor localization.
TOSN, 2010

Retransmission and backoff strategies for wireless broadcasting.
Ad Hoc Networks, 2010

On Channel-Discontinuity-Constraint Routing in Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Improving and Aligning Speech with Presentation Slides.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

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

2009
Algorithm design for a class of base station location problems in sensor networks.
Wireless Networks, 2009

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

Accurate alignment of presentation slides with educational video.
Proceedings of the 2009 IEEE International Conference on Multimedia and Expo, 2009

2008
Guest Editor's Foreword.
Int. J. Comput. Geometry Appl., 2008

On the performance of the ICP algorithm.
Comput. Geom., 2008

On Approximate Geodesic-Distance Queries amid Deforming Point Clouds.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Improved Approximation Algorithms for Relay Placement.
Proceedings of the Algorithms, 2008

2007
Buddy tracking - efficient proximity detection among mobile friends.
Pervasive and Mobile Computing, 2007

Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves.
Journal of Mathematical Imaging and Vision, 2007

Finding a Guard that Sees Most and a Shop that Sells Most.
Discrete & Computational Geometry, 2007

On incremental rendering of silhouette maps of a polyhedral scene.
Comput. Geom., 2007

Restricted strip covering and the sensor cover problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Temporal Modeling of Slide Change in Presentation Videos.
Proceedings of the IEEE International Conference on Acoustics, 2007

2006
On the Union of kappa-Round Objects in Three and Four Dimensions.
Discrete & Computational Geometry, 2006

Algorithm design for base station placement problems in sensor networks.
Proceedings of the 3rd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 2006

Matching slides to presentation videos using SIFT and scene background matching.
Proceedings of the 8th ACM SIGMM International Workshop on Multimedia Information Retrieval, 2006

Coverage Time Characteristics in Sensor Networks.
Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

Onroad Vehicular Broadcasting.
Proceedings of the 15th International Conference On Computer Communications and Networks, 2006

On the ICP algorithm.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Retransmission and Backoff Strategies for Broadcasting in Multi-hop Wireless Networks.
Proceedings of the 3rd International Conference on Broadband Communications, 2006

Force-Directed Approaches to Sensor Localization.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Force-Directed Approaches to Sensor Network Localization.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

Approximation algorithms for location problems in sensor networks.
Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

Hardware-Assisted Natural Neighbor Interpolation.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Covering with Ellipses.
Algorithmica, 2004

On finding a guard that sees most and a shop that sells most.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Buddy tracking - efficient proximity detection among mobile friends.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

On the union of kapa-round objects.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Search the Audio, Browse the Video - A Generic Paradigm for Video Collections.
EURASIP J. Adv. Sig. Proc., 2003

On Simultaneous Planar Graph Embeddings.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Touring a sequence of polygons.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Matching planar maps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Optimal strategies to track and capture a predictable target.
Proceedings of the 2003 IEEE International Conference on Robotics and Automation, 2003

Fixed-Location Circular-Arc Drawing of Planar Graphs.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Finding a curve in a map.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.
Discrete & Computational Geometry, 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Guarding Galleries and Terrains.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Computing Homotopic Shortest Paths Efficiently.
Proceedings of the Algorithms, 2002

Growing fat graphs.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Fly Cheaply: On the Minimum Fuel Consumption Problem.
J. Algorithms, 2001

Using and Determining Location in a Context-Sensitive Tour Guide.
IEEE Computer, 2001

Geometry Helps in Bottleneck Matching and Related Problems.
Algorithmica, 2001

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems.
Algorithmica, 2001

Pattern matching for sets of segments.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Morphing between polylines.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Geometric algorithms for the analysis of 2D-electrophoresis gels.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Drawing with Fat Edges.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Advances in Phonetic Word Spotting.
Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000
Computing Euclidean bottleneck matchings in higher dimensions.
Inf. Process. Lett., 2000

On the Complexity of the Union of Fat Convex Objects in the Plane.
Discrete & Computational Geometry, 2000

On incremental rendering of silhouette maps of polyhedral scene.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Sweeping simple polygons with a chain of guards.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Covering Simple Polygonal Regions by Ellipses.
EuroCG, 2000

1999
Geometric Pattern Matching in d -Dimensional Space.
Discrete & Computational Geometry, 1999

On the union of k-curved objects.
Comput. Geom., 1999

Efficient Regular Data Structures and Algorithms for Location and Proximity Problems.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

The Complexity of the Union of (alpha, beta)-Covered Objects.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
On the Number of Regular Vertices of the Union of Jordan Regions.
Proceedings of the Algorithm Theory, 1998

On the Union of k-Curved Objects.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Fly Cheaply: On the Minimum Fuel-Consumption Problem.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Dynamic Data Structures for Fat Objects and Their Applications.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

On the Complexity of the Union of Fat Objects in the Plane.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Separating and Shattering Long Line Segments.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Computing Fair and Bottleneck Matchings in Geormetric Graphs.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Improvements on Bottleneck Matching and Related Problems Using Geometry.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Geometric Pattern Matching in d-Dimensional Space.
Proceedings of the Algorithms, 1995

Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
A Near-Linear Algorithm for the Planar Segment Center Problem.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Computing a Segment Center for a Planar Point Set.
J. Algorithms, 1993

Computing the Smallest k-Enclosing Circle and Related Problems.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Subpixel Image Registration Using Circular Fiducials.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

On the Union of Fat Wedges and Separating a Collection of Segments By a Line.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Finding Maximally Consistent Sets of Halfspaces.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

A Simple Algorithm for Maintaining the Center of a Planar Point-set.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993


  Loading...