Dagstuhl Seminar Proceedings, Volume 10441,

• Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, and Gregory B. Sorkin 10441 Abstracts Collection – Exact Complexity of NP-hard Problems 10.4230/DagSemProc.10441.1
• David Eppstein, Maarten Löffler, and Darren Strash Listing all maximal cliques in sparse graphs in near-optimal time 10.4230/DagSemProc.10441.2