Go to the corresponding LIPIcs Volume Portal 
Agarwal, Pankaj K. ; Kumar, Neeraj ; Sintos, Stavros ; Suri, Subhash
pdfformat: 

@InProceedings{agarwal_et_al:LIPIcs:2018:8831, author = {Pankaj K. Agarwal and Neeraj Kumar and Stavros Sintos and Subhash Suri}, title = {{Computing Shortest Paths in the Plane with Removable Obstacles}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {5:15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770682}, ISSN = {18688969}, year = {2018}, volume = {101}, editor = {David Eppstein}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8831}, URN = {urn:nbn:de:0030drops88312}, doi = {10.4230/LIPIcs.SWAT.2018.5}, annote = {Keywords: Euclidean shortest paths, Removable polygonal obstacles, Stochastic shortest paths, L_1 shortest paths} }
Keywords:  Euclidean shortest paths, Removable polygonal obstacles, Stochastic shortest paths, L_1 shortest paths  
Seminar:  16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)  
Issue Date:  2018  
Date of publication:  30.05.2018 