BibTeX record conf/isaac/InkuluK19

download as .bib file

@inproceedings{DBLP:conf/isaac/InkuluK19,
  author       = {R. Inkulu and
                  Sanjiv Kapoor},
  editor       = {Pinyan Lu and
                  Guochuan Zhang},
  title        = {Approximate Euclidean Shortest Paths in Polygonal Domains},
  booktitle    = {30th International Symposium on Algorithms and Computation, {ISAAC}
                  2019, December 8-11, 2019, Shanghai University of Finance and Economics,
                  Shanghai, China},
  series       = {LIPIcs},
  volume       = {149},
  pages        = {11:1--11:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.11},
  doi          = {10.4230/LIPICS.ISAAC.2019.11},
  timestamp    = {Thu, 28 Nov 2019 16:25:44 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/InkuluK19.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.