@inproceedings{f1cf4d1282b34ca2b0eccb1bdeff6633,

title = "How to fit a tree in a box",

abstract = "We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a √n by √n grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.",

author = "Akitaya, {Hugo A.} and Maarten L{\"o}ffler and Irene Parada",

year = "2018",

doi = "10.1007/978-3-030-04414-5_26",

language = "English",

isbn = "9783030044138",

series = "LNCS",

publisher = "Springer, Cham",

pages = "361--367",

booktitle = "Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)",

note = "26th International Symposium on Graph Drawing and Network Visualization, GD 2018 ; Conference date: 26-09-2018 Through 28-09-2018",

}