{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:42:27Z","timestamp":1701135747857},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T00:00:00Z","timestamp":1437091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00454-015-9716-8","type":"journal-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T15:34:53Z","timestamp":1437060893000},"page":"459-480","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compatible Connectivity Augmentation of Planar Disconnected Graphs"],"prefix":"10.1007","volume":"54","author":[{"given":"Greg","family":"Aloupis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Barba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"issue":"3","key":"9716_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.comgeo.2007.09.001","volume":"40","author":"M Abellanas","year":"2008","unstructured":"Abellanas, M., Garc\u00eda Olaverri, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comput. Geom. Theory Appl. 40(3), 220\u2013230 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9716_CR2","doi-asserted-by":"crossref","unstructured":"Alamdari, S., Angelini, P., Chan, T.M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.T.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 1656\u20131667. SIAM (2013)","DOI":"10.1137\/1.9781611973105.119"},{"key":"9716_CR3","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) Proceedings of the 41st International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 8572, pp. 126\u2013137. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-43948-7_11"},{"key":"9716_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0925-7721(93)90028-5","volume":"3","author":"B Aronov","year":"1993","unstructured":"Aronov, B., Seidel, R., Souvaine, D.L.: On compatible triangulations of simple polygons. Comput. Geom. Theory Appl. 3, 27\u201335 (1993)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9716_CR5","unstructured":"Babikov, M., Souvaine, D.L., Wenger, R.: Constructing piecewise linear homeomorphisms of polygons with holes. In: Proceedings of the 9th Canadian Conference on Computational Geometry (1997)"},{"key":"9716_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2307\/2304300","volume":"51","author":"SS Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. Am. Math. Mon. 51, 247\u2013252 (1944)","journal-title":"Am. Math. Mon."},{"key":"9716_CR7","unstructured":"Callahan, P.B., Rao Kosaraju, S.: Faster algorithms for some geometric graph problems in higher dimensions. In: Ramachandran, V. (ed.) Proceedings of the Fourth Annual ACM\/SIGACT\u2013SIAM Symposium on Discrete Algorithms, pp. 291\u2013300. ACM\/SIAM (1993)"},{"key":"9716_CR8","doi-asserted-by":"crossref","unstructured":"Chin, F., Snoeyink, J., An Wang, C.: Finding the medial axis of a simple polygon in linear time. In: Algorithms and Computations, pp. 382\u2013391. Springer, Berlin (1995)","DOI":"10.1007\/BFb0015444"},{"key":"9716_CR9","doi-asserted-by":"crossref","unstructured":"Erten, C., Kobourov, S.G., Pitta, C.: Intersection-free morphing of planar graphs. In: Liotta, G. (ed.) Proceedings of the 11th International Symposium on Graph Drawing. Lecture Notes in Computer Science, vol. 2912, pp. 320\u2013331. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24595-7_30"},{"key":"9716_CR10","doi-asserted-by":"crossref","unstructured":"Fejes, L.: \u00dcber einen geometrischen Satz. Math. Z. 46(1), 83\u201385 (1940)","DOI":"10.1007\/BF01181430"},{"key":"9716_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1112\/S0025579300000784","volume":"2","author":"L Few","year":"1955","unstructured":"Few, L.: The shortest path and the shortest road through $$n$$ n points. Mathematika 2, 141\u2013144 (1955)","journal-title":"Mathematika"},{"issue":"3","key":"9716_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.7155\/jgaa.00057","volume":"6","author":"C Friedrich","year":"2002","unstructured":"Friedrich, C., Eades, P.: Graph drawing in motion. J. Graph Algorithms Appl. 6(3), 353\u2013370 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"9716_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0097-8493(00)00108-4","volume":"25","author":"C Gotsman","year":"2001","unstructured":"Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Comput. Graph. 25(1), 67\u201375 (2001)","journal-title":"Comput. Graph."},{"key":"9716_CR14","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B., Shephard, G.C.: The geometry of planar graphs. In: Temperley, H.N.V. (ed.) Combinatorics, Proceedings of the Eighth British Combinatorial Conference, London Mathematical Society Lecture Note Series, vol. 52, pp. 124\u2013150. Cambridge UniversityPress, Cambridge (1981)","DOI":"10.1017\/CBO9780511662157.008"},{"issue":"2","key":"9716_CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1142\/S0218195999000121","volume":"9","author":"E Kranakis","year":"1999","unstructured":"Kranakis, E., Urrutia, J.: Isomorphic triangulations with small number of Steiner points. Int. J. Comput. Geom. Appl. 9(2), 171\u2013180 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9716_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0095-8956(84)90067-4","volume":"37","author":"S Moran","year":"1984","unstructured":"Moran, S.: On the length of the optimal TSP circuits in sets of bounded diameter. J. Comb. Theory, Ser. B 37, 113\u2013141 (1984)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"9716_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"9716_CR18","doi-asserted-by":"crossref","unstructured":"Ruppert, Jim: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548\u2013585 (1995)","DOI":"10.1006\/jagm.1995.1021"},{"issue":"2","key":"9716_CR19","doi-asserted-by":"crossref","first-page":"599","DOI":"10.7155\/jgaa.00275","volume":"16","author":"I Rutter","year":"2012","unstructured":"Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. J. Graph Algorithms Appl. 16(2), 599\u2013628 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"9716_CR20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/502783.502784","volume":"20","author":"V Surazhsky","year":"2001","unstructured":"Surazhsky, V., Gotsman, C.: Controllable morphing of compatible planar triangulations. ACM Trans. Graph. 20(4), 203\u2013231 (2001)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"9716_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1142\/S0218654303000115","volume":"9","author":"V Surazhsky","year":"2003","unstructured":"Surazhsky, V., Gotsman, C.: Intrinsic morphing of compatible triangulations. Int. J. Shape Model. 9(2), 191\u2013202 (2003)","journal-title":"Int. J. Shape Model."},{"issue":"3","key":"9716_CR22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(83)90038-2","volume":"34","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Deformations of plane graphs. J. Comb. Theory, Ser. B 34(3), 244\u2013257 (1983)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"9716_CR23","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejc.2011.09.002","volume":"33","author":"CD T\u00f3th","year":"2012","unstructured":"T\u00f3th, C.D.: Connectivity augmentation in planar straight line graphs. Eur. J. Comb. 33(3), 408\u2013425 (2012)","journal-title":"Eur. J. Comb."},{"issue":"6","key":"9716_CR24","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1090\/S0002-9939-1951-0045403-1","volume":"2","author":"S Verblunsky","year":"1951","unstructured":"Verblunsky, S.: On the shortest path through a number of points. Proc. Am. Math. Soc. 2(6), 904\u2013913 (1951)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9716-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-015-9716-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9716-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T09:18:18Z","timestamp":1566983898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-015-9716-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,17]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9716"],"URL":"https:\/\/doi.org\/10.1007\/s00454-015-9716-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,17]]}}}