BibTeX record conf/isaac/DharHK23

download as .bib file

@inproceedings{DBLP:conf/isaac/DharHK23,
  author       = {Anubhav Dhar and
                  Soumita Hait and
                  Sudeshna Kolay},
  editor       = {Satoru Iwata and
                  Naonori Kakimura},
  title        = {Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex
                  Terminal Sets},
  booktitle    = {34th International Symposium on Algorithms and Computation, {ISAAC}
                  2023, December 3-6, 2023, Kyoto, Japan},
  series       = {LIPIcs},
  volume       = {283},
  pages        = {25:1--25:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.25},
  doi          = {10.4230/LIPICS.ISAAC.2023.25},
  timestamp    = {Tue, 28 Nov 2023 13:22:27 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/DharHK23.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.