Algorithms Seminar and Problem Solving Session

The algorithms seminar focuses on current topics in theoretical computer science, including algorithms and data structures, computational geometry, graph theory, and computational complexity.
Speaker Tobias Muller, Technische Universiteit Eindhoven
Title Circular choosability
Date 4:00PM, Wednesday, September 17th, 2008
Place McConnell 320
Abstract The circular choosability of a graph is a list-version of the circular chromatic number that was introduced by Mohar in 2002 and has since been studied by a number of authors. I will give an overview of known results and open problems in circular choosability.