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},
  editor       = {Nicolas Ollinger and
                  Heribert Vollmer},
  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},
  series       = {LIPIcs},
  volume       = {47},
  pages        = {18:1--18:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2016.18},
  doi          = {10.4230/LIPICS.STACS.2016.18},
  timestamp    = {Thu, 23 Jun 2022 19:57:31 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BiloG0P16.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.