Go to the corresponding OASIcs Volume Portal 
pdfformat: 

@InProceedings{ducoffe:OASIcs:2018:10038, author = {Guillaume Ducoffe}, title = {{A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters}}, booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)}, pages = {12:112:7}, series = {OpenAccess Series in Informatics (OASIcs)}, ISBN = {9783959770996}, ISSN = {21906807}, year = {2018}, volume = {69}, editor = {Jeremy T. Fineman and Michael Mitzenmacher}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10038}, URN = {urn:nbn:de:0030drops100383}, doi = {10.4230/OASIcs.SOSA.2019.12}, annote = {Keywords: Graph diameter, Orthogonal Range Queries, Hardness in P, FPT in P} }
Keywords:  Graph diameter, Orthogonal Range Queries, Hardness in P, FPT in P  
Seminar:  2nd Symposium on Simplicity in Algorithms (SOSA 2019)  
Issue Date:  2018  
Date of publication:  18.12.2018 