{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:36:05Z","timestamp":1743096965595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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-75242-2_23","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"326-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Globally Rigid Augmentation of Minimally Rigid Graphs in $$\\mathbb {R}^2$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8081-9056","authenticated-orcid":false,"given":"Csaba","family":"Kir\u00e1ly","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0624-655X","authenticated-orcid":false,"given":"Andr\u00e1s","family":"Mih\u00e1lyk\u00f3","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"key":"23_CR1","unstructured":"Abbot, T.G.: Generalizations of Kempe\u2019s universality theorem. Master\u2019s thesis, MIT (2008). http:\/\/web.mit.edu\/tabbott\/www\/papers\/mthesis.pdf"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1137\/100792366","volume":"24","author":"BDO Anderson","year":"2010","unstructured":"Anderson, B.D.O., Shames, I., Mao, G., Fidan, B.: Formal theory of noisy sensor network localization. SIAM J. Discrete Math. 24, 684\u2013698 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/TMC.2006.174","volume":"5","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., et al.: A theory of network localization. IEEE Trans. Mob. Comput. 5(12), 1663\u20131678 (2006)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Algorithms - ESA 2003","author":"AR Berg","year":"2003","unstructured":"Berg, A.R., Jord\u00e1n, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 78\u201389. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_10"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00454-004-1124-4","volume":"33","author":"R Connelly","year":"2005","unstructured":"Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33(4), 549\u2013563 (2005). https:\/\/doi.org\/10.1007\/s00454-004-1124-4","journal-title":"Discrete Comput. Geom."},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11963271_16","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"Z Fekete","year":"2006","unstructured":"Fekete, Z., Jord\u00e1n, T.: Uniquely localizable networks with few anchors. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, pp. 176\u2013183. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11963271_16"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s00453-009-9300-9","volume":"59","author":"A Garc\u00eda","year":"2011","unstructured":"Garc\u00eda, A., Tejel, J.: Augmenting the rigidity of a graph in $${\\mathbb{R}^{2}}$$. Algorithmica 59(2), 145\u2013168 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9300-9","journal-title":"Algorithmica"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1353\/ajm.0.0132","volume":"132","author":"SJ Gortler","year":"2010","unstructured":"Gortler, S.J., Healy, A.D., Thurston, D.P.: Characterizing generic global rigidity. Am. J. Math. 132(4), 897\u2013939 (2010)","journal-title":"Am. J. Math."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"23_CR10","unstructured":"Hsu, T.S., Ramachandran, V.: A linear time algorithm for triconnectivity augmentation. In: Proceedings of the Annual Symposium on Foundations of Computer Science, pp. 548\u2013559 (1991)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2004.11.002","volume":"94","author":"B Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory Ser. B 94, 1\u201329 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Jackson, B., Jord\u00e1n, T.: Graph theoretic techniques in the analysis of uniquely localizable sensor networks. In: Mao, G., Fidan, B. (eds.) Localization Algorithms and Strategies for Wireless Sensor Networks, pp. 146\u2013173. IGI Global (2009)","DOI":"10.4018\/978-1-60566-396-8.ch006"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T Jord\u00e1n","year":"1995","unstructured":"Jord\u00e1n, T.: On the optimal vertex-connectivity augmentation. J. Comb. Theory Ser. B 63, 8\u201320 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Jord\u00e1n, T.: Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks. In: Discrete Geometric Analysis, Volume 34 of MSJ Memoirs, pp. 33\u2013112. Mathematical Society of Japan (2016)","DOI":"10.2969\/msjmemoirs\/03401C020"},{"key":"23_CR15","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-662-59204-5_8","volume-title":"Building Bridges II","author":"T Jord\u00e1n","year":"2019","unstructured":"Jord\u00e1n, T., Mih\u00e1lyk\u00f3, A.: Minimum cost globally rigid subgraphs. In: B\u00e1r\u00e1ny, I., Katona, G.O.H., Sali, A. (eds.) Building Bridges II. BSMS, vol. 28, pp. 257\u2013278. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-59204-5_8"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kaewprapha, P., Li, J., Puttarak, N.: Network localization on unit disk graphs. In: 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, pp. 1\u20135 (2011)","DOI":"10.1109\/GLOCOM.2011.6134494"},{"key":"23_CR17","unstructured":"Kir\u00e1ly, Cs., Mih\u00e1lyk\u00f3, A.: Globally rigid augmentation of minimally rigid graphs in $${\\mathbb{R}^{2}}$$. Technical report TR-2020-07, Egerv\u00e1ry Research Group, Budapest (2020). www.cs.elte.hu\/egres"},{"key":"23_CR18","unstructured":"Kir\u00e1ly, Cs., Mih\u00e1lyk\u00f3, A.: Sparse graphs and an augmentation problem. Technical report TR-2020-06, Egerv\u00e1ry Research Group, Budapest (2020). www.cs.elte.hu\/egres. An extended abstract appeared in Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, IPCO 2020. Lecture Notes in Computer Science, vol. 12125, pp. 238\u2013251. Springer, Cham (2020)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331\u2013340 (1970). https:\/\/doi.org\/10.1007\/BF01534980","journal-title":"J. Eng. Math."},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/zamm.19270070107","volume":"7","author":"H Pollaczek-Geiringer","year":"1927","unstructured":"Pollaczek-Geiringer, H.: \u00dcber die Gliederung ebener Fachwerke. ZAMM-J. Appl. Math. Mech. 7(1), 58\u201372 (1927)","journal-title":"ZAMM-J. Appl. Math. Mech."},{"key":"23_CR21","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in $$k$$-space is strongly NP-hard. Technical report, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA (1979)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"A So","year":"2005","unstructured":"So, A., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109, 405\u2013414 (2005). https:\/\/doi.org\/10.1007\/s10107-006-0040-1","journal-title":"Math. Program."},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Whiteley, W.: Some matroids from discrete applied geometry. In: Bonin, J.E., Oxley, J.G., Servatius, B. (eds.) Matroid Theory, Volume 197 of Contemporary Mathematics, pp. 171\u2013311. AMS (1996)","DOI":"10.1090\/conm\/197\/02540"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:29:44Z","timestamp":1620142184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_23","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":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","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":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"35% - 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","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":"10","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)"}},{"value":"Due to the Corona pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}