External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity of Computing the Anti-Ramsey Numbers for Paths

Saeed Akhoondian Amiri, Alexandru Popa 0001, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi 0001. Complexity of Computing the Anti-Ramsey Numbers for Paths. In Javier Esparza, Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. Volume 170 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Saeed Akhoondian Amiri

This author has not been identified. Look up 'Saeed Akhoondian Amiri' in Google

Alexandru Popa 0001

This author has not been identified. Look up 'Alexandru Popa 0001' in Google

Mohammad Roghani

This author has not been identified. Look up 'Mohammad Roghani' in Google

Golnoosh Shahkarami

This author has not been identified. Look up 'Golnoosh Shahkarami' in Google

Reza Soltani

This author has not been identified. Look up 'Reza Soltani' in Google

Hossein Vahidi 0001

This author has not been identified. Look up 'Hossein Vahidi 0001' in Google
runs on