September 12. (Room S217) Vertex colorings in regular tournaments. Bernardo Llano, Universidad Autónoma Metropolitana, México D.F.
September 26. (Room S217, 13:05) Compatible configurations. Ferran Hurtado, MA2, Universitat Politècnica de Catalunya.
October 3. (Room S217) Minimum Color Spanning Monotone Polygonal Chains. Inmaculada Ventura, Universidad de Sevilla.
October 10. (Room S217) Geometry and Harmony. David Rappaport, Queen’s University, Kingston, Canada.
October 24. (Room S217) Compatible Geometric Matchings. David Wood, MA2, Universitat Politècnica de Catalunya.
November 7. (Room S217) Compatible Geometric Trees. Alfredo García Olaverri, Universidad de Zaragoza.
March 5. (Room S217) A lower bound on the area of a 3-coloured disk packing. Ferran Hurtado, MA2, Universitat Politècnica de Catalunya.
March 12. (Room S217) A graph-theoretic generalisation of three famous problems in combinatorial geometry. David Wood, MA2, Universitat Politècnica de Catalunya.
March 26. (Room S217) Moving points to reach linear separability. Carlos Seara, MA2, Universitat Politècnica de Catalunya.
April 2. (Room S217) Good-Visibility Maps. Narcís Madern, Universitat de Girona.
April 30. (Room S217) Linkages in Polytope Graphs. Ronald Wotzlaw, Technische Universität Berlin.
May 7. (Room S217) Reconfiguration of cube-style modular robots. Vera Sacristán, MA2, Universitat Politècnica de Catalunya.
May 14. (Room S217) Structural and graph theoretic properties of higher order Delaunay graphs. Jordi Montserrat, Universitat Politècnica de Catalunya.
June 4. (Room S217) Rectilinear crossing number, halving edges, and at most k-sets. Bernardo M. Ábrego, California State University Northridge.