%0 Conference Paper %1 conf/dagstuhl/EppsteinLS10 %A Eppstein, David %A Löffler, Maarten %A Strash, Darren %B Exact Complexity of NP-hard Problems %D 2010 %E Husfeldt, Thore %E Kratsch, Dieter %E Paturi, Ramamohan %E Sorkin, Gregory B. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany %K dblp %T Listing all maximal cliques in sparse graphs in near-optimal time. %U http://dblp.uni-trier.de/db/conf/dagstuhl/P10441.html#EppsteinLS10 %V 10441

@inproceedings{conf/dagstuhl/EppsteinLS10, added-at = {2018-08-23T00:00:00.000+0200}, author = {Eppstein, David and Löffler, Maarten and Strash, Darren}, biburl = {https://www.bibsonomy.org/bibtex/2ce53ade930ba6fef4f2ee17001e36cec/dblp}, booktitle = {Exact Complexity of NP-hard Problems}, crossref = {conf/dagstuhl/2010P10441}, editor = {Husfeldt, Thore and Kratsch, Dieter and Paturi, Ramamohan and Sorkin, Gregory B.}, ee = {http://drops.dagstuhl.de/opus/volltexte/2011/2935/}, interhash = {bb04b43e9d38f9b3a941019b96b601ec}, intrahash = {ce53ade930ba6fef4f2ee17001e36cec}, keywords = {dblp}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, series = {Dagstuhl Seminar Proceedings}, timestamp = {2024-04-09T10:23:39.000+0200}, title = {Listing all maximal cliques in sparse graphs in near-optimal time.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P10441.html#EppsteinLS10}, volume = 10441, year = 2010 }