%0 Conference Paper %1 conf/icalp/ChekuriQ21 %A Chekuri, Chandra %A Quanrud, Kent %B ICALP %D 2021 %E Bansal, Nikhil %E Merelli, Emanuela %E Worrell, James %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 49:1-49:16 %T Faster Algorithms for Rooted Connectivity in Directed Graphs. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#ChekuriQ21 %V 198 %@ 978-3-95977-195-5

@inproceedings{conf/icalp/ChekuriQ21, added-at = {2021-07-06T00:00:00.000+0200}, author = {Chekuri, Chandra and Quanrud, Kent}, biburl = {https://www.bibsonomy.org/bibtex/2528fa8f985329bb139c0f0ad785988f4/dblp}, booktitle = {ICALP}, crossref = {conf/icalp/2021}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, ee = {https://doi.org/10.4230/LIPIcs.ICALP.2021.49}, interhash = {41b90529cb86a97d7e6533da3dc7a32d}, intrahash = {528fa8f985329bb139c0f0ad785988f4}, isbn = {978-3-95977-195-5}, keywords = {dblp}, pages = {49:1-49:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T13:35:24.000+0200}, title = {Faster Algorithms for Rooted Connectivity in Directed Graphs.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#ChekuriQ21}, volume = 198, year = 2021 }