Go to the corresponding LIPIcs Volume Portal 
Chan, Timothy M. ; Skrepetos, Dimitrios
pdfformat: 

@InProceedings{chan_et_al:LIPIcs:2018:8737, author = {Timothy M. Chan and Dimitrios Skrepetos}, title = {{Approximate Shortest Paths and Distance Oracles in Weighted UnitDisk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {24:124:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8737}, URN = {urn:nbn:de:0030drops87375}, doi = {10.4230/LIPIcs.SoCG.2018.24}, annote = {Keywords: shortest paths, distance oracles, unitdisk graphs, planar graphs} }
Keywords:  shortest paths, distance oracles, unitdisk graphs, planar graphs  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 