Search dblp for Publications

export results for "toc:db/conf/dagstuhl/P10441.bht:"

 download as .bib file

@proceedings{DBLP:conf/dagstuhl/2010P10441,
  editor       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  title        = {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/portals/10441/},
  timestamp    = {Thu, 10 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2010P10441.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@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}
}

@inproceedings{DBLP:conf/dagstuhl/HusfeldtKPS10,
  author       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  editor       = {Thore Husfeldt and
                  Dieter Kratsch and
                  Ramamohan Paturi and
                  Gregory B. Sorkin},
  title        = {10441 Abstracts Collection - Exact Complexity of NP-hard Problems},
  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/2936/},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.