| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Alon Efrat 37 Alon Efrat, Sariel Har-Peled : Guarding Galleries and Terrains. IFIP TCS 2002 : 181-192 36 Alon Efrat, Stephen G. Kobourov , M. Stepp , Carola Wenk : Growing fat graphs. Symposium on Computational Geometry 2002 : 277-278 35 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) 34 Arnon Amir , Alon Efrat, Savitha Srinivasan : Advances in Phonetic Word Spotting. CIKM 2001 : 580-582 33 Christian A. Duncan , Alon Efrat, Stephen G. Kobourov , Carola Wenk : Drawing with Fat Edges. Graph Drawing 2001 : 162-177 32 Alon Efrat, Frank Hoffman , Klaus Kriegel , Christof Schultz , Carola Wenk : Geometric algorithms for the analysis of 2D-electrophoresis gels. RECOMB 2001 : 114-123 31 Alon Efrat, Piotr Indyk , Suresh Venkatasubramanian : Pattern matching for sets of segments. SODA 2001 : 295-304 30 Alon Efrat, Sariel Har-Peled , Leonidas J. Guibas , T. M. Murali : Morphing between polylines. SODA 2001 : 680-689 29 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) 28 Alon Efrat, Alon Itai , Matthew J. Katz : Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31 (1): 1-28 (2001) 27 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) 26 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) 25 Timothy M. Chan , Alon Efrat: Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms 41 (2): 330-337 (2001) 24 Alon Efrat, Leonidas J. Guibas , Olaf A. Hall-Holt , Li Zhang : On incremental rendering of silhouette maps of polyhedral scene. SODA 2000 : 910-917 23 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 22 Alon Efrat, Matthew J. Katz , Frank Nielsen , Micha Sharir : Dynamic data structures for fat objects and their applications. Computational Geometry 15 (4): 215-227 (2000) 21 Alon Efrat, Matthew J. Katz : Computing Euclidean bottleneck matchings in higher dimensions. Information Processing Letters 75 (4): 169-174 (2000) 20 Arnon Amir , Alon Efrat, Piotr Indyk , Hanan Samet : Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999 : 160-170 19 Alon Efrat: The Complexity of the Union of (alpha, beta)-Covered Objects. Symposium on Computational Geometry 1999 : 134-142 18 Alon Efrat, Matthew J. Katz : On the union of k-curved objects. Computational Geometry 14 (4): 241-254 (1999) 17 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) 16 Boris Aronov , Alon Efrat, Dan Halperin , Micha Sharir : On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998 : 322-334 15 Alon Efrat, Sariel Har-Peled : Fly Cheaply: On the Minimum Fuel-Consumption Problem. Symposium on Computational Geometry 1998 : 143-145 14 Alon Efrat, Matthew J. Katz : On the Union of k -Curved Objects. Symposium on Computational Geometry 1998 : 206-213 13 Alon Efrat, Micha Sharir : On the Complexity of the Union of Fat Objects in the Plane. Symposium on Computational Geometry 1997 : 104-112 12 Alon Efrat, Matthew J. Katz , Frank Nielsen , Micha Sharir : Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997 : 297-306 11 Alon Efrat, Otfried Schwarzkopf : Separating and Shattering Long Line Segments. Information Processing Letters 64 (6): 309-314 (1997) 10 Alon Efrat, Matthew J. Katz : Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996 : 115-125 9 Alon Efrat, Otfried Schwarzkopf : Separating and Shattering Long Line Segments. ISAAC 1996 : 36-44 8 Alon Efrat, Alon Itai : Improvements on Bottleneck Matching and Related Problems Using Geometry. Symposium on Computational Geometry 1996 : 301-310 7 L. Paul Chew , Dorit Dor , Alon Efrat, Klara Kedem : Geometric Pattern Matching in d-Dimensional Space. ESA 1995 : 264-279 6 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 5 Alon Efrat, Micha Sharir : A Near-Linear Algorithm for the Planar Segment Center Problem. SODA 1994 : 87-97 4 Alon Efrat, Craig Gotsman : Subpixel image registration using circular fiducials. International Journal of Computational Geometry and Applications 4 (4): 403-422 (1994) 3 Alon Efrat, Craig Gotsman : Subpixel Image Registration Using Circular Fiducials. ISTCS 1993 : 49-58 2 Alon Efrat, Micha Sharir , Alon Ziv : Computing the Smallest k-Enclosing Circle and Related Problems. WADS 1993 : 325-336 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)  DiSC'02 © 2003 Association for Computing Machinery |
