Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{inkulu_et_al:LIPIcs:2019:11507, author = {R. Inkulu and Sanjiv Kapoor}, title = {{Approximate Euclidean Shortest Paths in Polygonal Domains}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {11:111:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771306}, ISSN = {18688969}, year = {2019}, volume = {149}, editor = {Pinyan Lu and Guochuan Zhang}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11507}, URN = {urn:nbn:de:0030drops115075}, doi = {10.4230/LIPIcs.ISAAC.2019.11}, annote = {Keywords: Computational Geometry, Geometric Shortest Paths, Approximation Algorithms} }
Keywords:  Computational Geometry, Geometric Shortest Paths, Approximation Algorithms  
Collection:  30th International Symposium on Algorithms and Computation (ISAAC 2019)  
Issue Date:  2019  
Date of publication:  28.11.2019 