BibTeX record conf/dagstuhl/EppsteinLS10

• > Home > conf/dagstuhl/EppsteinLS10

@inproceedings{DBLP:conf/dagstuhl/EppsteinLS10,
  author       = {David Eppstein and
                  Maarten L{\"{o}}ffler and
                  Darren Strash},
  editor       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  title        = {Listing all maximal cliques in sparse graphs in near-optimal time},
  booktitle    = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {10441},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2010},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2011/2935/},
  timestamp    = {Thu, 10 Jun 2021 13:02:09 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/EppsteinLS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}