@inproceedings{Das_FOCS22,
TITLE = {$\tilde{O}(n + \mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance},
AUTHOR = {Das, Debarati and Gilbert, Jacob and Hajiaghayi, MohammadTaghi and Kociumaka, Tomasz and Saha, Barna and Saleh, Hamed},
LANGUAGE = {eng},
ISBN = {978-1-6654-5519-0},
DOI = {10.1109/FOCS54457.2022.00071},
PUBLISHER = {IEEE},
YEAR = {2022},
BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science},
PAGES = {686--697},
ADDRESS = {Denver, CO, USA},
}