| 2010 | ||
|---|---|---|
| 87 | Jesus Arango, Alon Efrat, Srinivasan Ramasubramanian, Stephen Pink, Marwan Krunz: Retransmission and backoff strategies for wireless broadcasting. Ad Hoc Networks 8(1): 77-95 (2010) | |
| 2009 | ||
| 86 | Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk: Geometric stable roommates. Inf. Process. Lett. 109(4): 219-224 (2009) | |
| 2008 | ||
| 85 | Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela: Improved Approximation Algorithms for Relay Placement. ESA 2008: 356-367 | |
| 84 | Esther Ezra, Micha Sharir, Alon Efrat: On the performance of the ICP algorithm. Comput. Geom. 41(1-2): 77-93 (2008) | |
| 83 | Alon Efrat: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 18(1/2): 1-2 (2008) | |
| 2007 | ||
| 82 | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted strip covering and the sensor cover problem. SODA 2007: 1056-1063 | |
| 81 | Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On simultaneous planar graph embeddings. Comput. Geom. 36(2): 117-130 (2007) | |
| 80 | Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang: On incremental rendering of silhouette maps of a polyhedral scene. Comput. Geom. 38(3): 129-138 (2007) | |
| 79 | Otfried Cheong, Alon Efrat, Sariel Har-Peled: Finding a Guard that Sees Most and a Shop that Sells Most. Discrete & Computational Geometry 37(4): 545-563 (2007) | |
| 78 | Alon Efrat, Cesim Erten, Stephen G. Kobourov: Fixed-Location Circular Arc Drawing of Planar Graphs. J. Graph Algorithms Appl. 11(1): 145-164 (2007) | |
| 77 | Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwaran Palaniappan, Kevin Wampler: Buddy tracking - efficient proximity detection among mobile friends. Pervasive and Mobile Computing 3(5): 489-511 (2007) | |
| 2006 | ||
| 76 | Jesus Arango, Alon Efrat, Srinivasan Ramasubramanian, Marwan Krunz, Stephen Pink: Retransmission and Backoff Strategies for Broadcasting in Multi-hop Wireless Networks. BROADNETS 2006 | |
| 75 | Quanfu Fan, Kobus Barnard, Arnon Amir, Alon Efrat, Ming Lin: Matching slides to presentation videos using SIFT and scene background matching. Multimedia Information Retrieval 2006: 239-248 | |
| 74 | Esther Ezra, Micha Sharir, Alon Efrat: On the ICP algorithm. Symposium on Computational Geometry 2006: 95-104 | |
| 73 | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted Strip Covering and the Sensor Cover Problem CoRR abs/cs/0605102: (2006) | |
| 72 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing homotopic shortest paths efficiently. Comput. Geom. 35(3): 162-172 (2006) | |
| 71 | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the Union of kappa-Round Objects in Three and Four Dimensions. Discrete & Computational Geometry 36(4): 511-526 (2006) | |
| 70 | Alon Efrat, Sariel Har-Peled: Guarding galleries and terrains. Inf. Process. Lett. 100(6): 238-245 (2006) | |
| 69 | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Int. J. Found. Comput. Sci. 17(5): 1143-1164 (2006) | |
| 2005 | ||
| 68 | Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian: Hardware-Assisted Natural Neighbor Interpolation. ALENEX/ANALCO 2005: 111-120 | |
| 67 | Stephen G. Kobourov, Alon Efrat, David Forrester, Anand Iyer: Force-Directed Approaches to Sensor Network Localization. Algorithmic Aspects of Large and Complex Networks 2005 | |
| 66 | Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell: Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776 | |
| 65 | Alon Efrat: The Complexity of the Union of (alpha, beta)-Covered Objects. SIAM J. Comput. 34(4): 775-787 (2005) | |
| 2004 | ||
| 64 | Alon Efrat, Arnon Amir: Buddy tracking - efficient proximity detection among mobile friends. INFOCOM 2004 | |
| 63 | Otfried Cheong, Alon Efrat, Sariel Har-Peled: On finding a guard that sees most and a shop that sells most. SODA 2004: 1098-1107 | |
| 62 | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the union of kapa-round objects. Symposium on Computational Geometry 2004: 383-390 | |
| 61 | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for Sets of Segments. Algorithmica 40(3): 147-160 (2004) | |
| 2003 | ||
| 60 | Alon Efrat, Cesim Erten, Stephen G. Kobourov: Fixed-Location Circular-Arc Drawing of Planar Graphs. Graph Drawing 2003: 147-158 | |
| 59 | Alon Efrat, Héctor H. González-Baños, Stephen G. Kobourov, Lingeshwaran Palaniappan: Optimal strategies to track and capture a predictable target. ICRA 2003: 3789-3796 | |
| 58 | Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk: Matching planar maps. SODA 2003: 589-598 | |
| 57 | Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell: Touring a sequence of polygons. STOC 2003: 473-482 | |
| 56 | Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote: Finding a curve in a map. Symposium on Computational Geometry 2003: 384-385 | |
| 55 | Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On Simultaneous Planar Graph Embeddings. WADS 2003: 243-255 | |
| 54 | Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk: Covering with Ellipses. Algorithmica 38(1): 145-160 (2003) | |
| 53 | Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk: Matching planar maps. J. Algorithms 49(2): 262-283 (2003) | |
| 2002 | ||
| 52 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing Homotopic Shortest Paths Efficiently. ESA 2002: 411-423 | |
| 51 | Alon Efrat, Sariel Har-Peled: Guarding Galleries and Terrains. IFIP TCS 2002: 181-192 | |
| 50 | Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk: Covering shapes by ellipses. SODA 2002: 453-454 | |
| 49 | Alon Efrat, Stephen G. Kobourov, Michael Stepp, Carola Wenk: Growing fat graphs. Symposium on Computational Geometry 2002: 277-278 | |
| 48 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing Homotopic Shortest Paths Efficiently CoRR cs.CG/0204050: (2002) | |
| 47 | Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell: On Simultaneous Graph Embedding CoRR cs.CG/0206018: (2002) | |
| 46 | Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali: New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Discrete & Computational Geometry 28(4): 535-569 (2002) | |
| 45 | Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk: Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels. Journal of Computational Biology 9(2): 299-315 (2002) | |
| 2001 | ||
| 44 | Arnon Amir, Alon Efrat, Savitha Srinivasan: Advances in Phonetic Word Spotting. CIKM 2001: 580-582 | |
| 43 | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Graph Drawing 2001: 162-177 | |
| 42 | Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz, Carola Wenk: Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB 2001: 114-123 | |
| 41 | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern matching for sets of segments. SODA 2001: 295-304 | |
| 40 | Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali: Morphing between polylines. SODA 2001: 680-689 | |
| 39 | Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet: Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30(2): 164-187 (2001) | |
| 38 | Alon Efrat, Alon Itai, Matthew J. Katz: Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1): 1-28 (2001) | |
| 37 | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. Discrete & Computational Geometry 25(2): 203-220 (2001) | |
| 36 | Nigel Davies, Keith Cheverst, Keith Mitchell, Alon Efrat: Using and Determining Location in a Context-Sensitive Tour Guide. IEEE Computer 34(8): 35-41 (2001) | |
| 35 | Timothy M. Chan, Alon Efrat: Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms 41(2): 330-337 (2001) | |
| 2000 | ||
| 34 | Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christof Schultz: Covering Simple Polygonal Regions by Ellipses. EWCG 2000: 89-92 | |
| 33 | Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang: On incremental rendering of silhouette maps of polyhedral scene. SODA 2000: 910-917 | |
| 32 | Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali: Sweeping simple polygons with a chain of guards. SODA 2000: 927-936 | |
| 31 | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for sets of segments CoRR cs.CG/0009013: (2000) | |
| 30 | Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4): 215-227 (2000) | |
| 29 | Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Convex Objects in the Plane. Discrete & Computational Geometry 23(2): 171-189 (2000) | |
| 28 | Alon Efrat, Matthew J. Katz: Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75(4): 169-174 (2000) | |
| 1999 | ||
| 27 | Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet: Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999: 160-170 | |
| 26 | Alon Efrat: The Complexity of the Union of (alpha, beta)-Covered Objects. Symposium on Computational Geometry 1999: 134-142 | |
| 25 | Alon Efrat, Matthew J. Katz: On the union of k-curved objects. Comput. Geom. 14(4): 241-254 (1999) | |
| 24 | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d -Dimensional Space. Discrete & Computational Geometry 21(2): 257-274 (1999) | |
| 23 | Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. 29(3): 912-953 (1999) | |
| 1998 | ||
| 22 | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 | |
| 21 | Alon Efrat, Sariel Har-Peled: Fly Cheaply: On the Minimum Fuel-Consumption Problem. Symposium on Computational Geometry 1998: 143-145 | |
| 20 | Alon Efrat, Matthew J. Katz: On the Union of k-Curved Objects. Symposium on Computational Geometry 1998: 206-213 | |
| 1997 | ||
| 19 | Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Objects in the Plane. Symposium on Computational Geometry 1997: 104-112 | |
| 18 | Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306 | |
| 17 | Alon Efrat, Otfried Schwarzkopf: Separating and Shattering Long Line Segments. Inf. Process. Lett. 64(6): 309-314 (1997) | |
| 1996 | ||
| 16 | Alon Efrat, Matthew J. Katz: Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996: 115-125 | |
| 15 | Alon Efrat, Otfried Schwarzkopf: Separating and Shattering Long Line Segments. ISAAC 1996: 36-44 | |
| 14 | Alon Efrat, Alon Itai: Improvements on Bottleneck Matching and Related Problems Using Geometry. Symposium on Computational Geometry 1996: 301-310 | |
| 13 | Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment-Center Problem. Discrete & Computational Geometry 16(3): 239-257 (1996) | |
| 1995 | ||
| 12 | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d-Dimensional Space. ESA 1995: 264-279 | |
| 11 | Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Symposium on Computational Geometry 1995: 39-50 | |
| 1994 | ||
| 10 | Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment Center Problem. SODA 1994: 87-97 | |
| 9 | Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest K-enclosing Circle and Related Problems. Comput. Geom. 4: 119-136 (1994) | |
| 8 | Alon Efrat, Craig Gotsman: Subpixel image registration using circular fiducials. Int. J. Comput. Geometry Appl. 4(4): 403-422 (1994) | |
| 1993 | ||
| 7 | Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG 1993: 115-120 | |
| 6 | Reuven Bar-Yehuda, Alon Efrat, Alon Itai: A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG 1993: 252-257 | |
| 5 | Alon Efrat, Micha Lindenbaum, Micha Sharir: Finding Maximally Consistent Sets of Halfspaces. CCCG 1993: 432-436 | |
| 4 | Alon Efrat, Craig Gotsman: Subpixel Image Registration Using Circular Fiducials. ISTCS 1993: 49-58 | |
| 3 | Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest k-Enclosing Circle and Related Problems. WADS 1993: 325-336 | |
| 2 | Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. 3: 277-288 (1993) | |
| 1 | Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo: Computing a Segment Center for a Planar Point Set. J. Algorithms 15(2): 314-323 (1993) | |