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]
@inproceedings{KangKKMO21,
title = {A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects},
author = {Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus},
year = {2021},
doi = {10.1109/FOCS52979.2021.00107},
url = {https://doi.org/10.1109/FOCS52979.2021.00107},
researchr = {https://researchr.org/publication/KangKKMO21},
cites = {0},
citedby = {0},
pages = {1080-1089},
booktitle = {62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022},
publisher = {IEEE},
isbn = {978-1-6654-2055-6},
}