David Rappaport

93 papers A* 2A 3B 5C 4Misc 1Journal 47Unranked 31

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Maximum Rectilinear Convex Subsets. SIAM J. Comput. Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia
2019	B	`conf`	Maximum Rectilinear Convex Subsets. FCT Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia
2019	J	`jnl`	Maximum rectilinear convex subsets. CoRR Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia
2019	J	`jnl`	State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. Timothy Ng, David Rappaport, Kai Salomaa
2018	A*	`conf`	An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. SoCG Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
2018	J	`jnl`	An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. CoRR Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
2018	J	`jnl`	Routing in a polygonal terrain with the shortest beacon watchtower. Comput. Geom. Bahram Kouhestani, David Rappaport, Kai Salomaa
2018	J	`jnl`	State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. Timothy Ng, David Rappaport, Kai Salomaa
2017	J	`jnl`	Guest Editor's foreword. Comput. Geom. David Rappaport
2017	—	`conf`	Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science Timothy Ng, David Rappaport, Kai Salomaa
2017	C	`conf`	Relative Prefix Distance Between Languages. DLT Timothy Ng, David Rappaport, Kai Salomaa
2017	J	`jnl`	State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. Timothy Ng, David Rappaport, Kai Salomaa
2017	—	`conf`	State Complexity of Suffix Distance. DCFS Timothy Ng, David Rappaport, Kai Salomaa
2017	J	`jnl`	State complexity of prefix distance. Theor. Comput. Sci. Timothy Ng, David Rappaport, Kai Salomaa
2016	—	`conf`	State Complexity of Prefix Distance of Subregular Languages. DCFS Timothy Ng, David Rappaport, Kai Salomaa
2016	—	`conf`	The Length of the Beacon Attraction Trajectory. CCCG Bahram Kouhestani, David Rappaport, Kai Salomaa
2015	J	`jnl`	Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. Graphs Comb. Mustafa Mohamad, David Rappaport, Godfried Toussaint
2015	—	`conf`	On the Inverse Beacon Attraction Region of a Point. CCCG Bahram Kouhestani, David Rappaport, Kai Salomaa
2015	—	`conf`	Quasi-Distances and Weighted Finite Automata. DCFS Timothy Ng, David Rappaport, Kai Salomaa
2015	C	`conf`	State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT Timothy Ng, David Rappaport, Kai Salomaa
2015	C	`conf`	State Complexity of Prefix Distance. CIAA Timothy Ng, David Rappaport, Kai Salomaa
2015	—	`conf`	Super Generalized 4PCS for 3D Registration. 3DV Mustafa Mohamad, Mirza Tahir Ahmed, David Rappaport, Michael A. Greenspan
2014	J	`jnl`	A decision algorithm for reversible pairs of polygons. Discret. Appl. Math. Jin Akiyama, David Rappaport, Hyunwoo Seong
2014	—	`conf`	Generalized 4-Points Congruent Sets for 3D Registration. 3DV Mustafa Mohamad, David Rappaport, Michael A. Greenspan
2014	—	`conf`	Routing in a Polygonal Terrain with the Shortest Beacon Watchtower. CCCG Bahram Kouhestani, David Rappaport, Kai Salomaa
2013	J	`jnl`	Establishing strong connectivity using optimal radius half-disk antennas. Comput. Geom. Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer
2013	J	`jnl`	On point-sets that support planar graphs. Comput. Geom. Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2012	J	`jnl`	Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia
2012	A	`conf`	On Representing Graphs by Touching Cuboids. GD David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides
2011	—	`conf`	Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. CCCG Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer
2011	—	`conf`	Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG David Rappaport, Godfried T. Toussaint, Mustafa Mohamad
2011	A	`conf`	On Point-Sets That Support Planar Graphs. GD Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2010	B	`conf`	Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. SEA Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2009	J	`jnl`	An algorithm for computing simple k-factors. Inf. Process. Lett. Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2009	B	`conf`	Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. WADS Farzad Hassanzadeh, David Rappaport
2009	J	`jnl`	Bounds for point recolouring in geometric graphs. Comput. Geom. Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2009	J	`jnl`	Compatible geometric matchings. Comput. Geom. 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
2009	J	`jnl`	Editorial CCCG 2006. Comput. Geom. Henk Meijer, David Rappaport
2009	J	`jnl`	Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 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
2009	J	`jnl`	Small weak epsilon-nets. Comput. Geom. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
2009	J	`jnl`	The distance geometry of music. Comput. Geom. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2008	J	`jnl`	Compatible Geometric Matchings. Electron. Notes Discret. Math. 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
2008	J	`jnl`	Encompassing colored planar straight line graphs. Comput. Geom. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
2008	—	`conf`	On the Complexity of Point Recolouring in Geometric Graphs. CCCG Henk Meijer, Yurai Núñez Rodríguez, David Rappaport
2007	—	`conf`	Hamilton Circuits in Hexagonal Grid Graphs. CCCG Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao
2007	J	`jnl`	Maximal Area Sets and Harmony. Graphs Comb. David Rappaport
2007	J	`jnl`	The Distance Geometry of Music CoRR Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2006	J	`jnl`	Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2006	A	`conf`	Biclique Edge Cover Graphs and Confluent Drawings. GD Michael Hirsch, Henk Meijer, David Rappaport
2006	J	`jnl`	Moving coins. Comput. Geom. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
2006	—	`conf`	Tight Bounds for Point Recolouring. CCCG Yurai Núñez Rodríguez, David Rappaport
2005	C	`conf`	Bi-chromatic minimum spanning trees. EuroCG Magdalene Grantson, Henk Meijer, David Rappaport
2005	—	`conf`	Closest Segments. CCCG Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport
2005	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Henk Meijer, David Rappaport
2005	—	`conf`	Small weak epsilon nets. CCCG Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
2005	—	`conf`	The Distance Geometry of Deep Rhythms and Scales. CCCG Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2004	—	`conf`	Encompassing colored crossing-free geometric graphs. CCCG Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
2004	—	`conf`	Simultaneous edge flips for convex subdivisions. CCCG Henk Meijer, David Rappaport
2003	—	`conf`	Computing the Similarity of two Melodies. CCCG Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2003	J	`jnl`	The Largest Empty Annulus Problem. Int. J. Comput. Geom. Appl. José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
2003	J	`jnl`	The visibility graph of congruent discs is Hamiltonian. Comput. Geom. David Rappaport
2002	J	`jnl`	Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
2002	Misc	`conf`	The Largest Empty Annulus Problem. International Conference on Computational Science (3) José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
2002	—	`conf`	Tight Bounds for Visibility Matching of f-Equal Width Objects. JCDCG David Rappaport
2001	J	`jnl`	Minimum convex partition of a constrained point set. Discret. Appl. Math. Thomas Fevens, Henk Meijer, David Rappaport
2001	J	`jnl`	On the visibility graph of convex translates. Discret. Appl. Math. Kiyoshi Hosono, Henk Meijer, David Rappaport
2000	—	`conf`	On Convex Decompositions of Points. JCDCG Kiyoshi Hosono, David Rappaport, Masatsugu Urabe
1998	J	`jnl`	Algorithms for Cluster Busting in Anchored Graph Drawing. J. Graph Algorithms Appl. Kelly A. Lyons, Henk Meijer, David Rappaport
1998	J	`jnl`	Decision trees for geometric models. Int. J. Comput. Geom. Appl. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
1998	—	`conf`	Finding specified sections of arrangements: 2d results. CCCG Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
1995	J	`jnl`	Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. David Rappaport
1995	—	`conf`	Motivating lazy guards. CCCG Paul Colley, Henk Meijer, David Rappaport
1994	J	`jnl`	An efficient algorithm for identifying objects using robot probes. Vis. Comput. Kelly A. Lyons, David Rappaport
1994	J	`jnl`	Moldable and Castable Polygons. Comput. Geom. David Rappaport, Arnold Rosenbloom
1994	—	`conf`	Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG Paul Colley, Henk Meijer, David Rappaport
1993	—	`conf`	Decision Trees for Geometric Models. SCG Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
1993	—	`conf`	Dominance Drawings of Bipartite Graphs. CCCG Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
1993	B	`conf`	Probing a Set of Hyperplanes by Lines and Related Problems. WADS Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
1993	—	`conf`	Properties of the voronoi diagram cluster buster. CASCON Kelly A. Lyons, Henk Meijer, David Rappaport
1993	J	`jnl`	The complexity of computing minimum separating polygons. Pattern Recognit. Lett. Peter Eades, David Rappaport
1992	J	`jnl`	Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Inf. Process. Lett. Henk Meijer, David Rappaport
1991	J	`jnl`	A Convex Hull Algorithm for Discs, and Applications. Comput. Geom. David Rappaport
1991	A*	`conf`	The Aquarium Keeper's Problem. SODA Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
1990	J	`jnl`	Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1989	J	`jnl`	Computing Simple Circuits from a Set of Line Segments is NP-Complete. SIAM J. Comput. David Rappaport
1989	B	`conf`	Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). WADS David Rappaport
1987	—	`conf`	Computing Simple Circuits from a Set of Line Segments is NP-Complete. SCG David Rappaport
1986	J	`jnl`	A linear algorithm for eliminating hidden-lines from a polygonal cylinder. Vis. Comput. David Rappaport
1986	—	`conf`	On Computing Simple Circuits on a Set of Line Segments. SCG David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1985	J	`jnl`	A simple linear hidden-line algorithm for star-shaped polygons. Pattern Recognit. Lett. David Rappaport, Godfried T. Toussaint
1985	—	`conf`	Computing the largest empty convex subset of a set of points. SCG David Avis, David Rappaport
1979	J	`jnl`	Optimality criteria for controlled discontinous processes. Inf. Sci. Izidor Gertner, David Rappaport
1977	J	`jnl`	Stochastic control of system with unobserved jump parameter process. Inf. Sci. Izidor Gertner, David Rappaport