The DCCG Computational Geometry Seminar is organized by the UPC Research Group on Discrete, Combinatorial and Computational Geometry (DCCG). The Seminar started its regular sessions at the beginning of the course 1993-1994. Since then, it has been held regularly in the period september-june, with different frecuencies of talks over the years, depending on the flow of visitors and the other activities of the group members. Since its beginning, the seminar has hosted about 300 talks.
The Seminar is fundamentally devoted to the presentation of research results in the area of discrete, combinatorial and algorithmic geometry, paying special attention to problems coming from the engineering fields, particularly from Computer Science. Currently, the seminar has a wide scope, consisting of sessions describing original research by group members or visitors, sessions devoted to the presentation of recently appeared papers, presentations of open problems, or any other topics of interest relevant to the group’s research areas. In the past, the seminar has also hosted monographic courses taught by specialists, in sets of eight or ten sessions.
(Sessions are added as soon as confirmed)
January 22, 2019 (12:15, Omega room S215). Computing optimal shortcuts for networks. Rodrigo I. Silveira (UPC).
Past sessions of current academic year
October 26, 2018 (12:15, Omega room S215). Firefighter Problems and Ant Colony Optimization. Karla García (UNAM).
October 19, 2018 (12:15, Omega room S215). Separating a polyhedron from its single-part mold: Optimal algorithms. Dan Halperin (Tel-Aviv University).
September 14, 2018 (12:15, Omega room S215). Galaxias conservativas. Joaquín Tey
Previous years sessions