BibTeX record conf/isaac/BiloCG0P17

download as .bib file

@inproceedings{DBLP:conf/isaac/BiloCG0P17,
  author       = {Davide Bil{\`{o}} and
                  Feliciano Colella and
                  Luciano Gual{\`{a}} and
                  Stefano Leucci and
                  Guido Proietti},
  editor       = {Yoshio Okamoto and
                  Takeshi Tokuyama},
  title        = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree
                  Spanner},
  booktitle    = {28th International Symposium on Algorithms and Computation, {ISAAC}
                  2017, December 9-12, 2017, Phuket, Thailand},
  series       = {LIPIcs},
  volume       = {92},
  pages        = {14:1--14:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.14},
  doi          = {10.4230/LIPICS.ISAAC.2017.14},
  timestamp    = {Thu, 23 Jun 2022 19:55:22 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BiloCG0P17.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.