BibTeX record conf/isaac/0001A16a

download as .bib file

@inproceedings{DBLP:conf/isaac/0001A16a,
  author       = {Eunjin Oh and
                  Hee{-}Kap Ahn},
  editor       = {Seok{-}Hee Hong},
  title        = {A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree},
  booktitle    = {27th International Symposium on Algorithms and Computation, {ISAAC}
                  2016, December 12-14, 2016, Sydney, Australia},
  series       = {LIPIcs},
  volume       = {64},
  pages        = {59:1--59:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.59},
  doi          = {10.4230/LIPICS.ISAAC.2016.59},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/0001A16a.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.