@inproceedings{georgiadis_et_al:LIPIcs:2017:7451,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: 2-reachability, All Dominator Trees, Directed Graphs, Boolean Matrix Multiplication},
    Author = {Georgiadis, Loukas and Graf, Daniel and Italiano, Giuseppe F. and Parotsidis, Nikos and Uznanski, Przemyslaw},
    BookTitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
    Editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
    File = {LIPIcs-ICALP-2017-74 (0) - a - a - l.pdf},
    ISBN = {978-3-95977-041-5},
    ISSN = {1868-8969},
    Pages = {74:1--74:14},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{All-Pairs 2-Reachability in $O(n^w \log n)$ Time}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7451},
    Volume = {80},
    Year = {2017},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2017/7451},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.74},
    date-added = {2017-07-08 14:34:08 +0000},
    date-modified = {2017-07-08 14:34:08 +0000},
    urn = {urn:nbn:de:0030-drops-74510},
    doi = {10.4230/LIPIcs.ICALP.2017.74}
}

@inproceedings{georgiadis_et_al:LIPIcs:2017:7451, Address = {Dagstuhl, Germany}, Annote = {Keywords: 2-reachability, All Dominator Trees, Directed Graphs, Boolean Matrix Multiplication}, Author = {Georgiadis, Loukas and Graf, Daniel and Italiano, Giuseppe F. and Parotsidis, Nikos and Uznanski, Przemyslaw}, BookTitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, Editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, File = {LIPIcs-ICALP-2017-74 (0) - a - a - l.pdf}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, Pages = {74:1--74:14}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{All-Pairs 2-Reachability in $O(n^w \log n)$ Time}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7451}, Volume = {80}, Year = {2017}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2017/7451}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2017.74}, date-added = {2017-07-08 14:34:08 +0000}, date-modified = {2017-07-08 14:34:08 +0000}, urn = {urn:nbn:de:0030-drops-74510}, doi = {10.4230/LIPIcs.ICALP.2017.74} }