{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:06:42Z","timestamp":1758823602998,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,8]],"date-time":"2009-06-08T00:00:00Z","timestamp":1244419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,8]]},"DOI":"10.1145\/1542362.1542399","type":"proceedings-article","created":{"date-parts":[[2009,6,9]],"date-time":"2009-06-09T12:44:24Z","timestamp":1244551464000},"page":"179-188","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["The Euclidean degree-4 minimum spanning tree problem is NP-hard"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Francke","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875526"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1103-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1117-3"},{"key":"e_1_3_2_1_5_1","unstructured":"E. D. Demaine J. S. B. Mitchell and J. O'Rourke. The Open Problems Project. http:\/\/maven.smith.edu\/~orourke\/TOPP\/.  E. D. Demaine J. S. B. Mitchell and J. O'Rourke. The Open Problems Project. http:\/\/maven.smith.edu\/~orourke\/TOPP\/."},{"key":"e_1_3_2_1_6_1","unstructured":"S. P. Fekete. Problem 48: Bounded-degree minimum Euclidean spanning tree. http:\/\/maven.smith.edu\/~orourke\/TOPP\/P48.html.  S. P. Fekete. Problem 48: Bounded-degree minimum Euclidean spanning tree. http:\/\/maven.smith.edu\/~orourke\/TOPP\/P48.html."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0862"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , New York, NY , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.037"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794264585"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796309764"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293049"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90029-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00017-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570700"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/31.34669"}],"event":{"name":"SoCG '09: 25th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Aarhus Denmark","acronym":"SoCG '09"},"container-title":["Proceedings of the twenty-fifth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542362.1542399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1542362.1542399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:55Z","timestamp":1750253395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542362.1542399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,8]]},"references-count":18,"alternative-id":["10.1145\/1542362.1542399","10.1145\/1542362"],"URL":"https:\/\/doi.org\/10.1145\/1542362.1542399","relation":{},"subject":[],"published":{"date-parts":[[2009,6,8]]},"assertion":[{"value":"2009-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}