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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, October 28, 2004, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Shakhar Smorodinsky

Let *S* be a family of convex sets in *R ^{d}*. A line

Such orderings of *S* are called geometric permutations.
How many geometric permutations can a given family,
of *n* pairwise disjoint convex sets, have?
This is one of the most challenging open problems in
transversal theory. In this talk we survey some recent
progress in this area.

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