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 J. Lengler, A. Steger, and D. Steurer)

Mittagsseminar Talk Information

Date and Time: Thursday, December 17, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Emo Welzl

Deep Cliques in Point Sets

Given a set P of n points in general position in the plane, a pair {p,q} of points in P is called k-deep, if there are at least k points from P strictly on each side of the line spanned by p and q. A k-deep clique is a subset of P with all its pairs k-deep. We investigate the minimal and maximal possible size of a maximum k-deep clique of an n-point set.


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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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