Timothy M. Chan, Zhengcheng Huang. Improved Upper and Lower Bounds for LR Drawings of Binary Trees. In David Auber, Pavel Valtr, editors, Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers. Volume 12590 of Lecture Notes in Computer Science, pages 71-84, Springer, 2020. [doi]
@inproceedings{ChanH20-3,
title = {Improved Upper and Lower Bounds for LR Drawings of Binary Trees},
author = {Timothy M. Chan and Zhengcheng Huang},
year = {2020},
doi = {10.1007/978-3-030-68766-3_6},
url = {https://doi.org/10.1007/978-3-030-68766-3_6},
researchr = {https://researchr.org/publication/ChanH20-3},
cites = {0},
citedby = {0},
pages = {71-84},
booktitle = {Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers},
editor = {David Auber and Pavel Valtr},
volume = {12590},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-68766-3},
}