@InProceedings{ducoffe:OASIcs.SOSA.2019.12,
author = {Ducoffe, Guillaume},
title = {{A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {12:1--12:7},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.12},
URN = {urn:nbn:de:0030-drops-100383},
doi = {10.4230/OASIcs.SOSA.2019.12},
annote = {Keywords: Graph diameter, Orthogonal Range Queries, Hardness in P, FPT in P}
}