Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz. A Tight Bound for Shortest Augmenting Paths on Trees. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 201-216, Springer, 2018. [doi]
Abstract is missing.