@InCollection{zbMATH06904152,
Author = {Shiri {Chechik} and Thomas Dueholm {Hansen} and Giuseppe F. {Italiano} and Veronika {Loitzenbauer} and Nikos {Parotsidis}},
Title = {{Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs.}},
BookTitle = {{Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017}},
ISBN = {978-1-61197-478-2},
Pages = {1900--1918},
Year = {2017},
Publisher = {Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM)},
Language = {English},
MSC2010 = {05C85 05C20 05C40 68W40},
Zbl = {1410.05196}
}