{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:48:58Z","timestamp":1765176538121,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T00:00:00Z","timestamp":1531785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NFS","award":["CCF-1228639"],"award-info":[{"award-number":["CCF-1228639"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00453-018-0482-x","type":"journal-article","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T08:49:55Z","timestamp":1531817395000},"page":"1512-1534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Maximum Plane Trees in Multipartite Geometric Graphs"],"prefix":"10.1007","volume":"81","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimberly","family":"Crosbie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,17]]},"reference":[{"issue":"4","key":"482_CR1","first-page":"385","volume":"22","author":"N Alon","year":"1995","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. Fund. Inf. 22(4), 385\u2013394 (1995). (also in Proceedings of the 9th ACM Symposium on Computational Geometry (SoCG), pp. 257\u2013263, 1993)","journal-title":"Fund. Inf."},{"key":"482_CR2","doi-asserted-by":"publisher","unstructured":"Biniaz, A., Bose, P., Eppstein, D., Maheshwari, A., Morin, P., Smid, M.: Spanning trees in multipartite geometric graphs. Algorithmica (2017). \n                    https:\/\/doi.org\/10.1007\/s00453-017-0375-4","DOI":"10.1007\/s00453-017-0375-4"},{"issue":"4","key":"482_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.jda.2008.08.001","volume":"7","author":"MG Borgelt","year":"2009","unstructured":"Borgelt, M.G., van Kreveld, M.J., L\u00f6ffler, M., Luo, J., Merrick, D., Silveira, R.I., Vahedi, M.: Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4), 469\u2013478 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"482_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-010-9277-9","volume":"44","author":"A Dumitrescu","year":"2010","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Long non-crossing configurations in the plane. Discrete Comput. Geom. 44(4), 727\u2013752 (2010). (also in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 311\u2013322, 2010)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"482_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01840396","volume":"5","author":"CL Monma","year":"1990","unstructured":"Monma, C.L., Paterson, M., Suri, S., Yao, F.F.: Computing Euclidean maximum spanning trees. Algorithmica 5(3), 407\u2013419 (1990)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0482-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0482-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0482-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T04:39:43Z","timestamp":1568954383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0482-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,17]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["482"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0482-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,7,17]]},"assertion":[{"value":"10 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}