AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:21:27
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
2001 Spring Southeastern Section Meeting
Columbia, SC, March 1618, 2001
Meeting #963
Associate secretaries:
John L Bryant, AMS
bryant@math.fsu.edu
Special Session on Discrete and Computational Geometry and Graph Drawing

Friday March 16, 2001, 8:30 a.m.11:20 a.m.
Special Session on Discrete and Computational Geometry and Graph Drawing, I
Room 431, Gambrell Hall
Organizers:
Farhad Shahrokhi, University of North Texas
Laszlo A. Szekely, University of South Carolina, Columbia laszlo@math.sc.edu

8:30 a.m.
Geometric Inclusion Orders.
William T. Trotter*, Arizona State University
(9630672)

9:30 a.m.
Point Pattern Matching and Almost Congruent Subsets.
Peter Brass*, Free University, Berlin
(9635256)

10:00 a.m.
The number of directions determined by points in the threedimensional Euclidean space.
Aart Blokhuis, Technical University of Technology
\'Akos Seress*, The Ohio State University, Columbus, Ohio
(9635270)

10:30 a.m.
Crossings in geometric complete graphs.
Heiko Harborth*, Techn. Univ. Braunschweig, Germany
(9630519)

11:00 a.m.
Unit chords of a convex domain.
Bernardo M. \'Abrego, Rutgers University
Silvia Fern\'andez*, Rutgers University
(9635276)

Friday March 16, 2001, 2:30 p.m.5:20 p.m.
Special Session on Discrete and Computational Geometry and Graph Drawing, II
Room 431, Gambrell Hall
Organizers:
Farhad Shahrokhi, University of North Texas
Laszlo A. Szekely, University of South Carolina, Columbia laszlo@math.sc.edu

2:30 p.m.
Cutting Circles into Pseudosegments and Improved Bounds for Incidences.
Boris Aronov, Polytechnic University
Micha Sharir*, Tel Aviv University
(9630560)

3:30 p.m.
Some Remarks on Combinatorial Geometry and Additive Number Theory.
Gy\"orgy Elekes*, E\"otv\"os University, Budapest
Imre Z. Ruzsa, R\'enyi Institute, Budapest
(9635284)

4:00 p.m.
Contact graphs of translative packings of convex discs in the plane.
Konrad J Swanepoel*, University of South Africa
(9635259)

4:30 p.m.
On Curves Morphings.
Alon Efrat*, University of Arizona
(9636882)

5:00 p.m.
Almost disjoint triangles in 3space  On a problem of Gil Kalai.
Gyula A Karolyi*, Eotvos University, Budapest
(9635268)

Saturday March 17, 2001, 8:30 a.m.10:20 a.m.
Special Session on Discrete and Computational Geometry and Graph Drawing, III
Room 431, Gambrell Hall
Organizers:
Farhad Shahrokhi, University of North Texas
Laszlo A. Szekely, University of South Carolina, Columbia laszlo@math.sc.edu

8:30 a.m.
Topological Persistence and Simplification.
Herbert Edelsbrunner*, Duke University
David Letscher, Oklahoma State University
Afra Zomorodian, Stanford University
(96305211)

9:30 a.m.
Visibility Graphs of Simple Polygons.
James Abello*, AT\&T Shannon Laboratories
(9635235)

10:00 a.m.
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.
Guy Even*, Tel Aviv Univ.
Sudipto Guha, AT\&T Labs
Baruch Schieber, IBM T. J. Watson Research Center
(9636824)

Saturday March 17, 2001, 3:00 p.m.5:20 p.m.
Special Session on Discrete and Computational Geometry and Graph Drawing, IV
Room 431, Gambrell Hall
Organizers:
Farhad Shahrokhi, University of North Texas
Laszlo A. Szekely, University of South Carolina, Columbia laszlo@math.sc.edu

3:00 p.m.
Disentangling a polygon.
Janos Pach*, Courant Institute, NYU
Gabor Tardos, Renyi Institute, Hungarian Academy of Science
(9630536)

4:00 p.m.
Drawing Series Parallel Digraphs Symmetrically in Three Dimensions.
Seokhee Hong*, University of Sydney
Peter Eades, University of Sydney
(9636857)

4:30 p.m.
A multidimensional approach to forcedirected layouts of large graphs.
Pawel Gajer, Johns Hopkins University
Michael T Goodrich, Johns Hopkins University
Stephen G Kobourov*, University of Arizona
(9636821)

5:00 p.m.
A framework for the visualization of networks.
Janet M. Six, University of Texas at Dallas
Ionnis G. Tollis*, University of Texas at Dallas
(9636879)

Sunday March 18, 2001, 9:30 a.m.11:20 a.m.
Special Session on Discrete and Computational Geometry and Graph Drawing, V
Room 431, Gambrell Hall
Organizers:
Farhad Shahrokhi, University of North Texas
Laszlo A. Szekely, University of South Carolina, Columbia laszlo@math.sc.edu

9:30 a.m.
String representations of graphs.
J\'anos Pach, NYU and Hungarian Academy of Sciences
G\'eza T\'oth*, MIT and Hungarian Academy of Sciences
(9635237)

10:00 a.m.
GallaiSylvester theorem for unit circles in the plane.
Rom Pinchasi*, Hebrew University of Jerusalem
(9635283)

10:30 a.m.
A sufficient condition for the existence of large empty convex polygons.
Pavel Valtr*, Charles University, Prague, Czech Republic
(96352151)

11:00 a.m.
Distances in finite point sets in the plane.
Jozsef Solymosi*, ETH Zurich
(9635269)
Inquiries: meet@ams.org