{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:49Z","timestamp":1725475009046},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_19","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"173-182","source":"Crossref","is-referenced-by-count":4,"title":["Diamond Triangulations Contain Spanners of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P. Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica\u00a042, 249\u2013264 (2005)","journal-title":"Algorithmica"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P. Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Computational Geometry: Theory and Applications\u00a029, 233\u2013249 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM Journal on Computing\u00a033, 937\u2013951 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Smid, M., Xu, D.: Diamond triangulations contain spanners of bounded degree. Carleton University, Computer Science Technical Report (2006)","DOI":"10.1007\/11940128_19"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences\u00a039, 205\u2013219 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","volume-title":"Optimal Algorithms","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol.\u00a0401, pp. 168\u2013192. Springer, Heidelberg (1989)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry\u00a05, 399\u2013407 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry\u00a07, 13\u201328 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR9","unstructured":"Lee, A.W.: Diamonds are a plane graph\u2019s best friend. Master\u2019s thesis, School of Computer Science, Carleton University, Ottawa (2004)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0218195904001366","volume":"14","author":"X.-Y. Li","year":"2004","unstructured":"Li, X.-Y., Wang, Y.: Efficient construction of low weighted bounded degree planar spanner. International Journal of Computational Geometry & Applications\u00a014, 69\u201384 (2004)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:45Z","timestamp":1619509785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11940128_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}