Invited Talk
Ramamohan Paturi (University of California, San Diego, USA) EATCS-IPEC Nerode Prize 2013
Exact Complexity and Satisfiability
Invited Tutorials
Marek Cygan (University of Warsaw, Poland)
Graph Problems Parameterized by Treewidth
Daniel Lokshtanov (University of Bergen, Norway)
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
|