BibTeX record conf/stacs/BiloG0P16

download as .bib file

@inproceedings{DBLP:conf/stacs/BiloG0P16,
  author    = {Davide Bil{\`{o}} and
               Luciano Gual{\`{a}} and
               Stefano Leucci and
               Guido Proietti},
  title     = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees},
  booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
               2016, February 17-20, 2016, Orl{\'{e}}ans, France},
  pages     = {18:1--18:14},
  year      = {2016},
  crossref  = {DBLP:conf/stacs/2016},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2016.18},
  doi       = {10.4230/LIPIcs.STACS.2016.18},
  timestamp = {Thu, 02 May 2019 17:40:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/BiloG0P16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2016,
  editor    = {Nicolas Ollinger and
               Heribert Vollmer},
  title     = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
               2016, February 17-20, 2016, Orl{\'{e}}ans, France},
  series    = {LIPIcs},
  volume    = {47},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-001-9},
  isbn      = {978-3-95977-001-9},
  timestamp = {Thu, 02 May 2019 17:40:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics