Project 2013–2015, Swedish Research Council (Vetenskapsrådet) VR 2012-4730

Thore Husfeldt, Andreas Björklund

Activities

• 2015, Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms, Workshop, Nov. 2 – Nov. 6, 2015, UC Berkeley (Husfeldt, organizer).
• 2015, invited long-term visitor, Fine-Grained Complexity and Algorithm Design, Simons Institute for the Theory of Computing, UC Berkeley (Husfeldt).
• 2015, Program Committee chair, International Symposium on Parameterized and Exact Computation 2015 (Husfeldt).
• 11–16 August 2013, Dagstuhl Seminar 13331, Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time. (Husfeldt, organizer.)
• 2013–2015, Steering Committee, International Symposium on Parameterized and Exact Computation. (Husfeldt, member.)
• 2013, Program Committee, International Symposium on Parameterized and Exact Computation 2013. (Björklund, member.)