@InProceedings{frankl_et_al:LIPIcs.SoCG.2020.48,
author = {Frankl, N\'{o}ra and Kupavskii, Andrey},
title = {{Almost Sharp Bounds on the Number of Discrete Chains in the Plane}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.48},
URN = {urn:nbn:de:0030-drops-122064},
doi = {10.4230/LIPIcs.SoCG.2020.48},
annote = {Keywords: unit distance problem, unit distance graphs, discrete chains}
}