Tadaaki Kirishima, Tomoo Sumida, Yasunori Shiono, Takaaki Goto, Takeo Yaku, Tetsuro Nishino, Kensei Tsuchida. O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams. In Teruhisa Hochin, Roger Y. Lee, editors, 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2012, Kyoto, Japan, August 8-10, 2012. pages 530-535, IEEE Computer Society, 2012. [doi]
@inproceedings{KirishimaSSGYNT12,
title = {O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams},
author = {Tadaaki Kirishima and Tomoo Sumida and Yasunori Shiono and Takaaki Goto and Takeo Yaku and Tetsuro Nishino and Kensei Tsuchida},
year = {2012},
doi = {10.1109/SNPD.2012.109},
url = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2012.109},
researchr = {https://researchr.org/publication/KirishimaSSGYNT12},
cites = {0},
citedby = {0},
pages = {530-535},
booktitle = {13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2012, Kyoto, Japan, August 8-10, 2012},
editor = {Teruhisa Hochin and Roger Y. Lee},
publisher = {IEEE Computer Society},
isbn = {978-1-4673-2120-4},
}