BibTeX record conf/stacs/KirousisK01

download as .bib file

@inproceedings{DBLP:conf/stacs/KirousisK01,
  author       = {Lefteris M. Kirousis and
                  Phokion G. Kolaitis},
  editor       = {Afonso Ferreira and
                  Horst Reichel},
  title        = {The Complexity of Minimal Satisfiability Problems},
  booktitle    = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
                  Science, Dresden, Germany, February 15-17, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2010},
  pages        = {407--418},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44693-1\_36},
  doi          = {10.1007/3-540-44693-1\_36},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KirousisK01.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.