%0 Conference Paper %1 conf/gd/BannisterE11 %A Bannister, Michael J. %A Eppstein, David %B GD %D 2011 %E van Kreveld, Marc J. %E Speckmann, Bettina %I Springer %K dblp %P 367-378 %T Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. %U http://dblp.uni-trier.de/db/conf/gd/gd2011.html#BannisterE11 %V 7034 %@ 978-3-642-25877-0

@inproceedings{conf/gd/BannisterE11, added-at = {2022-11-13T00:00:00.000+0100}, author = {Bannister, Michael J. and Eppstein, David}, biburl = {https://www.bibsonomy.org/bibtex/228bb9a6fb1cc83d7d4bf13c73236cda6/dblp}, booktitle = {GD}, crossref = {conf/gd/2011}, editor = {van Kreveld, Marc J. and Speckmann, Bettina}, ee = {https://doi.org/10.1007/978-3-642-25878-7_35}, interhash = {e6125f6180573b94caad18a72c9ab07b}, intrahash = {28bb9a6fb1cc83d7d4bf13c73236cda6}, isbn = {978-3-642-25877-0}, keywords = {dblp}, pages = {367-378}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-05-13T08:05:33.000+0200}, title = {Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings.}, url = {http://dblp.uni-trier.de/db/conf/gd/gd2011.html#BannisterE11}, volume = 7034, year = 2011 }