@InProceedings{l18-201-216,
  AUTHOR    = {Bartlomiej Bosek and Dariusz Leniowski and Piotr Sankowski and Anna Zych{-}Pawlewicz},
  TITLE     = {A Tight Bound for Shortest Augmenting Paths on Trees},
  BOOKTITLE = {{LATIN}},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {10807},
  PAGES     = {201--216},
  PUBLISHER = {Springer},
  YEAR      = {2018}
}