{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:45Z","timestamp":1750306845086,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"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":[[2014,6,8]]},"DOI":"10.1145\/2582112.2582141","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"20-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["There are Plane Spanners of Maximum Degree 4"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[{"name":"LaBRI, Universit\u00e9 Bordeaux 1"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iyad","family":"Kanj","sequence":"additional","affiliation":[{"name":"School of Computing, DePaul University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[{"name":"School of Computing, DePaul University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Lafayette College"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880923"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.03.004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195912600047"},{"key":"e_1_3_2_1_5_1","first-page":"299","volume-title":"Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012","author":"Bose P.","year":"2012","unstructured":"P. Bose , R. Fagerberg , A. van Renssen , and S. Verdonschot . Competitive routing on a bounded-degree plane spanner . In Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012 ), pages 299 -- 304 , 2012 . P. Bose, R. Fagerberg, A. van Renssen, and S. Verdonschot. Competitive routing on a bounded-degree plane spanner. In Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), pages 299--304, 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1168-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.04.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002861"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10534"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90044-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000105"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187801"},{"key":"e_1_3_2_1_13_1","first-page":"409","volume-title":"Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS)","volume":"00231084","author":"Kanj I.","year":"2008","unstructured":"I. Kanj and L. Perkovi\u0107 . On geometric spanners of Euclidean and unit disk graphs . In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS) , volume hal- 00231084 , pages 409 -- 420 . HAL, 2008 . I. Kanj and L. Perkovi\u0107. On geometric spanners of Euclidean and unit disk graphs. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume hal-00231084, pages 409--420. HAL, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187821"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195904001366"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90133-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/110832458"}],"event":{"name":"SOCG'14: Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Kyoto Japan","acronym":"SOCG'14"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582141","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2582141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:09Z","timestamp":1750234209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":17,"alternative-id":["10.1145\/2582112.2582141","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2582141","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}