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: Tuesday, June 01, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Pavel Valtr (Charles Univ., Prague)

Open caps and cups in planar point sets

We show a result on so-called open caps and cups which implies, for example, that for any k,l every sufficiently large k-convex planar point set contains an empty l-gon (a planar point set is k-convex if it is in general position and no triangle determined by its points contains more than k of its points).


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