November 4. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Quickly Excluding $K_{2,r}$ from Planar Graphs, Dimitrios M. Thilikos.
November 17. Dynamic Set Partitions, Saurabh Sethia, State University of New York at Stony Brook.
November 24. Large empty convex polygons — new developments related to the Erdös-Székeres theorem, Gyula Károlyi, Eötvös University, Budapest.
December 2. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Critical Issues in Design and Implementation of Interconnects for Workstation Clusters, José Duato, Universitat Politècnica de València.
December 22. Intersection graphs of geometric objects, Marc Noy, Dept. MA2, Universitat Politècnica de Catalunya.
January 19. The Thompson group and rooted binary trees, Josep Burillo, Universitat Autònoma de Barcelona.
February 3.LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Tutte polynomials on square grids, Marc Noy, MA2, Universitat Politècnica de Catalunya.
February 16. Packing convex polygons into rectangular boxes, Ferran Hurtado, Dept. MA2, Universitat Politècnica de Catalunya.
February 23. Sweeping Simple Polygons with a Chain of Guards, Joseph S. B. Mitchell, Dept. of Applied Math. and Statistics, State University of New York, Stony Brook.
March 2. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Good characterizations (and hierarchy) of coloring problems, Jaroslav Nesetril, DIMATIA and KAAM Charles University, Praga.
March 8. Triangulation in surface reconstruction, Lyuba Alboul, University of Twente
March 22. Playing with triangulations in the plane, Oswin Aicholzer, Technical Institute of Graz, Austria.
April 6. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Graph labeling, Mirka Miller, Australia.
April 13. The path of a triangulation, Oswin Aicholzer, Technical Institute of Graz, Austria.
April 27. A tight bound for the complexity of Voronoi diagrams for polyhedral convex distance functions in 3D, Christian Icking, FernUniversität-Hagen, Alemanya.
May 4. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): Recent results on untangling unknots in space, Godfried Toussaint, McGill University, Montréal, Canada.
May 25. Geometric Compression for Interactive Transmission, Pierre-Marie Gandoin, INRIA Sophia-Antipolis, France.
May 31. Heuristics for Subdivision Simplification, Regina Estkowski, State University of New York at Stony Brook, USA.
June 1. LIMDA Seminar (Room C4 002, Campus Nord, 14:00h): The subgraph isomorphism disease, Gabriel Valiente, Dept. LSI, Universitat Politècnica de Catalunya.
June 21. Algoritmos y aplicaciones bajo total monotonía, Javier Tejel, Universidad de Zaragoza.
June 28. Approximation algorithms for sparse rectangle tiling, Suneeta Ramaswami, Rutgers University, Camden, New Jersey, USA.