David Rappaport

Publication Activity (10 Years)

Years Active: 1977-2021
Publications (10 Years): 16

Top Topics

Quadratic Function

Regular Languages

Finite Automaton

Top Venues

Publications

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) (2021)
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)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia
Maximum rectilinear convex subsets. CoRR (2019)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29 (2) (2018)
Bahram Kouhestani, David Rappaport, Kai Salomaa
Routing in a polygonal terrain with the shortest beacon watchtower. Comput. Geom. 68 (2018)
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. CoRR (2018)
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. SoCG (2018)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22 (1-3) (2017)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Suffix Distance. DCFS (2017)
Timothy Ng, David Rappaport, Kai Salomaa
State complexity of prefix distance. Theor. Comput. Sci. 679 (2017)
Timothy Ng, David Rappaport, Kai Salomaa
Relative Prefix Distance Between Languages. DLT (2017)
David Rappaport
Guest Editor's foreword. Comput. Geom. 60 (2017)
Timothy Ng, David Rappaport, Kai Salomaa
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science (2017)
Bahram Kouhestani, David Rappaport, Kai Salomaa
The Length of the Beacon Attraction Trajectory. CCCG (2016)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance of Subregular Languages. DCFS (2016)
Timothy Ng, David Rappaport, Kai Salomaa
Quasi-Distances and Weighted Finite Automata. DCFS (2015)
Mustafa Mohamad, Mirza Tahir Ahmed, David Rappaport, Michael A. Greenspan
Super Generalized 4PCS for 3D Registration. 3DV (2015)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance. CIAA (2015)
Mustafa Mohamad, David Rappaport, Godfried Toussaint
Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. Graphs Comb. 31 (5) (2015)
Bahram Kouhestani, David Rappaport, Kai Salomaa
On the Inverse Beacon Attraction Region of a Point. CCCG (2015)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT (2015)
Bahram Kouhestani, David Rappaport, Kai Salomaa
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower. CCCG (2014)
Mustafa Mohamad, David Rappaport, Michael A. Greenspan
Generalized 4-Points Congruent Sets for 3D Registration. 3DV (2014)
Jin Akiyama, David Rappaport, Hyunwoo Seong
A decision algorithm for reversible pairs of polygons. Discret. Appl. Math. 178 (2014)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On point-sets that support planar graphs. Comput. Geom. 46 (1) (2013)
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) (2013)
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. Graph Drawing (2012)
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) (2012)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On Point-Sets That Support Planar Graphs. Graph Drawing (2011)
David Rappaport, Godfried T. Toussaint, Mustafa Mohamad
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG (2011)
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)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA (2010)
Henk Meijer, David Rappaport
Editorial CCCG 2006. Comput. Geom. 42 (5) (2009)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
An algorithm for computing simple k-factors. Inf. Process. Lett. 109 (12) (2009)
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) (2009)
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) (2009)
Farzad Hassanzadeh, David Rappaport
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. WADS (2009)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
Small weak epsilon-nets. Comput. Geom. 42 (5) (2009)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
Bounds for point recolouring in geometric graphs. Comput. Geom. 42 (6-7) (2009)
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) (2009)
Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
On the Complexity of Point Recolouring in Geometric Graphs. CCCG (2008)
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 (2008)
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
Encompassing colored planar straight line graphs. Comput. Geom. 39 (1) (2008)
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 (2007)
David Rappaport
Maximal Area Sets and Harmony. Graphs Comb. 23 (Supplement-1) (2007)
Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao
Hamilton Circuits in Hexagonal Grid Graphs. CCCG (2007)
Michael Hirsch, Henk Meijer, David Rappaport
Biclique Edge Cover Graphs and Confluent Drawings. Graph Drawing (2006)
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
Moving coins. Comput. Geom. 34 (1) (2006)
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) (2006)
Yurai Núñez Rodríguez, David Rappaport
Tight Bounds for Point Recolouring. CCCG (2006)
Henk Meijer, David Rappaport
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 15 (6) (2005)
Magdalene Grantson, Henk Meijer, David Rappaport
Bi-chromatic minimum spanning trees. EuroCG (2005)
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)
Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport
Closest Segments. CCCG (2005)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
Small weak epsilon nets. CCCG (2005)
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
Encompassing colored crossing-free geometric graphs. CCCG (2004)
Henk Meijer, David Rappaport
Simultaneous edge flips for convex subdivisions. CCCG (2004)
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)
David Rappaport
The visibility graph of congruent discs is Hamiltonian. Comput. Geom. 25 (3) (2003)
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) (2003)
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) (2002)
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)
David Rappaport
Tight Bounds for Visibility Matching of f-Equal Width Objects. JCDCG (2002)
Thomas Fevens, Henk Meijer, David Rappaport
Minimum convex partition of a constrained point set. Discret. Appl. Math. 109 (1-2) (2001)
Kiyoshi Hosono, Henk Meijer, David Rappaport
On the visibility graph of convex translates. Discret. Appl. Math. 113 (2-3) (2001)
Kiyoshi Hosono, David Rappaport, Masatsugu Urabe
On Convex Decompositions of Points. JCDCG (2000)
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)
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) (1998)
Kelly A. Lyons, Henk Meijer, David Rappaport
Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. 2 (1) (1998)
David Rappaport
Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5 (3) (1995)
Paul Colley, Henk Meijer, David Rappaport
Motivating lazy guards. CCCG (1995)
Paul Colley, Henk Meijer, David Rappaport
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG (1994)
Kelly A. Lyons, David Rappaport
An efficient algorithm for identifying objects using robot probes. Vis. Comput. 10 (8) (1994)
David Rappaport, Arnold Rosenbloom
Moldable and Castable Polygons. Comput. Geom. 4 (1994)
Peter Eades, David Rappaport
The complexity of computing minimum separating polygons. Pattern Recognit. Lett. 14 (9) (1993)
Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
Decision Trees for Geometric Models. SCG (1993)
Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
Probing a Set of Hyperplanes by Lines and Related Problems. WADS (1993)
Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
Dominance Drawings of Bipartite Graphs. CCCG (1993)
Kelly A. Lyons, Henk Meijer, David Rappaport
Properties of the voronoi diagram cluster buster. CASCON (1993)
Henk Meijer, David Rappaport
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Inf. Process. Lett. 42 (1) (1992)
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)
David Rappaport
A Convex Hull Algorithm for Discs, and Applications. Comput. Geom. 1 (1991)
David Rappaport, Hiroshi Imai, Godfried T. Toussaint
Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. 5 (1990)
David Rappaport
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SIAM J. Comput. 18 (6) (1989)
David Rappaport
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). WADS (1989)
David Rappaport
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SCG (1987)
David Rappaport, Hiroshi Imai, Godfried T. Toussaint
On Computing Simple Circuits on a Set of Line Segments. SCG (1986)
David Rappaport
A linear algorithm for eliminating hidden-lines from a polygonal cylinder. Vis. Comput. 2 (1) (1986)
David Avis, David Rappaport
Computing the largest empty convex subset of a set of points. SCG (1985)
David Rappaport, Godfried T. Toussaint
A simple linear hidden-line algorithm for star-shaped polygons. Pattern Recognit. Lett. 3 (1) (1985)
Izidor Gertner, David Rappaport
Optimality criteria for controlled discontinous processes. Inf. Sci. 17 (1) (1979)
Izidor Gertner, David Rappaport
Stochastic control of system with unobserved jump parameter process. Inf. Sci. 13 (3) (1977)