Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{chen_et_al:LIPIcs:2013:3942, author = {Danny Z. Chen and Haitao Wang}, title = {{L_1 Shortest Path Queries among Polygonal Obstacles in the Plane}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {293304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897507}, ISSN = {18688969}, year = {2013}, volume = {20}, editor = {Natacha Portier and Thomas Wilke}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3942}, URN = {urn:nbn:de:0030drops39425}, doi = {10.4230/LIPIcs.STACS.2013.293}, annote = {Keywords: computational geometry, shortest path queries, shortest paths among obstacles, $L_1$/$L_infty$/rectilinear metric, shortest path maps, geodesic Vorono} }
Keywords:  computational geometry, shortest path queries, shortest paths among obstacles, $L_1$/$L_infty$/rectilinear metric, shortest path maps, geodesic Vorono  
Collection:  30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)  
Issue Date:  2013  
Date of publication:  26.02.2013 