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 16-18, 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
      (963-06-72)
    • 9:30 a.m.
      Point Pattern Matching and Almost Congruent Subsets.
      Peter Brass*, Free University, Berlin
      (963-52-56)
    • 10:00 a.m.
      The number of directions determined by points in the three-dimensional Euclidean space.
      Aart Blokhuis, Technical University of Technology
      \'Akos Seress*, The Ohio State University, Columbus, Ohio
      (963-52-70)
    • 10:30 a.m.
      Crossings in geometric complete graphs.
      Heiko Harborth*, Techn. Univ. Braunschweig, Germany
      (963-05-19)
    • 11:00 a.m.
      Unit chords of a convex domain.
      Bernardo M. \'Abrego, Rutgers University
      Silvia Fern\'andez*, Rutgers University
      (963-52-76)
  • 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 Pseudo-segments and Improved Bounds for Incidences.
      Boris Aronov, Polytechnic University
      Micha Sharir*, Tel Aviv University
      (963-05-60)
    • 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
      (963-52-84)
    • 4:00 p.m.
      Contact graphs of translative packings of convex discs in the plane.
      Konrad J Swanepoel*, University of South Africa
      (963-52-59)
    • 4:30 p.m.
      On Curves Morphings.
      Alon Efrat*, University of Arizona
      (963-68-82)
    • 5:00 p.m.
      Almost disjoint triangles in 3-space -- On a problem of Gil Kalai.
      Gyula A Karolyi*, Eotvos University, Budapest
      (963-52-68)
  • 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
      (963-05-211)
    • 9:30 a.m.
      Visibility Graphs of Simple Polygons.
      James Abello*, AT\&T Shannon Laboratories
      (963-52-35)
    • 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
      (963-68-24)
  • 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
      (963-05-36)
    • 4:00 p.m.
      Drawing Series Parallel Digraphs Symmetrically in Three Dimensions.
      Seokhee Hong*, University of Sydney
      Peter Eades, University of Sydney
      (963-68-57)
    • 4:30 p.m.
      A multi-dimensional approach to force-directed layouts of large graphs.
      Pawel Gajer, Johns Hopkins University
      Michael T Goodrich, Johns Hopkins University
      Stephen G Kobourov*, University of Arizona
      (963-68-21)
    • 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
      (963-68-79)
  • 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
      (963-52-37)
    • 10:00 a.m.
      Gallai-Sylvester theorem for unit circles in the plane.
      Rom Pinchasi*, Hebrew University of Jerusalem
      (963-52-83)
    • 10:30 a.m.
      A sufficient condition for the existence of large empty convex polygons.
      Pavel Valtr*, Charles University, Prague, Czech Republic
      (963-52-151)
    • 11:00 a.m.
      Distances in finite point sets in the plane.
      Jozsef Solymosi*, ETH Zurich
      (963-52-69)
Inquiries:  meet@ams.org


American Mathematical Society