BibTeX record conf/isaac/Bilo18

download as .bib file

@inproceedings{DBLP:conf/isaac/Bilo18,
  author       = {Davide Bil{\`{o}}},
  editor       = {Wen{-}Lian Hsu and
                  Der{-}Tsai Lee and
                  Chung{-}Shou Liao},
  title        = {Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees},
  booktitle    = {29th International Symposium on Algorithms and Computation, {ISAAC}
                  2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
  series       = {LIPIcs},
  volume       = {123},
  pages        = {40:1--40:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.40},
  doi          = {10.4230/LIPICS.ISAAC.2018.40},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/Bilo18.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.