default search action
BibTeX record conf/latin/BosekLSZ18
@inproceedings{DBLP:conf/latin/BosekLSZ18, author = {Bartlomiej Bosek and Dariusz Leniowski and Piotr Sankowski and Anna Zych{-}Pawlewicz}, editor = {Michael A. Bender and Martin Farach{-}Colton and Miguel A. Mosteiro}, title = {A Tight Bound for Shortest Augmenting Paths on Trees}, booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10807}, pages = {201--216}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-77404-6\_16}, doi = {10.1007/978-3-319-77404-6\_16}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/BosekLSZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.