@InProceedings{akhoondianamiri_et_al:LIPIcs.MFCS.2020.6,
author = {Akhoondian Amiri, Saeed and Popa, Alexandru and Roghani, Mohammad and Shahkarami, Golnoosh and Soltani, Reza and Vahidi, Hossein},
title = {{Complexity of Computing the Anti-Ramsey Numbers for Paths}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.6},
URN = {urn:nbn:de:0030-drops-126781},
doi = {10.4230/LIPIcs.MFCS.2020.6},
annote = {Keywords: Coloring, Anti-Ramsey, Approximation, NP-hard, Algorithm, ETH}
}