Go to the corresponding LIPIcs Volume Portal 
Frankl, Nóra ; Kupavskii, Andrey
pdfformat: 

@InProceedings{frankl_et_al:LIPIcs:2020:12206, author = {N{\'o}ra Frankl and Andrey Kupavskii}, title = {{Almost Sharp Bounds on the Number of Discrete Chains in the Plane}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {48:148:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771436}, ISSN = {18688969}, year = {2020}, volume = {164}, editor = {Sergio Cabello and Danny Z. Chen}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12206}, URN = {urn:nbn:de:0030drops122064}, doi = {10.4230/LIPIcs.SoCG.2020.48}, annote = {Keywords: unit distance problem, unit distance graphs, discrete chains} }
Keywords:  unit distance problem, unit distance graphs, discrete chains  
Collection:  36th International Symposium on Computational Geometry (SoCG 2020)  
Issue Date:  2020  
Date of publication:  08.06.2020 