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

Mittagsseminar Talk Information

Date and Time: Tuesday, May 02, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Gábor Fejes Tóth (Hungarian Academy of Sciences)

A short, unconventional introduction to packing and covering

If you ask a mathematician to tell something about his field of research, you probably will learn about the main results of the area. However, you might be more interested in the question: What are the open problems? In my talk, I will give an introduction to the theory of packing and covering through some open problems. I will mention only briefly the ``big problems'' and will concentrate on problems that offer a chance for a solution to anybody with a good idea.

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