2008 | ||
---|---|---|
46 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport: On the Complexity of Point Recolouring in Geometric Graphs. CCCG 2008 | |
45 | EE | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008) |
44 | EE | Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008) |
2007 | ||
43 | Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao: Hamilton Circuits in Hexagonal Grid Graphs. CCCG 2007: 85-88 | |
42 | EE | Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Music CoRR abs/0705.4085: (2007) |
2006 | ||
41 | EE | Yurai Núñez Rodríguez, David Rappaport: Tight Bounds for Point Recolouring. CCCG 2006 |
40 | EE | Michael Hirsch, Henk Meijer, David Rappaport: Biclique Edge Cover Graphs and Confluent Drawings. Graph Drawing 2006: 405-416 |
39 | EE | Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel: Moving coins. Comput. Geom. 34(1): 35-48 (2006) |
2005 | ||
38 | EE | Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Deep Rhythms and Scales. CCCG 2005: 163-166 |
37 | EE | Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport: Closest Segments. CCCG 2005: 232-234 |
36 | EE | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara: Small weak epsilon nets. CCCG 2005: 52-56 |
35 | EE | Henk Meijer, David Rappaport: Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 15(6): 545-546 (2005) |
2004 | ||
34 | EE | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52 |
33 | EE | Henk Meijer, David Rappaport: Simultaneous edge flips for convex subdivisions. CCCG 2004: 57-59 |
2003 | ||
32 | Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint: Computing the Similarity of two Melodies. CCCG 2003: 81-84 | |
31 | EE | David Rappaport: The visibility graph of congruent discs is Hamiltonian. Comput. Geom. 25(3): 257-265 (2003) |
30 | EE | José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès: The Largest Empty Annulus Problem. Int. J. Comput. Geometry Appl. 13(4): 317-325 (2003) |
2002 | ||
29 | EE | José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès: The Largest Empty Annulus Problem. International Conference on Computational Science (3) 2002: 46-54 |
28 | EE | David Rappaport: Tight Bounds for Visibility Matching of f-Equal Width Objects. JCDCG 2002: 246-250 |
27 | Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) | |
2001 | ||
26 | Thomas Fevens, Henk Meijer, David Rappaport: Minimum convex partition of a constrained point set. Discrete Applied Mathematics 109(1-2): 95-107 (2001) | |
25 | Kiyoshi Hosono, Henk Meijer, David Rappaport: On the visibility graph of convex translates. Discrete Applied Mathematics 113(2-3): 195-210 (2001) | |
2000 | ||
24 | EE | Kiyoshi Hosono, David Rappaport, Masatsugu Urabe: On Convex Decompositions of Points. JCDCG 2000: 149-155 |
1998 | ||
23 | EE | Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding specified sections of arrangements: 2d results. CCCG 1998 |
22 | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena: Decision trees for geometric models. Int. J. Comput. Geometry Appl. 8(3): 343-364 (1998) | |
21 | EE | Kelly A. Lyons, Henk Meijer, David Rappaport: Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. 2(1): (1998) |
1995 | ||
20 | David Rappaport: Minimum polygon transversals of line segments. Int. J. Comput. Geometry Appl. 5(3): 243-256 (1995) | |
1994 | ||
19 | Paul Colley, Henk Meijer, David Rappaport: Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274 | |
18 | David Rappaport, Arnold Rosenbloom: Moldable and Castable Polygons. Comput. Geom. 4: 219-233 (1994) | |
17 | Kelly A. Lyons, David Rappaport: An efficient algorithm for identifying objects using robot probes. The Visual Computer 10(8): 452-458 (1994) | |
1993 | ||
16 | EE | Kelly A. Lyons, Henk Meijer, David Rappaport: Properties of the voronoi diagram cluster buster. CASCON 1993: 1148-1163 |
15 | Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides: Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 | |
14 | EE | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena: Decision Trees for Geometric Models. Symposium on Computational Geometry 1993: 369-378 |
13 | Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport: Probing a Set of Hyperplanes by Lines and Related Problems. WADS 1993: 72-82 | |
12 | EE | Peter Eades, David Rappaport: The complexity of computing minimum separating polygons. Pattern Recognition Letters 14(9): 715-718 (1993) |
1992 | ||
11 | Henk Meijer, David Rappaport: Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Inf. Process. Lett. 42(1): 35-38 (1992) | |
1991 | ||
10 | Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia: The Aquarium Keeper's Problem. SODA 1991: 459-464 | |
9 | David Rappaport: A Convex Hull Algorithm for Discs, and Applications. Comput. Geom. 1: 171-187 (1991) | |
1990 | ||
8 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint: Computing Simple Circuits form a Set of Line Segments. Discrete & Computational Geometry 5: 289-304 (1990) | |
1989 | ||
7 | David Rappaport: Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). WADS 1989: 57-66 | |
6 | David Rappaport: Computing Simple Circuits from a Set of Line Segments is NP-Complete. SIAM J. Comput. 18(6): 1128-1139 (1989) | |
1987 | ||
5 | EE | David Rappaport: Computing Simple Circuits from a Set of Line Segments is NP-Complete. Symposium on Computational Geometry 1987: 322-330 |
1986 | ||
4 | EE | David Rappaport, Hiroshi Imai, Godfried T. Toussaint: On Computing Simple Circuits on a Set of Line Segments. Symposium on Computational Geometry 1986: 52-60 |
3 | David Rappaport: A linear algorithm for eliminating hidden-lines from a polygonal cylinder. The Visual Computer 2(1): 44-53 (1986) | |
1979 | ||
2 | EE | Izidor Gertner, David Rappaport: Optimality criteria for controlled discontinous processes. Inf. Sci. 17(1): 75-90 (1979) |
1977 | ||
1 | EE | Izidor Gertner, David Rappaport: Stochastic control of system with unobserved jump parameter process. Inf. Sci. 13(3): 269-282 (1977) |