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, September 22, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: József Beck (Rutgers Univ.)

Every finite point set in the plane is a Weak Winner!

Two players, Red and Blue alternately mark points on the plane. Red colors his points red and Blue colors his points blue. Red's objective is to build a congruent red copy of a given goal set, say a regular hexagon of side length 1. Can Red do it or not? What happens if the regular hexagon is replaced by a regular 17-gon of side length 1? The subject of my talk is to answer these questions.

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