BibTeX record conf/sat/AbbasizanjaniK18

download as .bib file

@inproceedings{DBLP:conf/sat/AbbasizanjaniK18,
  author    = {Hoda Abbasizanjani and
               Oliver Kullmann},
  title     = {Minimal Unsatisfiability and Minimal Strongly Connected Digraphs},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
               International Conference, {SAT} 2018, Held as Part of the Federated
               Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
  pages     = {329--345},
  year      = {2018},
  crossref  = {DBLP:conf/sat/2018},
  url       = {https://doi.org/10.1007/978-3-319-94144-8\_20},
  doi       = {10.1007/978-3-319-94144-8\_20},
  timestamp = {Mon, 16 Sep 2019 15:30:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/AbbasizanjaniK18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2018,
  editor    = {Olaf Beyersdorff and
               Christoph M. Wintersteiger},
  title     = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
               International Conference, {SAT} 2018, Held as Part of the Federated
               Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10929},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-94144-8},
  doi       = {10.1007/978-3-319-94144-8},
  isbn      = {978-3-319-94143-1},
  timestamp = {Mon, 16 Sep 2019 15:30:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics