Hisao Tamaki. A Polynomial Time Algorithm for Bounded Directed Pathwidth. In Petr Kolman, Jan Kratochvíl, editors, Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Volume 6986 of Lecture Notes in Computer Science, pages 331-342, Springer, 2011. [doi]
@inproceedings{Tamaki11,
title = {A Polynomial Time Algorithm for Bounded Directed Pathwidth},
author = {Hisao Tamaki},
year = {2011},
doi = {10.1007/978-3-642-25870-1_30},
url = {http://dx.doi.org/10.1007/978-3-642-25870-1_30},
researchr = {https://researchr.org/publication/Tamaki11},
cites = {0},
citedby = {0},
pages = {331-342},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers},
editor = {Petr Kolman and Jan Kratochvíl},
volume = {6986},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-25869-5},
}