Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf. Faster Algorithms for All-Pairs Bounded Min-Cuts. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{AbboudGIKPTUW19,
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
author = {Amir Abboud and Loukas Georgiadis and Giuseppe F. Italiano and Robert Krauthgamer and Nikos Parotsidis and Ohad Trabelsi and Przemyslaw Uznanski and Daniel Wolleb-Graf},
year = {2019},
doi = {10.4230/LIPIcs.ICALP.2019.7},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.7},
researchr = {https://researchr.org/publication/AbboudGIKPTUW19},
cites = {0},
citedby = {0},
booktitle = {46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
volume = {132},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-109-2},
}