BibTeX record conf/compgeom/EadesW94

download as .bib file

@inproceedings{DBLP:conf/compgeom/EadesW94,
  author       = {Peter Eades and
                  Sue Whitesides},
  editor       = {Kurt Mehlhorn},
  title        = {The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard},
  booktitle    = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
                  Stony Brook, New York, USA, June 6-8, 1994},
  pages        = {49--56},
  publisher    = {{ACM}},
  year         = {1994},
  url          = {https://doi.org/10.1145/177424.177507},
  doi          = {10.1145/177424.177507},
  timestamp    = {Mon, 14 Jun 2021 16:25:16 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/EadesW94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.