BibTeX record conf/dagstuhl/DellM09

download as .bib file

@inproceedings{DBLP:conf/dagstuhl/DellM09,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  editor    = {Erik D. Demaine and
               MohammadTaghi Hajiaghayi and
               D{\'{a}}niel Marx},
  title     = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
               Hierarchy Collapses},
  booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09511},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2504/},
  timestamp = {Thu, 23 Aug 2018 15:56:28 +0200},
  biburl    = {https://dblp.org/rec/conf/dagstuhl/DellM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics