%0 Conference Paper %1 conf/caap/Kaufmann84 %A Kaufmann, Michael %B CAAP %D 1984 %E Courcelle, Bruno %I Cambridge University Press %K dblp %P 169-180 %T Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. %U http://dblp.uni-trier.de/db/conf/caap/caap84.html#Kaufmann84 %@ 0-521-26750-1

@inproceedings{conf/caap/Kaufmann84, added-at = {2023-08-09T00:00:00.000+0200}, author = {Kaufmann, Michael}, biburl = {https://www.bibsonomy.org/bibtex/21994fbbf8f974f7f6fd62a962f6e9093/dblp}, booktitle = {CAAP}, crossref = {conf/caap/1984}, editor = {Courcelle, Bruno}, interhash = {76538fd4f19d1b80b46653b3b2f5b2b0}, intrahash = {1994fbbf8f974f7f6fd62a962f6e9093}, isbn = {0-521-26750-1}, keywords = {dblp}, pages = {169-180}, publisher = {Cambridge University Press}, timestamp = {2024-04-10T11:11:22.000+0200}, title = {Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out.}, url = {http://dblp.uni-trier.de/db/conf/caap/caap84.html#Kaufmann84}, year = 1984 }