William Blake: Newton
Announcement
On the 20th anniversary of the first Hungarian meeting on
this subject, which was held in Visegrad, the Renyi Institute
of the Hungarian Academy of Sciences organizes a Conference
on Algorithmic and Combinatorial Geometry in Budapest, June
15-19, 2009. (Note that this is the week immediately
following the Annual ACM Symposium on Computational
Geometry, to be held in Aaarhus, Denmark.)
The aim of the conference is to enhance the interaction
between the study of purely combinatorial properties of
geometric structures and the design and analysis of
efficient algorithms for constructing and manipulating
them.
Most of the program will
consist of invited lectures, surveying recent developments
in core areas of Algorithmic and Combinatorial Geometry,
with special emphasis on interactions with other parts of
mathematics and computer science.
Speakers
- Pankaj Agarwal (Duke University)
- Alexander Barvinok (University of Michigan)
- Sariel Har-Peled (University of Illinois at Urbana-Champaign)
- Andreas Holmsen (Korea Advanced Institute of Science and Technology)
- Jiří Matoušek (Charles University, Prague)
- Luis Montejano (Universidad Nacional Autónoma de México)
- Günter Rote (Freie Universität, Berlin)
- Francisco Santos (University of Cantabria)
- Shakhar Smorodinsky (Ben-Gurion University)
- Micha Sharir (Tel Aviv University)
- József Solymosi (University of British Columbia)
- Daniel Štefankovič (University of Rochester)
- László Székely (University of South Carolina)
- Gábor Tardos (Simon Fraser University)
- Takeshi Tokuyama (Tohoku University)
- Csaba D. Tóth (University of Calgary)
- Emo Welzl (ETH Zürich)
- Günter Ziegler (Technische Universität Berlin)