DIMACS Center, Rutgers University, Piscataway, New Jersey

**Organizer:****Janos Pach**, City College and Courant Institute, New York, pach@cims.nyu.edu

Title: The majority rule and geometry

Helmut Alt, Freie Universitat, BerlinTitle: The complexity of (un)folding

Boris Aronov, Polytechnic University, BrooklynTitle: Incidences problems: some history and new developments

Imre Barany, Renyi Institute and Univ. College LondonTitle: The minimum area convex lattice n-gon

Peter Brass, City College, New YorkTitle: Convex Geometric Hypergraphs

Timothy M. Chan, University of WaterlooTitle: An algorithmic application of the concave-chain decomposition

Tamal K. Dey, Ohio State University, ColumbusTitle: Counting triangulations using crossings in geometric graphs

Adrian Dumitrescu, University of Wisconsin, MilwaukeeTitle: On the Maximum Multiplicity of Some Extreme Geometric Configurations in the Plane

Hubert de Fraysseix, EHESS, ParisTitle: Automorphisms and Isometries of Graphs

Subir Kumar Gosh, Tata Institute of Fundamental ResearchTitle: Recognizing visibility graphs of simple polygons

Van Vu Ha, University of California, DavisTitle: The geometry of random objects

Robert Jamison, Clemson UniversityTitle: Bigraceful labelings of trees

Martin Juvan, University of LjubljanaTitle: Planar graphs without cycles of specific lengths

Mikio Kano, Ibaraki University, HitachiTitle: Alternating no-crossing geometric paths that cover red and blue points in the plane

Gyula Karolyi, Eotvos University, BudapestTitle: Geometric graph Ramsey numbers

Stephen G. Kobourov, University of Arizona, TucsonTitle: Simultaneous embedding of planar graphs

Title: Cutting cycles of lines in space

Alexander Kostochka, University of Illinois, UrbanaTitle: Coloring intersection graphs of geometric figures with no large cliques

Jan Kratochvil, Charles University, PragueTitle: A survey of new results and old problems in geometric intersection graphs

Yaakov Kupitz, Hebrew University, JerusalemTitle: Extremal problems on the diameter graph of a finite set in $R^d$

Vladim Lozin, RUTCOR, Rutgers University

Hiroshi Maehara, University of Ryukyus, OkinawaTitle: A condition for the union of spherical caps to be connected

Jiri Matousek, Charles University, PragueTitle: Problems and results on pair crossing number

Sean McGuinness, Umea UniversitetTitle: Bounding the chromatic number of intersection graphs of arcwise connected sets in the plane

Bojan Mohar, University of LjubljanaTitle: The genus of graphs on a fixed nonorientable surface

Janos Pach, Renyi Institute and City College, New YorkTitle: Crossroads in Flatland - Toward a theory of geometric graphs

Micha Perles, Hebrew University, JerusalemTitle: Simple spanning forests in geometric graphs

Title: Almost planar topological graphs

Richard Pollack, Courant Institute, NYUTitle: On the Betti numbers of semi-algebraic sets

Rados Radoicic, MIT, CambridgeTitle: Geometric graphs with no self-intersecting cycle of length 4

Paul Seymour, Princeton UniversityTitle: Strong perfect graph theorem

Farhad Shahrokhi, University of North TexasTitle: On pseudo-transitive graphs

Micha Sharir, Tel Aviv University and Courant InstituteTitle: New bounds on incidences and related problems

Shakhar Smorodinsky, Tel Aviv UniversityTitle: On conflict free coloring of discs in the plane

Joel Spencer, Courant Institute, NYUTitle: Crossing numbers for random graphs

Daniel Stefankovic, University of ChicagoTitle: Deciding string graphs in NP

William SteigerandMario Szegedy, Rutgers UniversityTitle: Long x-monotone paths in line arrangements

Laszlo A. Szekely, University of South Carolina, ColumbiaTitle: Crossing numbers and biplanar crossing numbers

Endre Szemeredi, Rutgers UniversityTitle: An elementary method in combinatorial number theory

Gabor Tardos, Renyi Institute, BudapestTitle: Geometric graphs without short self-intersecting paths

Much of this research is joint work with Janos Pach, Rom Pinchasi and Geza Toth.

Takeshi Tokuyama, Tohoku University, SendaiTitle: How to reform a terrain into a pyramid

Geza Toth, Renyi Institute, BudapestTitle: How many drawings are there?

Pavel Valtr, Charles University, PragueTitle: Turán-type Results for Convex Geometric Graphs

Next: Call for Participation

Workshop Index

DIMACS Homepage

Contacting the Center

Document last modified on September 19, 2002.