%0 Conference Paper %1 conf/mfcs/AsanoKNW14 %A Asano, Tetsuo %A Kirkpatrick, David G. %A Nakagawa, Kotaro %A Watanabe, Osamu %B MFCS (2) %D 2014 %E Csuhaj-Varjú, Erzsébet %E Dietzfelbinger, Martin %E Ésik, Zoltán %I Springer %K dblp %P 45-56 %T Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2014-2.html#AsanoKNW14 %V 8635 %@ 978-3-662-44464-1

@inproceedings{conf/mfcs/AsanoKNW14, added-at = {2019-09-16T00:00:00.000+0200}, author = {Asano, Tetsuo and Kirkpatrick, David G. and Nakagawa, Kotaro and Watanabe, Osamu}, biburl = {https://www.bibsonomy.org/bibtex/2b0b6bf2d3b748e6bedf45c3d296eeee7/dblp}, booktitle = {MFCS (2)}, crossref = {conf/mfcs/2014-2}, editor = {Csuhaj-Varjú, Erzsébet and Dietzfelbinger, Martin and Ésik, Zoltán}, ee = {https://doi.org/10.1007/978-3-662-44465-8_5}, interhash = {e17b6febc3050db4d195f788cb990d2b}, intrahash = {b0b6bf2d3b748e6bedf45c3d296eeee7}, isbn = {978-3-662-44464-1}, keywords = {dblp}, pages = {45-56}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-17T12:40:17.000+0200}, title = {Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2014-2.html#AsanoKNW14}, volume = 8635, year = 2014 }