{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:31:50Z","timestamp":1742959910204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_9","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"108-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3422-9028","authenticated-orcid":false,"given":"Bahareh","family":"Banyassady","sequence":"first","affiliation":[]},{"given":"Luis","family":"Barba","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-5840","authenticated-orcid":false,"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-62389-4_1","volume-title":"Computing and Combinatorics","author":"H-K Ahn","year":"2017","unstructured":"Ahn, H.-K., Baraldo, N., Oh, E., Silvestri, F.: A time-space trade-off for triangulations of points in the plane. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 3\u201312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_1"},{"key":"9_CR2","unstructured":"Aronov, B., Korman, M., Pratt, S., van Renssen, A., Roeloffzen, M.: Time-space trade-offs for triangulating a simple polygon. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 30:1\u201330:12 (2016)"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"8","key":"9_CR4","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.comgeo.2013.04.005","volume":"46","author":"T Asano","year":"2013","unstructured":"Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Memory-constrained algorithms for simple polygons. Comput. Geom. 46(8), 959\u2013969 (2013)","journal-title":"Comput. Geom."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-40104-6_6","volume-title":"Algorithms and Data Structures","author":"T Asano","year":"2013","unstructured":"Asano, T., Kirkpatrick, D.: Time-space tradeoffs for all-nearest-larger-neighbors problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 61\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_6"},{"issue":"1","key":"9_CR6","first-page":"46","volume":"2","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. J. Comput. Geom. 2(1), 46\u201368 (2011)","journal-title":"J. Comput. Geom."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-53925-6_24","volume-title":"WALCOM: Algorithms and Computation","author":"Y Bahoo","year":"2017","unstructured":"Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., Mulzer, W.: Time-space trade-off for finding the k-visibility region of a point in a polygon. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 308\u2013319. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_24"},{"key":"9_CR8","unstructured":"Banyassady, B., Korman, M., Mulzer, W., van Renssen, A., Roeloffzen, M., Seiferth, P., Stein, Y.: Improved time-space trade-offs for computing Voronoi diagrams. In: Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 9:1\u20139:14 (2017)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/s00453-014-9893-5","volume":"72","author":"L Barba","year":"2015","unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Algorithmica 72(4), 1097\u20131129 (2015)","journal-title":"Algorithmica"},{"issue":"9","key":"9_CR10","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.comgeo.2014.04.001","volume":"47","author":"L Barba","year":"2014","unstructured":"Barba, L., Korman, M., Langerman, S., Silveira, R.I.: Computing a visibility polygon using few variables. Comput. Geom. 47(9), 918\u2013926 (2014)","journal-title":"Comput. Geom."},{"key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00454-006-1275-6","volume":"37","author":"TM Chan","year":"2007","unstructured":"Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. Discrete Comput. Geom. 37(1), 79\u2013102 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Munro, J.I., Raman, V.: Selection and sorting in the \u201crestore\" model. In: Proceedings of the 25th Annual ACM-SIAM symposium Discrete Algorithms (SODA), pp. 995\u20131004 (2014)","DOI":"10.1137\/1.9781611973402.74"},{"key":"9_CR14","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-662-44777-2_24","volume-title":"Algorithms - ESA 2014","author":"O Darwish","year":"2014","unstructured":"Darwish, O., Elmasry, A.: Optimal time-space tradeoff for the 2D convex-hull problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 284\u2013295. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_24"},{"issue":"2","key":"9_CR16","first-page":"19","volume":"7","author":"S Har-Peled","year":"2016","unstructured":"Har-Peled, S.: Shortest path in a polygon using sublinear space. J. Comput. Geom. 7(2), 19\u201345 (2016)","journal-title":"J. Comput. Geom."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"JW Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80, 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Korman, M., Mulzer, W., van Renssen, A., Roeloffzen, M., Seiferth, P., Stein, Y.: Time-space trade-offs for triangulations and Voronoi diagrams. Comput. Geom. (2017, to appear)","DOI":"10.1016\/j.comgeo.2017.01.001"},{"key":"9_CR19","first-page":"849","volume-title":"Handbook of Discrete and Computational Geometry","author":"JSB Mitchell","year":"2017","unstructured":"Mitchell, J.S.B., Mulzer, W.: Proximity algorithms. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn, pp. 849\u2013874. CRC Press, Boca Raton (2017)","edition":"3"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theoret. Comput. Sci. 12(3), 315\u2013323 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"JI Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoret. Comput. Sci. 165(2), 311\u2013323 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 264\u2013268 (1998)","DOI":"10.7146\/brics.v5i10.19282"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:03Z","timestamp":1709827263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}