@inproceedings{DBLP:conf/cats/CheongHL07,
author = {Otfried Cheong and
Herman J. Haverkort and
Mira Lee},
title = {Computing a Minimum-Dilation Spanning Tree is NP-hard},
booktitle = {CATS},
year = {2007},
pages = {15-24},
ee = {http://crpit.com/abstracts/CRPITV65Cheong.html},
crossref = {DBLP:conf/cats/2007},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cats/2007,
editor = {Joachim Gudmundsson and
C. Barry Jay},
title = {Theory of Computing 2007. Proceedings of the Thirteenth
Computing: The Australasian Theory Symposium (CATS2007).
January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia,
Proceedings},
booktitle = {CATS},
publisher = {Australian Computer Society},
series = {CRPIT},
volume = {65},
year = {2007},
isbn = {1-920-68246-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-09 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
