{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:32:28Z","timestamp":1743139948805,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_2","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Minimum Moving Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"Biniaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds Fernando Schultz Xavier","family":"da Silveira","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":[[2021,7,31]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-31155-0_5","volume-title":"Algorithm Theory","author":"MA Abam","year":"2012","unstructured":"Abam, M.A., Rahmati, Z., Zarei, A.: Kinetic pie delaunay graph and its applications. In: Fomin, F.V., Kaski, P. (eds.) Algorithm Theory. LNCS, vol. 7357, pp. 48\u201358. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_5"},{"issue":"12","key":"2_CR2","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1109\/TVCG.2011.186","volume":"17","author":"B Alper","year":"2011","unstructured":"Alper, B., Riche, N., Ramos, G., Czerwinski, M.: Design study of linesets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graph. 17(12), 2259\u20132267 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2_CR4","unstructured":"Arkin, E.M., Mitchell, J.S., Piatko, C.D.: Bicriteria shortest path problems in the plane. In: Proceedings of 3rd Canadian Conference on Computational Geometry, pp. 153\u2013156 (1991)"},{"issue":"12","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","author":"MJ Atallah","year":"1985","unstructured":"Atallah, M.J.: Some dynamic computational geometry problems. Comput. Math. Appl. 11(12), 1171\u20131181 (1985)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TVCG.2018.2865049","volume":"25","author":"J Buchm\u00fcller","year":"2018","unstructured":"Buchm\u00fcller, J., J\u00e4ckle, D., Cakmak, E., Brandes, U., Keim, D.A.: Motionrugs: visualizing collective trends in space and time. IEEE Trans. Vis. Comput. Graph. 25(1), 76\u201386 (2018)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"PM Camerini","year":"1978","unstructured":"Camerini, P.M.: The min-max spanning tree problem and some extensions. Inf. Process. Lett. 7(1), 10\u201314 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TVCG.2009.122","volume":"15","author":"C Collins","year":"2009","unstructured":"Collins, C., Penn, G., Carpendale, S.: Bubble sets: revealing set relations with isocontours over existing visualizations. IEEE Trans. Vis. Comput. Graph. 15(6), 1009\u20131016 (2009). Proceedings of the IEEE Conference on Information Visualization","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3pt1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1111\/j.1467-8659.2012.03080.x","volume":"31","author":"K Dinkla","year":"2012","unstructured":"Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: point set membership visualization. Comput. Graph. Forum 31(3pt1), 875\u2013884 (2012)","journal-title":"Comput. Graph. Forum"},{"issue":"5","key":"2_CR10","first-page":"31","volume":"9","author":"SI Fabrikant","year":"2019","unstructured":"Fabrikant, S.I., Miksch, S., Wolff, A.: Visual analytics for sets over time and space (Dagstuhl Seminar 19192). Dagstuhl Rep. 9(5), 31\u201357 (2019)","journal-title":"Dagstuhl Rep."},{"key":"2_CR11","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.comgeo.2017.06.006","volume":"68","author":"F Hurtado","year":"2018","unstructured":"Hurtado, F., et al.: Colored spanning graphs for set visualization. Comput. Geom. 68, 262\u2013276 (2018). Special Issue in Memory of Ferran Hurtado","journal-title":"Comput. Geom."},{"key":"2_CR14","unstructured":"Jaffry, S., Hussain, R., Gui, X., Hasan, S.F.: A comprehensive survey on moving networks. arXiv preprint arXiv:2003.09979 (2020)"},{"key":"2_CR15","unstructured":"Kraak, M.-J.: The space-time cube revisited from a geovisualization perspective. In: Proceedings of 21st International Cartographic Conference, pp. 1988\u20131996 (2003)"},{"issue":"11","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1109\/TVCG.2013.76","volume":"19","author":"W Meulemans","year":"2013","unstructured":"Meulemans, W., Riche, N.H., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: a hybrid set visualization technique. IEEE Trans. Vis. Comput. Graph. 19(11), 1846\u20131858 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/978-3-319-77404-6_58","volume-title":"Theoretical Informatics","author":"W Meulemans","year":"2018","unstructured":"Meulemans, W., Speckmann, B., Verbeek, K., Wulms, J.: A framework for algorithm stability and its application to kinetic Euclidean MSTs. In: Bender, M., Farach-Colton, M., Mosteiro, M. (eds.) Theoretical Informatics. LNCS, vol. 10807, pp. 805\u2013819. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_58"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"CL Monma","year":"1992","unstructured":"Monma, C.L., Suri, S.: Transitions in geometric minimum spanning trees. Discret. Comput. Geom. 8, 265\u2013293 (1992)","journal-title":"Discret. Comput. Geom."},{"key":"2_CR19","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)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2012.04.009","volume":"16","author":"Z Rahmati","year":"2012","unstructured":"Rahmati, Z., Zarei, A.: Kinetic Euclidean minimum spanning tree in the plane. J. Discret. Algorithms 16, 2\u201311 (2012). Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011)","journal-title":"J. Discret. Algorithms"},{"key":"2_CR21","unstructured":"Wulms, J., Buchm\u00fcller, J., Meulemans, W., Verbeek, K., Speckmann, B.: Spatially and temporally coherent visual summaries. arXiv preprint arXiv:1912.00719 (2019)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:09Z","timestamp":1645183509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}