{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:56:25Z","timestamp":1767239785587},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T00:00:00Z","timestamp":1424995200000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00373-015-1547-0","type":"journal-article","created":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T11:06:44Z","timestamp":1424948804000},"page":"427-452","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Geometric Biplane Graphs II: Graph Augmentation"],"prefix":"10.1007","volume":"31","author":[{"given":"Alfredo","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In\u00eas","family":"Matos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Saumell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Tejel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,27]]},"reference":[{"issue":"3","key":"1547_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, 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":"1547_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4614-0110-0_5","volume-title":"Thirty Essays on Geometric Graph Theory","author":"M Al-Jubeh","year":"2013","unstructured":"Al-Jubeh, M., Barequet, G., Ishaque, M., Souvaine, D.L., T\u00f3th, C.D., Winslow, A.: Constrained tri-connected planar straight line graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 49\u201370. Springer, New York (2013)"},{"issue":"4","key":"1547_CR3","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s00453-011-9551-0","volume":"61","author":"M Al-Jubeh","year":"2011","unstructured":"Al-Jubeh, M., Ishaque, M., R\u00e9dei, K., Souvaine, D.L., T\u00f3th, C.D., Valtr, P.: Augmenting the edge connectivity of planar straight line graphs to three. Algorithmica 61(4), 971\u2013999 (2011)","journal-title":"Algorithmica"},{"key":"1547_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(74)90035-1","volume":"7","author":"D Barnette","year":"1974","unstructured":"Barnette, D.: On generating planar graphs. Discrete Math. 7, 199\u2013208 (1974)","journal-title":"Discrete Math."},{"key":"1547_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proc. LATIN 2000, LNCS, vol. 1776, pp. 88\u201394. Springer, Berlin (2000)","DOI":"10.1007\/10719839_9"},{"key":"1547_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B 27, 320\u2013331 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2\u20133","key":"1547_CR7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.disc.2005.06.019","volume":"301","author":"G Brinkmann","year":"2005","unstructured":"Brinkmann, G., McKay, B.D.: Construction of planar triangulations with minimum degree 5. Discrete Math. 301(2\u20133), 147\u2013163 (2005)","journal-title":"Discrete Math."},{"issue":"3","key":"1547_CR8","doi-asserted-by":"crossref","first-page":"686","DOI":"10.4153\/CJM-1974-065-6","volume":"I","author":"JW Butler","year":"1974","unstructured":"Butler, J.W.: A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs. Can. J. Math. XXV I(3), 686\u2013708 (1974)","journal-title":"Can. J. Math. XXV"},{"key":"1547_CR9","first-page":"403","volume-title":"The Traveling Salesman Problem","author":"V Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal, V.: Hamiltonian cycles. In: Lawler, E.L., et al. (eds.) The Traveling Salesman Problem, pp. 403\u2013429. Wiley, Chichester (1985)"},{"key":"1547_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-7721(96)00003-X","volume":"8","author":"TK Dey","year":"1997","unstructured":"Dey, T.K., Dillencourt, M.B., Ghosh, S.K., Cahill, J.M.: Triangulating with high connectivity. Comput. Geom. Theory Appl. 8, 39\u201356 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1547_CR11","unstructured":"Diwan, A.A., Ghosh, S.K., Roy, B.: Four-connected triangulations of planar point sets (manuscript, arXiv:1310.1726 ) (2013)"},{"key":"1547_CR12","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kranakis, E., Krizanc, D., Morales Ponce, O., Stacho, L.: Approximating the edge length of 2-edge connected planar geometric graphs on a set of points. In: Proc. LATIN 2012, LNCS 7256, pp. 255\u2013266. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29344-3_22"},{"key":"1547_CR13","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5, 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"key":"1547_CR14","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"9","key":"1547_CR15","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.comgeo.2009.03.005","volume":"42","author":"A Garc\u00eda","year":"2009","unstructured":"Garc\u00eda, A., Huemer, C., Hurtado, F., Tejel, J., Valtr, P.: On triconnected and cubic plane graphs on given point sets. Comput. Geom. Theory Appl. 42(9), 913\u2013922 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1547_CR16","unstructured":"Garc\u00eda, A., Huemer, C., Tejel, J., Valtr, P.: On 4-connected geometric graphs. In: Proc. XV Spanish Meeting on Computational Geometry, Sevilla, pp. 123\u2013126 (2013)"},{"key":"1547_CR17","unstructured":"Garc\u00eda, A., Huemer, C., Tejel, J., Valtr, P.: Personal communication (manuscript in preparation) (2014)"},{"key":"1547_CR18","unstructured":"Garc\u00eda, A., Hurtado, F., Korman, M., Matos, I., Saumell, M., Silveira, R.I., Tejel, J., T\u00f3th, C.D.: Geometric biplane graphs I: Maximal graphs. Extended abstract. In: Proc. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, pp. 123\u2013134 (2013)"},{"key":"1547_CR19","unstructured":"Garc\u00eda, A., Hurtado, F., Korman, M., Matos, I., Saumell, M., Silveira, R.I., Tejel, J., T\u00f3th, C.D.: Geometric biplane graphs II: graph augmentation. Extended abstract. In: Proc. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, pp. 223\u2013234 (2013)"},{"issue":"2","key":"1547_CR20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1547_CR21","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J Hershberger","year":"1992","unstructured":"Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32(2), 249\u2013267 (1992)","journal-title":"BIT"},{"key":"1547_CR22","doi-asserted-by":"crossref","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-0110-0_17"},{"key":"1547_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"JP Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T.C., Vince, A.: On representations of some thickness-two graphs. Comput. Geom. Theory Appl. 13, 161\u2013171 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1547_CR24","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morales Ponce, O., Stacho, L.: Bounded length, 2-edge augmantation of geometric planar graphs. Discrete Math. Algebra Appl. 4, 385\u2013397 (2012)","DOI":"10.1142\/S179383091250036X"},{"issue":"2","key":"1547_CR25","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":"6","key":"1547_CR26","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1547_CR27","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. Combin. 33(3), 408\u2013425 (2012)","journal-title":"Eur. J. Combin."},{"key":"1547_CR28","unstructured":"T\u00f3th, G., Valtr, P.: The Erd\u0151s-Szekeres theorem: upper bounds and related results. In: Combinatorial and Computational Geometry, vol. 52. MSRI Publications, pp. 557\u2013568 (2005)"},{"key":"1547_CR29","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"WT Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99\u2013116 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"1547_CR30","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical Report 298, Princeton University, EECS Department (1982)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1547-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1547-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1547-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T08:47:06Z","timestamp":1566377226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1547-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,27]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1547"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1547-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,27]]}}}