David Eppstein, Maarten Löffler, Darren Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin, editors, Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Volume 10441 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2010. [doi]
Abstract is missing.