| Algorithms for Cluster Busting in Anchored Graph Drawing. KA Lyons, H Meijer, D Rappaport J. Graph Algorithms Appl. 2 (1), 1-24, 1998 | 94 | 1998 |
| Decision trees for geometric models EM Arkin, H Meijer, JSB Mitchell, D Rappaport, SS Skiena Proceedings of the ninth annual symposium on Computational geometry, 369-378, 1993 | 94 | 1993 |
| The distance geometry of music ED Demaine, F Gomez-Martin, H Meijer, D Rappaport, P Taslakian, ... Computational geometry 42 (5), 429-454, 2009 | 90 | 2009 |
| El compás flamenco: a phylogenetic analysis JM Díaz-Báñez, G Farigu, F Gómez, D Rappaport, GT Toussaint Bridges: Mathematical Connections in Art, Music, and Science, 61-70, 2004 | 74 | 2004 |
| Super generalized 4pcs for 3d registration M Mohamad, MT Ahmed, D Rappaport, M Greenspan 2015 International Conference on 3D Vision, 598-606, 2015 | 67 | 2015 |
| Computing simple circuits from a set of line segments is NP-complete D Rappaport Proceedings of the third annual symposium on Computational geometry, 322-330, 1987 | 67 | 1987 |
| Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ... Computational Geometry 42 (6-7), 617-626, 2009 | 65 | 2009 |
| Algorithms for computing geometric measures of melodic similarity G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nunez, ... Computer Music Journal, 67-76, 2006 | 61 | 2006 |
| Computing the largest empty convex subset of a set of points D Avis, D Rappaport Proceedings of the first annual Symposium on Computational geometry, 161-167, 1985 | 60 | 1985 |
| Not being (super) thin or solid is hard: A study of grid Hamiltonicity EM Arkin, SP Fekete, K Islam, H Meijer, JSB Mitchell, Y Núñez-Rodríguez, ... Computational Geometry 42 (6-7), 582-605, 2009 | 59 | 2009 |
| Mathematical measures of syncopation F Gómez, A Melvin, D Rappaport, GT Toussaint Renaissance banff: Mathematics, music, art, culture, 73-84, 2005 | 59 | 2005 |
| Generalized 4-points congruent sets for 3d registration M Mohamad, D Rappaport, M Greenspan 2014 2nd international conference on 3D vision 1, 83-90, 2014 | 57 | 2014 |
| A convex hull algorithm for discs, and applications D Rappaport Computational Geometry 1 (3), 171-187, 1992 | 56 | 1992 |
| The largest empty annulus problem JM Díaz-Báñez, F Hurtado, H Meijer, D Rappaport, JA Sellarès International Journal of Computational Geometry & Applications 13 (04), 317-325, 2003 | 45 | 2003 |
| The aquarium keeper's problem J Czyzowicz, P Egyed, H Everett, D Rappaport, T Shermer, D Souvaine, ... Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991 | 45 | 1991 |
| Moldable and castable polygons D Rappaport, A Rosenbloom Computational Geometry 4 (4), 219-233, 1994 | 43* | 1994 |
| Computing simple circuits from a set of line segments D Rappaport, H Imai, GT Toussaint Discrete & computational geometry 5, 289-304, 1990 | 39* | 1990 |
| Moving coins M Abellanas, S Bereg, F Hurtado, AG Olaverri, D Rappaport, J Tejel Computational Geometry 34 (1), 35-48, 2006 | 36 | 2006 |
| Computing the minimum weight triangulation of a set of linearly ordered points H Meijer, D Rappaport Information Processing Letters 42 (1), 35-38, 1992 | 34 | 1992 |
| Minimum polygon transversals of line segments D Rappaport International Journal of Computational Geometry & Applications 5 (03), 243-256, 1995 | 33 | 1995 |
