|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 62 publication records. Showing 62 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | David Rappaport, Godfried T. Toussaint, Mustafa Mohamad |
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, William Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath |
On Point-Sets That Support Planar Graphs. |
Graph Drawing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
An algorithm for computing simple k-factors. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky |
Small weak epsilon-nets. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
Bounds for point recolouring in geometric graphs. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Editorial CCCG 2006. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Farzad Hassanzadeh, David Rappaport |
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment |
| 1 | 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. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth |
Encompassing colored planar straight line graphs. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
On the Complexity of Point Recolouring in Geometric Graphs. |
CCCG |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao |
Hamilton Circuits in Hexagonal Grid Graphs. |
CCCG |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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. |
Computer Music Journal |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel |
Moving coins. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yurai Núñez Rodríguez, David Rappaport |
Tight Bounds for Point Recolouring. |
CCCG |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Hirsch, Henk Meijer, David Rappaport |
Biclique Edge Cover Graphs and Confluent Drawings. |
Graph Drawing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Guest Editors' Foreword. |
Int. J. Comput. Geometry Appl. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara |
Small weak epsilon nets. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Kathryn Duffy, Chris McAloney, Henk Meijer, David Rappaport |
Closest Segments. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Magdalene Grantson, Henk Meijer, David Rappaport |
Bi-chromatic minimum spanning trees. |
EuroCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Simultaneous edge flips for convex subdivisions. |
CCCG |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth |
Encompassing colored crossing-free geometric graphs. |
CCCG |
2004 |
DBLP BibTeX RDF |
|
| 1 | David Rappaport |
The visibility graph of congruent discs is Hamiltonian. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint |
Computing the Similarity of two Melodies. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport |
Tight Bounds for Visibility Matching of f-Equal Width Objects. |
JCDCG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Fevens, Henk Meijer, David Rappaport |
Minimum convex partition of a constrained point set. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Hosono, Henk Meijer, David Rappaport |
On the visibility graph of convex translates. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Hosono, David Rappaport, Masatsugu Urabe |
On Convex Decompositions of Points. |
JCDCG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kelly A. Lyons, Henk Meijer, David Rappaport |
Algorithms for Cluster Busting in Anchored Graph Drawing. |
J. Graph Algorithms Appl. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena |
Decision trees for geometric models. |
Int. J. Comput. Geometry Appl. |
1998 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | David Rappaport |
Minimum polygon transversals of line segments. |
Int. J. Comput. Geometry Appl. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Kelly A. Lyons, David Rappaport |
An efficient algorithm for identifying objects using robot probes. |
The Visual Computer |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport, Arnold Rosenbloom |
Moldable and Castable Polygons. |
Comput. Geom. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Colley, Henk Meijer, David Rappaport |
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. |
CCCG |
1994 |
DBLP BibTeX RDF |
|
| 1 | Peter Eades, David Rappaport |
The complexity of computing minimum separating polygons. |
Pattern Recognition Letters |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena |
Decision Trees for Geometric Models. |
Symposium on Computational Geometry |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides |
Dominance Drawings of Bipartite Graphs. |
CCCG |
1993 |
DBLP BibTeX RDF |
|
| 1 | Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport |
Probing a Set of Hyperplanes by Lines and Related Problems. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Kelly A. Lyons, Henk Meijer, David Rappaport |
Properties of the voronoi diagram cluster buster. |
CASCON |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport |
A Convex Hull Algorithm for Discs, and Applications. |
Comput. Geom. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint |
Computing Simple Circuits form a Set of Line Segments. |
Discrete & Computational Geometry |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport |
Computing Simple Circuits from a Set of Line Segments is NP-Complete. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport |
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). |
WADS |
1989 |
DBLP BibTeX RDF |
|
| 1 | David Rappaport |
Computing Simple Circuits from a Set of Line Segments is NP-Complete. |
Symposium on Computational Geometry |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport |
A linear algorithm for eliminating hidden-lines from a polygonal cylinder. |
The Visual Computer |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint |
On Computing Simple Circuits on a Set of Line Segments. |
Symposium on Computational Geometry |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | David Avis, David Rappaport |
Computing the largest empty convex subset of a set of points. |
Symposium on Computational Geometry |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Izidor Gertner, David Rappaport |
Optimality criteria for controlled discontinous processes. |
Inf. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Izidor Gertner, David Rappaport |
Stochastic control of system with unobserved jump parameter process. |
Inf. Sci. |
1977 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #62 of 62 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")