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, May 31, 2018, 12:15 pm

Duration: 45 minutes

Location: CAB G51

Speaker: Manuel Broechin

Counting Triangulations in Subexponential Time

Given a set S of n points in the plane, a triangulation T of S is a maximal set of non-crossing segments with endpoints in S. In the talk I present an algorithm that computes the number of triangulations on a given set of n points in time n^{O(\sqrt(n)}. This result by Marx and Miltzow from 2016 significantly improves the previous best running time of O(2^n * n^2) by Alvarez and Seidel [SoCG 2013]. The main tool of the algorithm are canonical separators of size O(\sqrt{n}) of a triangulation. The definitions of the separators are based on the decomposition of triangulations into nested cactus layers.


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