Dagstuhl Seminar Proceedings, Volume 9511,

• Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx 09511 Abstracts Collection – Parameterized complexity and approximation algorithms 10.4230/DagSemProc.09511.1
• Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx 09511 Executive Summary – Parameterized complexity and approximation algorithms 10.4230/DagSemProc.09511.2
• Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx 09511 Open Problems – Parameterized complexity and approximation algorithms 10.4230/DagSemProc.09511.3
• Guy Kortsarz and Zeev Nutov Approximating minimum cost connectivity problems 10.4230/DagSemProc.09511.4
• Fedor V. Fomin, Petr Golovach, and Dimitrios M. Thilikos Contraction Bidimensionality: the Accurate Picture 10.4230/DagSemProc.09511.5
• Kunal Talwar, Anupam Gupta, Katrina Ligett, Frank McSherry, and Aaron Roth Differentially Private Combinatorial Optimization 10.4230/DagSemProc.09511.6
• Holger Dell and Dieter van Melkebeek Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses 10.4230/DagSemProc.09511.7