BibTeX record conf/dagstuhl/2010P10441

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 13:02:09 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/2010P10441.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.