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, December 08, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Miloš Stojaković (University of Novi Sad)

Convex lattice polygons with small perimeter

A convex lattice polygon is a (strictly) convex polygon in the plane whose vertices are in the integer grid. Of all convex lattice polygons with n vertices, we are interested in those with minimal perimeter: What is their diameter, what is their perimeter? What do they look like when n is large? Are they kind of roundish...?


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