![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/latin/GrossiMV18
@inproceedings{DBLP:conf/latin/GrossiMV18, author = {Roberto Grossi and Andrea Marino and Luca Versari}, editor = {Michael A. Bender and Martin Farach{-}Colton and Miguel A. Mosteiro}, title = {Efficient Algorithms for Listing k Disjoint st-Paths in Graphs}, 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 = {544--557}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-77404-6\_40}, doi = {10.1007/978-3-319-77404-6\_40}, timestamp = {Sun, 18 Jun 2023 08:03:59 +0200}, biburl = {https://dblp.org/rec/conf/latin/GrossiMV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.