BibTeX record conf/stacs/BiloCG0PP18

download as .bib file

@inproceedings{DBLP:conf/stacs/BiloCG0PP18,
  author    = {Davide Bil{\`{o}} and
               Keerti Choudhary and
               Luciano Gual{\`{a}} and
               Stefano Leucci and
               Merav Parter and
               Guido Proietti},
  title     = {Efficient Oracles and Routing Schemes for Replacement Paths},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2018, February 28 to March 3, 2018, Caen, France},
  pages     = {13:1--13:15},
  year      = {2018},
  crossref  = {DBLP:conf/stacs/2018},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2018.13},
  doi       = {10.4230/LIPIcs.STACS.2018.13},
  timestamp = {Wed, 25 Sep 2019 18:21:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/BiloCG0PP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2018,
  editor    = {Rolf Niedermeier and
               Brigitte Vall{\'{e}}e},
  title     = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2018, February 28 to March 3, 2018, Caen, France},
  series    = {LIPIcs},
  volume    = {96},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-062-0},
  isbn      = {978-3-95977-062-0},
  timestamp = {Thu, 02 May 2019 17:40:17 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics