{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:12Z","timestamp":1725815952917},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_9","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"89-100","source":"Crossref","is-referenced-by-count":0,"title":["Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0218195909003143","volume":"19","author":"M. Abellanas","year":"2009","unstructured":"Abellanas, M., Bose, P., Garc\u00eda-L\u00f3pez, J., Hurtado, F., Nicol\u00e1s, C.M., Ramos, P.: On structural and graph theoretic properties of higher order Delaunay graphs. Int. J. Comput. Geometry Appl.\u00a019(6), 595\u2013615 (2009)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.comgeo.2012.02.005","volume":"46","author":"O. Aichholzer","year":"2013","unstructured":"Aichholzer, O., Monroy, R.F., Hackl, T., van Kreveld, M.J., Pilz, A., Ramos, P., Vogtenhuber, B.: Blocking Delaunay triangulations. Comput. Geom.\u00a046(2), 154\u2013159 (2013)","journal-title":"Comput. Geom."},{"issue":"7","key":"9_CR3","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.comgeo.2011.06.004","volume":"46","author":"B. Aronov","year":"2013","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness Gabriel graphs. Comput. Geom.\u00a046(7), 894\u2013908 (2013)","journal-title":"Comput. Geom."},{"key":"9_CR4","unstructured":"Babu, J., Biniaz, A., Maheshwari, A., Smid, M.: Fixed-orientation equilateral triangle matching of point sets. To appear in Theoretical Computer Science"},{"key":"9_CR5","first-page":"258","volume":"247","author":"C. Berge","year":"1958","unstructured":"Berge, C.: Sur le couplage maximum d\u2019un graphe. C. R. Acad. Sci. Paris\u00a0247, 258\u2013259 (1958)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 266\u2013278. Springer, Heidelberg (2010)"},{"issue":"1","key":"9_CR7","first-page":"41","volume":"1","author":"P. Bose","year":"2010","unstructured":"Bose, P., Carmi, P., Collette, S., Smid, M.H.M.: On the stretch factor of convex Delaunay graphs. Journal of Computational Geometry\u00a01(1), 41\u201356 (2010)","journal-title":"Journal of Computational Geometry"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.comgeo.2012.04.006","volume":"46","author":"P. Bose","year":"2013","unstructured":"Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristan, V., Saumell, M.: Some properties of k-Delaunay and k-Gabriel graphs. Comput. Geom.\u00a046(2), 131\u2013139 (2013)","journal-title":"Comput. Geom."},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/jgt.3190150507","volume":"15","author":"M.-S. Chang","year":"1991","unstructured":"Chang, M.-S., Tang, C.Y., Lee, R.C.T.: 20-relative neighborhood graphs are Hamiltonian. Journal of Graph Theory\u00a015(5), 543\u2013557 (1991)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(92)90111-M","volume":"39","author":"M.-S. Chang","year":"1992","unstructured":"Chang, M.-S., Tang, C.Y., Lee, R.C.T.: Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs. Discrete Applied Mathematics\u00a039(1), 1\u201312 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01758842","volume":"8","author":"M.-S. Chang","year":"1992","unstructured":"Chang, M.-S., Tang, C.Y., Lee, R.C.T.: Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs. Algorithmica\u00a08(3), 177\u2013194 (1992)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"P. Chew","year":"1989","unstructured":"Chew, P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci.\u00a039(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","volume":"25","author":"M.B. Dillencourt","year":"1987","unstructured":"Dillencourt, M.B.: A non-hamiltonian, nondegenerate Delaunay triangulation. Inf. Process. Lett.\u00a025(3), 149\u2013151 (1987)","journal-title":"Inf. Process. Lett."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Toughness and Delaunay triangulations. Discrete & Computational Geometry\u00a05, 575\u2013601 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kaiser, T., Saumell, M., Cleemput, N.V.: 10-Gabriel graphs are Hamiltonian. arXiv: 1410.0309 (2014)","DOI":"10.1016\/j.ipl.2015.05.013"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. Journal of the London Mathematical Society\u00a022(2), 107\u2013111 (1947)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:00:59Z","timestamp":1559106059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}