Michael J. Bannister, David Eppstein. Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. In Marc J. van Kreveld, Bettina Speckmann, editors, Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers. Volume 7034 of Lecture Notes in Computer Science, pages 367-378, Springer, 2011. [doi]
@inproceedings{BannisterE11,
title = {Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings},
author = {Michael J. Bannister and David Eppstein},
year = {2011},
doi = {10.1007/978-3-642-25878-7_35},
url = {http://dx.doi.org/10.1007/978-3-642-25878-7_35},
researchr = {https://researchr.org/publication/BannisterE11},
cites = {0},
citedby = {0},
pages = {367-378},
booktitle = {Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers},
editor = {Marc J. van Kreveld and Bettina Speckmann},
volume = {7034},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-25877-0},
}