Katerina Altmanová, Petr Kolman, Jan Voborník. On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. In Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Volume 11646 of Lecture Notes in Computer Science, pages 14-27, Springer, 2019. [doi]
@inproceedings{AltmanovaKV19,
title = {On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow},
author = {Katerina Altmanová and Petr Kolman and Jan Voborník},
year = {2019},
doi = {10.1007/978-3-030-24766-9_2},
url = {https://doi.org/10.1007/978-3-030-24766-9_2},
researchr = {https://researchr.org/publication/AltmanovaKV19},
cites = {0},
citedby = {0},
pages = {14-27},
booktitle = {Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
editor = {Zachary Friggstad and Jörg-Rüdiger Sack and Mohammad R. Salavatipour},
volume = {11646},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-24766-9},
}