ALBCOM Seminar on Algorithms and Theory of Computation
March 27 @ 10:00 am - March 30 @ 1:00 pm
Course: Algorithms on topologically structured graphs
Dates: Monday, March 27 to Thursday March 30, 2017
Time: 10h00 to 13h00
Where: S215 (floor -2), Omega Building, Campus Nord, UPC
Lecturer: Dimitrios M. Thilikos, AlGCo project, CNRS, LIRMM, France
Abstract: Structural theorems in graph theory indicate that several combinatorial problems on graphs become tractable when their inputs satisfy certain topological characteristics (i.e., planarity, tree-likeness, minor exclusion). In this course we present core results and concepts in structural graph theory and, based on them, we present core techniques of algorithmic design on topologically structured graphs and well as their applications to approximation algorithms and parameterized computation.