Algorithmic and Combinatorial Geometry June 14, 2009

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:

1. Pankaj Agarwal (Duke University)


2. Alexander Barvinok (University of Michigan)


3. Jiří Matoušek (Charles University, Prague)


4. Günter Rote (Freie Universität, Berlin)


5. Francisco Santos (University of Cantabria)


6. Micha Sharir (Tel Aviv University)


7. Gábor Tardos (Simon Fraser University)


8. Takeshi Tokuyama (Tohoku University)


9. Jorge Urrutia (Universidad Nacional Autónoma de México)


10. Emo Welzl (ETH Zürich)

Conference information provided by konferenciakalauz.hu

Official Website: http://www.renyi.hu/~geza/CONF/