Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 28, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Emo Welzl

On the Number of Crossing-Free Geometric Graphs (Triangulations)

I present the proof of a bound of 59n on the number of triangulations a set of n points in the plane can have, due to Francisco Santos and Raimund Seidel, ``A better upper bound on the number of triangulations of a planar point set'', J. Comb. Theory, Ser. A, 102 (2003), 186-193.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login