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: Friday, December 04, 2015, 12:15 pm

Duration: 30 minutes

Location: CAB G11

Speaker: Michael Kaufmann (Universität Tübingen)

Book Embedding Problems from a SAT-Solving Perspective

In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges of the same page do not cross. In 1986, Yannakakis gave a very complicated algorithm for book embedding any given planar graph on four pages. It is open since then, whether four pages are necessary or three pages suffice.

I will present our approach to this problem by means of SAT solving, discuss the (mostly negative) findings and show how we developed new hypotheses that might help to solve this problem and some related ones.


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