default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Rappaport
Person information
- affiliation: Queen's University Kingston, School of Computing
SPARQL queries 
🛈 Please note that only 74% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j44]Hernán González-Aguilar, David Orden
, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. SIAM J. Comput. 50(1): 145-170 (2021)
2010 – 2019
- 2019
- [j43]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30(6-7): 1197-1216 (2019) - [c45]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. FCT 2019: 274-291 - [i4]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum rectilinear convex subsets. CoRR abs/1907.07441 (2019) - 2018
- [j42]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a polygonal terrain with the shortest beacon watchtower. Comput. Geom. 68: 34-47 (2018) - [j41]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29(2): 315-329 (2018) - [c44]Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport:
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. SoCG 2018: 55:1-55:14 - [i3]Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport:
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. CoRR abs/1803.05946 (2018) - 2017
- [j40]David Rappaport:
Guest Editor's foreword. Comput. Geom. 60: 1 (2017) - [j39]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22(1-3): 169-188 (2017) - [j38]Timothy Ng, David Rappaport, Kai Salomaa:
State complexity of prefix distance. Theor. Comput. Sci. 679: 107-117 (2017) - [c43]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science 2017: 135-152 - [c42]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. DCFS 2017: 287-298 - [c41]Timothy Ng, David Rappaport, Kai Salomaa:
Relative Prefix Distance Between Languages. DLT 2017: 284-295 - 2016
- [c40]Bahram Kouhestani, David Rappaport, Kai Salomaa:
The Length of the Beacon Attraction Trajectory. CCCG 2016: 69-74 - [c39]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. DCFS 2016: 192-204 - 2015
- [j37]Mustafa Mohamad, David Rappaport, Godfried Toussaint:
Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. Graphs Comb. 31(5): 1637-1648 (2015) - [c38]Mustafa Mohamad, Mirza Tahir Ahmed, David Rappaport, Michael A. Greenspan:
Super Generalized 4PCS for 3D Registration. 3DV 2015: 598-606 - [c37]Bahram Kouhestani, David Rappaport, Kai Salomaa:
On the Inverse Beacon Attraction Region of a Point. CCCG 2015 - [c36]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. DCFS 2015: 209-219 - [c35]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT 2015: 389-400 - [c34]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance. CIAA 2015: 238-249 - 2014
- [j36]Jin Akiyama, David Rappaport, Hyunwoo Seong:
A decision algorithm for reversible pairs of polygons. Discret. Appl. Math. 178: 19-26 (2014) - [c33]Mustafa Mohamad, David Rappaport, Michael A. Greenspan:
Generalized 4-Points Congruent Sets for 3D Registration. 3DV 2014: 83-90 - [c32]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower. CCCG 2014 - 2013
- [j35]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [j34]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing strong connectivity using optimal radius half-disk antennas. Comput. Geom. 46(3): 328-339 (2013) - 2012
- [j33]Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia:
Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160(10-11): 1441-1452 (2012) - [c31]David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides:
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - 2011
- [c30]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. CCCG 2011 - [c29]David Rappaport, Godfried T. Toussaint, Mustafa Mohamad:
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG 2011 - [c28]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - 2010
- [c27]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA 2010: 474-485
2000 – 2009
- 2009
- [j32]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. Comput. Geom. 42(5): 429-454 (2009) - [j31]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky:
Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) - [j30]Henk Meijer, David Rappaport:
Editorial CCCG 2006. Comput. Geom. 42(5): 463 (2009) - [j29]Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao:
Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 42(6-7): 582-605 (2009) - [j28]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j27]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Bounds for point recolouring in geometric graphs. Comput. Geom. 42(6-7): 690-703 (2009) - [j26]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
An algorithm for computing simple k-factors. Inf. Process. Lett. 109(12): 620-625 (2009) - [c26]Farzad Hassanzadeh, David Rappaport:
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. WADS 2009: 363-374 - 2008
- [j25]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008) - [j24]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [c25]Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
On the Complexity of Point Recolouring in Geometric Graphs. CCCG 2008 - 2007
- [j23]David Rappaport:
Maximal Area Sets and Harmony. Graphs Comb. 23(Supplement-1): 321-329 (2007) - [c24]Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao:
Hamilton Circuits in Hexagonal Grid Graphs. CCCG 2007: 85-88 - [i2]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
- [j22]Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel:
Moving coins. Comput. Geom. 34(1): 35-48 (2006) - [j21]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. 30(3): 67-76 (2006) - [c23]Yurai Núñez Rodríguez, David Rappaport:
Tight Bounds for Point Recolouring. CCCG 2006 - [c22]Michael Hirsch, Henk Meijer, David Rappaport:
Biclique Edge Cover Graphs and Confluent Drawings. GD 2006: 405-416 - 2005
- [j20]Henk Meijer, David Rappaport:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 15(6): 545-546 (2005) - [c21]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara:
Small weak epsilon nets. CCCG 2005: 52-56 - [c20]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 - [c19]Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport:
Closest Segments. CCCG 2005: 232-234 - [i1]Magdalene Grantson, Henk Meijer, David Rappaport:
Bi-chromatic minimum spanning trees. EuroCG 2005: 199-202 - 2004
- [c18]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52 - [c17]Henk Meijer, David Rappaport:
Simultaneous edge flips for convex subdivisions. CCCG 2004: 57-59 - 2003
- [j19]David Rappaport:
The visibility graph of congruent discs is Hamiltonian. Comput. Geom. 25(3): 257-265 (2003) - [j18]José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès:
The Largest Empty Annulus Problem. Int. J. Comput. Geom. Appl. 13(4): 317-325 (2003) - [c16]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Computing the Similarity of two Melodies. CCCG 2003: 81-84 - 2002
- [j17]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - [c15]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 - [c14]David Rappaport:
Tight Bounds for Visibility Matching of f-Equal Width Objects. JCDCG 2002: 246-250 - 2001
- [j16]Thomas Fevens, Henk Meijer, David Rappaport:
Minimum convex partition of a constrained point set. Discret. Appl. Math. 109(1-2): 95-107 (2001) - [j15]Kiyoshi Hosono, Henk Meijer, David Rappaport:
On the visibility graph of convex translates. Discret. Appl. Math. 113(2-3): 195-210 (2001) - 2000
- [c13]Kiyoshi Hosono, David Rappaport, Masatsugu Urabe:
On Convex Decompositions of Points. JCDCG 2000: 149-155
1990 – 1999
- 1998
- [j14]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision trees for geometric models. Int. J. Comput. Geom. Appl. 8(3): 343-364 (1998) - [j13]Kelly A. Lyons, Henk Meijer, David Rappaport:
Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. 2(1): 1-24 (1998) - [c12]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - 1995
- [j12]David Rappaport:
Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5(3): 243-256 (1995) - [c11]Paul Colley, Henk Meijer, David Rappaport:
Motivating lazy guards. CCCG 1995: 121-126 - 1994
- [j11]David Rappaport, Arnold Rosenbloom:
Moldable and Castable Polygons. Comput. Geom. 4: 219-233 (1994) - [j10]Kelly A. Lyons, David Rappaport:
An efficient algorithm for identifying objects using robot probes. Vis. Comput. 10(8): 452-458 (1994) - [c10]Paul Colley, Henk Meijer, David Rappaport:
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274 - 1993
- [j9]Peter Eades, David Rappaport:
The complexity of computing minimum separating polygons. Pattern Recognit. Lett. 14(9): 715-718 (1993) - [c9]Kelly A. Lyons, Henk Meijer, David Rappaport:
Properties of the voronoi diagram cluster buster. CASCON 1993: 1148-1163 - [c8]Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides:
Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 - [c7]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision Trees for Geometric Models. SCG 1993: 369-378 - [c6]Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport:
Probing a Set of Hyperplanes by Lines and Related Problems. WADS 1993: 72-82 - 1992
- [j8]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
- [j7]David Rappaport:
A Convex Hull Algorithm for Discs, and Applications. Comput. Geom. 1: 171-187 (1991) - [c5]Jurek 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 - 1990
- [j6]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. 5: 289-304 (1990)
1980 – 1989
- 1989
- [j5]David Rappaport:
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SIAM J. Comput. 18(6): 1128-1139 (1989) - [c4]David Rappaport:
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). WADS 1989: 57-66 - 1987
- [c3]David Rappaport:
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SCG 1987: 322-330 - 1986
- [j4]David Rappaport:
A linear algorithm for eliminating hidden-lines from a polygonal cylinder. Vis. Comput. 2(1): 44-53 (1986) - [c2]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
On Computing Simple Circuits on a Set of Line Segments. SCG 1986: 52-60 - 1985
- [j3]David Rappaport, Godfried T. Toussaint:
A simple linear hidden-line algorithm for star-shaped polygons. Pattern Recognit. Lett. 3(1): 35-39 (1985) - [c1]David Avis, David Rappaport:
Computing the largest empty convex subset of a set of points. SCG 1985: 161-167
1970 – 1979
- 1979
- [j2]Izidor Gertner, David Rappaport:
Optimality criteria for controlled discontinous processes. Inf. Sci. 17(1): 75-90 (1979) - 1977
- [j1]Izidor Gertner, David Rappaport:
Stochastic control of system with unobserved jump parameter process. Inf. Sci. 13(3): 269-282 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
