Seminar activities 2005-2006

November 16. Bounds on the number of plane graphs. Ferran Hurtado, Universitat Politècnica de Catalunya.

November 23. Some problems on coin graphs. Clara Grima, Universidad de Sevilla

November 30. The geometric thickness of graphs. David Wood, Universitat Politècnica de Catalunya.

December 14. Balanced triangulations of lattice polytopes. Nikolaus Witte, Technische Universität, Berlin

December 21. Lower bounds for separability problems. Carlos Seara, Universitat Politècnica de Catalunya.

February 15. FLIPTOOL. Omer Giménez, Universitat Pompeu Fabra/Universitat Politècnica de Catalunya.

March 8. A binary labelling for plane Laman graphs and quadrangulations. Clemens Huemer, MA2, Universitat Politècnica de Catalunya.

March 15. Bounds on the chromatic number of some flip-graphs. Ruy Fabila and David Flores, Universidad Nacional Autónoma de México.

March 29. Affine mappings for hexahedral mesh generation by sweeping. Xevi Roca, Universitat Politècnica de Catalunya.

April 5. Shortest non-trivial cycles for topologically embedded graphs. Sergio Cabello, Institute for Mathematics, Physics and Mechanics, Ljubljana

May 17. Local Solutions for Global Problems in Wireless Networks. Jorge Urrutia, Universidad Nacional Autónoma de México.

May 24. Geometric thickness and the treewidth of graphs. David Wood, Universitat Politècnica de Catalunya.

May 31On finding widest empty curved corridors. Carlos Seara, Universitat Politècnica de Catalunya.