{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:27:20Z","timestamp":1774333640456,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_2","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:55Z","timestamp":1770977215000},"page":"19-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-Weight Outerplane Laman Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuya","family":"Higashikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9982-0070","authenticated-orcid":false,"given":"Joachim","family":"Orthaber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6557-2355","authenticated-orcid":false,"given":"Daniel","family":"Perz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-6661","authenticated-orcid":false,"given":"Alexandra","family":"Weinberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/S00454-021-00355-8","volume":"68","author":"HA Akitaya","year":"2022","unstructured":"Akitaya, H.A., Korman, M., Korten, O., Rudoy, M., Souvaine, D.L., T\u00f3th, C.D.: Circumscribing polygons and polygonizations for disjoint line segments. Discret. Comput. Geom. 68(1), 218\u2013254 (2022). https:\/\/doi.org\/10.1007\/S00454-021-00355-8","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4(1), 97\u2013108 (1989). https:\/\/doi.org\/10.1007\/BF01553881","journal-title":"Algorithmica"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-30140-0_28","volume-title":"Algorithms \u2013 ESA 2004","author":"Z Fekete","year":"2004","unstructured":"Fekete, Z., Jord\u00e1n, T., Whiteley, W.: An inductive construction for plane Laman graphs via vertex splitting. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 299\u2013310. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_28"},{"key":"2_CR4","unstructured":"Gilbert, P.D.: New results on planar triangulations. Master\u2019s thesis, University of Illinois (1979). https:\/\/apps.dtic.mil\/sti\/tr\/pdf\/ADA085016.pdf"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Graver, J. E., Servatius, B., Servatius, H.: Combinatorial Rigidity, volume\u00a02 of Graduate Studies in Mathematics (1993)","DOI":"10.1090\/gsm\/002"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Haas, R., et al.: Planar minimally rigid graphs and pseudo-triangulations. In: Proceedings of the 19th Annual Symposium on Computational geometry (SoCG 2003), pp. 154\u2013163 (2003). https:\/\/doi.org\/10.1145\/777792.777817","DOI":"10.1145\/777792.777817"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Klincsek, G.T.: Minimal triangulations of polygonal domains. In: Annals of Discrete Mathematics, vol.\u00a09, pp. 121\u2013123 (1980). https:\/\/doi.org\/10.1016\/S0167-5060(08)70044-X","DOI":"10.1016\/S0167-5060(08)70044-X"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Kobourov, S., Ueckerdt, T., Verbeek, K.: Combinatorial and geometric properties of planar Laman graphs. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 1668\u20131678 (2013). https:\/\/doi.org\/10.1137\/1.9781611973105.120","DOI":"10.1137\/1.9781611973105.120"},{"issue":"4","key":"2_CR9","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(4), 331\u2013340 (1970). https:\/\/doi.org\/10.1007\/BF01534980","journal-title":"J. Eng. Math."},{"issue":"8","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1016\/j.disc.2007.07.104","volume":"308","author":"A Lee","year":"2008","unstructured":"Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discret. Math. 308(8), 1425\u20131437 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.07.104","journal-title":"Discret. Math."},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Rappaport, D.: Computing simple circuits from a set of line segments is NP-complete. In: Proceedings of the 3rd Annual Symposium on Computational geometry (SoCG 1987), pp. 322\u2013330 (1987). https:\/\/doi.org\/10.1145\/41958.41993","DOI":"10.1145\/41958.41993"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Rollin, J., Schlipf, L., Schulz, A.: Recognizing planar Laman graphs. In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019), pp. 79\u20131 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.79","DOI":"10.4230\/LIPIcs.ESA.2019.79"},{"key":"2_CR13","unstructured":"Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations-a survey. arXiv preprint: math\/0612672 (2006). https:\/\/arxiv.org\/abs\/math\/0612672"},{"key":"2_CR14","unstructured":"Servatius, B.: The geometry of frameworks: rigidity, mechanisms and CAD. MAA Notes, pp. 81\u201387 (2000)"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00454-005-1184-0","volume":"34","author":"I Streinu","year":"2005","unstructured":"Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discret. Comput. Geom. 34(4), 587 (2005). https:\/\/doi.org\/10.1007\/s00454-005-1184-0","journal-title":"Discret. Comput. Geom."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Thorpe, M.F., Duxbury, P.M.: Rigidity Theory and Applications. Fundamental Materials Research (1999). https:\/\/doi.org\/10.1007\/b115749","DOI":"10.1007\/b115749"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:07:16Z","timestamp":1774325236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}