@inproceedings{Eppstein2010, 
     address = "Jeju Island, Korea", 
     author = "Eppstein, David and L\"{o}ffler, M and Strash, Darren", 
     booktitle = "ISAAC 2010: the 21st International Symposium on Algorithms and Computation", 
     doi = "10.1007/978-3-642-17517-6_36", 
     editor = "Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo", 
     keyword = "bron,d -degenerate graphs,fixed-parameter tractability,kerbosch algorithm,maximal clique listing algorithms,sparse graphs", 
     link = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36", 
     month = "dec", 
     pages = "403--414", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Listing all maximal cliques in sparse graphs in near-optimal time", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36", 
     volume = "6506", 
     year = "2010", 
}

Problems: 210