@inproceedings{antiramsey-mfcs20,
  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)},
  year = {2020},
  volume = {170},
  pages = {6:1--6:14},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  doi = {10.4230/LIPIcs.MFCS.2020.6},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.6},
  address = {Dagstuhl, Germany},
  editor = {Esparza, Javier and Kr\'{a}l', Daniel},
  isbn = {978-3-95977-159-7},
  issn = {1868-8969},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  urn = {urn:nbn:de:0030-drops-126781}
}