- Minimum Convex Partition of a Constrained Point Set Thomas Fevens Henk Meijer David Rappaport
- Maximal Area Sets and Harmony David Rappaport1
- Not Being (Super)Thin or Solid is Hard: A Study of Grid Hamiltonicity
- On Convex Decompositions of Points Kiyoshi Hosono 1 , David Rappaport 2 , and Masatsugu Urabe 1
- Mathematical Measures of Syncopation F. Gomez A. Melvin
- Motivating Lazy Guards Paul Colley, Henk Meijer, David Rappaport
- Dominance Drawings of Bipartite Graphs \Lambda Peter Eades (1) Hossam ElGindy (1) Michael Houle (1) Bill Lenhart (2)
- Measuring the error of linear separators on linearly inseparable data
- The Visibility Graph of Congruent Discs is Hamiltonian David Rappaport
- Tight Bounds for Visibility Matching of f-Equal Width Objects
- The largest empty annulus problem J. M. Diaz-Ba~nez(1)
- ON COMPUTING SIMPLE CIRCUITS ON A SET OF LINE SEGMENTS
- COMPUTING SIMPLE CIRCUITS FROM A SET OF LINE SEGMENTS IS NP-COMPLETE
- Minimum Weight Convex Quadrangulation of a Constrained Point Set
- Geometry and Harmony David Rappaport
- Probing a Set of Hyperplanes by Lines and Related Problems Yasukazu Aoki \Lambda , Hiroshi Imai \Lambda , Keiko Imai y and David Rappaport z
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- Optimal NearlySimilar Polygon Stabbers of Convex Polygons Extended Abstract
- Bounds for Point Recolouring in Geometric Graphs Henk Meijer
- The Aquarium Keeper's Problem* Jurek Czyzowiczt Peter Egyed$ Hazel EvereW
- An Algorithm for Computing Simple k-Factors Henk Meijer
- An Efficient Algorithm Identifying Objects Using Robot Probes
- Musical Scales, Integer Partitions, Necklaces, and Polygons David Rappaport
- Moving Coins Manuel Abellanas1
- Moldable and Castable Polygons \Lambda Arnold Rosenbloom and David Rappaport y
- CCCG 2006, Kingston, Ontario, August 1416, 2006 Tight Bounds for Point Recolouring
