DIMACS Workshop on Geometric Graph Theory
September 30 - October 4, 2002
DIMACS Center, Rutgers University, Piscataway, New Jersey
- Organizer:
- Janos Pach, City College and Courant Institute, New York, pach@cims.nyu.edu
Presented under the auspices of the Special Focus on Computational Geometry and Applications.
Slides and presentation files:
- Peter Brass, City College, New York: Convex geometric hypergraphs (PostScript flie).
- Adrian Dumitrescu, University of Wisconsin, Milwaukee: On the maximum
multiplicity of some extreme geometric configurations in the plane (PostScript file).
- Hubert de Fraysseix, EHESS, Paris: Automorphisms and isometries of
graphs (PostScript file).
- Van Vu Ha, University of California, Davis: The geometry of random
objects (DVI file).
- Martin Juvan, University of Ljubljana: Planar graphs without cycles of
specific lengths (PostScript file).
- Mikio Kano, Ibaraki University, Hitachi: Non-crossing geometric paths
covering red and blue points in the plane (PowerPoint
Slides).
- Stephen G. Kobourov, University of Arizona: Simultaneous Embedding of
a Planar Graph and Its Dual on the Grid (PDF
file).
- Hiroshi Maehara, University of the Ryukyus, Okinawa: A condition for
the union of spherical caps to be connected (PostScript file).
- Shakhar Smorodinsky, Tel Aviv University: On conflict free coloring of
discs in the plane (PowerPoint slides).
- Daniel Stefankovic, University of Chicago: Deciding string graphs in NP
(PowerPoint file).
- Laszlo Szekely, University of South Carolina, Columbia: Crossing
numbers and biplanar crossing numbers (PostScript
file).
- Takeshi Tokuyama, Tohoku University, Sendai: How to reform a terrain
into a pyramid (PowerPoint file).
- Uli Wagner, ETH Zurich: Rectilinear crossing number of complete graphs
(PostScript file).