BibTeX record conf/ats/SauerJCPB11

download as .bib file

@inproceedings{DBLP:conf/ats/SauerJCPB11,
  author    = {Matthias Sauer and
               Jie Jiang and
               Alejandro Czutro and
               Ilia Polian and
               Bernd Becker},
  title     = {Efficient SAT-Based Search for Longest Sensitisable Paths},
  booktitle = {Proceedings of the 20th {IEEE} Asian Test Symposium, {ATS} 2011, New
               Delhi, India, November 20-23, 2011},
  pages     = {108--113},
  year      = {2011},
  crossref  = {DBLP:conf/ats/2011},
  url       = {https://doi.org/10.1109/ATS.2011.43},
  doi       = {10.1109/ATS.2011.43},
  timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ats/SauerJCPB11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ats/2011,
  title     = {Proceedings of the 20th {IEEE} Asian Test Symposium, {ATS} 2011, New
               Delhi, India, November 20-23, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {https://ieeexplore.ieee.org/xpl/conhome/6114262/proceeding},
  isbn      = {978-1-4577-1984-4},
  timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ats/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics