@InProceedings{c.s._et_al:LIPIcs.ITCS.2019.17,
author = {C. S., Karthik and Manurangsi, Pasin},
title = {{On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic}},
booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-095-8},
ISSN = {1868-8969},
year = {2019},
volume = {124},
editor = {Blum, Avrim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.17},
URN = {urn:nbn:de:0030-drops-101100},
doi = {10.4230/LIPIcs.ITCS.2019.17},
annote = {Keywords: Closest Pair, Bichromatic Closest Pair, Contact Dimension, Fine-Grained Complexity}
}