The following publications are possibly variants of this publication:
- Shortest Augmenting Paths for Online Matchings on TreesBartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych. waoa 2015: 59-71 [doi]
- A Tight Bound for Shortest Augmenting Paths on TreesBartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz. latin 2018: 201-216 [doi]
- A tight bound for shortest augmenting paths on treesBartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz. TCS, 901:45-61, 2022. [doi]