Talks by Andrea Francke

2009

May

• May 07, 2009, Andrea Francke: The Euclidean Degree-4 Minimum Spanning Tree Problem is NP-hard [details]

November

• November 24, 2009, Andrea Francke: A simple proof of the upper bound theorem (student talk, 45 min.) [details]

2010

March

• March 18, 2010, Andrea Francke: A Quasioptimum for Linear Programs (Master's Thesis Presentation) [details]

2011

June

• June 28, 2011, Andrea Francke: A Metric Embedding: Ulam Metric into l_1 [details]

2013

February

• February 19, 2013, Andrea Francke: On Perfect Matchings, Counting, Sampling, and Self-Reducibility [details]

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

Previous talks by year:   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.3392   |   admin login