A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus. A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 1080-1089, IEEE, 2021. [doi]

This author has not been identified. Look up 'Dong Yeap Kang' in GoogleThis author has not been identified. Look up 'Tom Kelly' in GoogleThis author has not been identified. Look up 'Daniela Kühn' in GoogleThis author has not been identified. Look up 'Abhishek Methuku' in GoogleThis author has not been identified. Look up 'Deryk Osthus' in Google

runs on WebDSL