{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:58:29Z","timestamp":1743080309461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":72,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319485317"},{"type":"electronic","value":"9783319485324"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48532-4_25","type":"book-chapter","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T09:13:16Z","timestamp":1479892396000},"page":"277-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Mathematics of Ferran Hurtado: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Urrutia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,24]]},"reference":[{"key":"25_CR1","unstructured":"Abellanas, M., Garc\u00eda, A., Hurtado, F., Tejel, J.: Caminos alternantes. In: Proceedings of the X Encuentros de Geometr\u00eda Computacional: Sevilla, Junio 16\u201317, pp. 7\u201312 (2003)"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","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. 40(3), 220\u2013230 (2008)","journal-title":"Comput. Geom."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1111\/1467-8659.1230143","volume":"12","author":"M Abellanas","year":"1993","unstructured":"Abellanas, M., Garc\u00eda, J., Hern\u00e1ndez, G., Hurtado, F., Serra, O., Urrutia, J.: Updating polygonizations. Comput. Graph. Forum 12(3), 143\u2013152 (1993)","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(99)00042-6","volume":"93","author":"M Abellanas","year":"1999","unstructured":"Abellanas, M., Garc\u00eda, J., Hern\u00e1ndez, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discrete Appl. Math. 93(2), 141\u2013148 (1999)","journal-title":"Discrete Appl. Math."},{"key":"25_CR5","unstructured":"Abellanas, M., Hurtado, F., Ramos, P.A.: Tolerance of geometric structures. In: CCCG, pp. 250\u2013255 (1994)"},{"key":"25_CR6","unstructured":"Abellanas, M., Hurtado, F., Ramos, P.A.: Tolerancia de arreglos de segmentos. In: VI Encuentros de Geometr\u00eda Computacional: Barcelona, 5-6-7 de julio de, Departament de Matem\u00e0tica Aplicada II, Universitat Polit\u00e8cnica de Catalunya: Actas, pp. 77\u201384. Departament de Matem\u00e0tica Aplicada II (1995)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/2789149.2789162","volume":"46","author":"B Abrego","year":"2015","unstructured":"Abrego, B., Dumitrescu, A., Fern\u00e1ndez, S., T\u00f3th, C.D.: Computational geometry column 61. ACM SIGACT News 46(2), 65\u201377 (2015)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.comgeo.2008.05.004","volume":"42","author":"E Ackerman","year":"2009","unstructured":"Ackerman, E., Aichholzer, O., Keszegh, B.: Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42(3), 241\u2013249 (2009)","journal-title":"Comput. Geom."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Ackerman, E., J\u00e1nos, P., Pinchasi, R., Rac\u0306i\u0107, R., T\u00f3th, G.: A note on coloring line arrangements. Electron. J. Combin. 21(2), Paper p2.23 (2012)","DOI":"10.37236\/2660"},{"issue":"02","key":"25_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1142\/S0129054102001102","volume":"13","author":"O Aichholzer","year":"2002","unstructured":"Aichholzer, O., Alboul, L.S., Hurtado, F.: On flips in polyhedral surfaces. Int. J. Found. Comput. Sci. 13(02), 303\u2013311 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.comgeo.2011.09.001","volume":"45","author":"O Aichholzer","year":"2012","unstructured":"Aichholzer, O., Aurenhammer, F., Demaine, E.D., Hurtado, F., Ramos, P., Urrutia, J.: On k-convex polygons. Comput. Geom. 45(3), 73\u201387 (2012)","journal-title":"Comput. Geom."},{"issue":"8","key":"25_CR12","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.comgeo.2014.04.004","volume":"47","author":"O Aichholzer","year":"2014","unstructured":"Aichholzer, O., Aurenhammer, F., Hackl, T., Hurtado, F., Pilz, A., Ramos, P., Urrutia, J., Valtr, P., Vogtenhuber, B.: On k-convex point sets. Comput. Geom. 47(8), 809\u2013832 (2014)","journal-title":"Comput. Geom."},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(02)00428-0","volume":"296","author":"O Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F., Krasser, H.: Towards compatible triangulations. Theor. Comput. Sci. 296(1), 3\u201313 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"25_CR14","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1016\/j.comgeo.2009.04.002","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer, O., Fabila-Monroy, R., Flores-Pe\u00f1aloza, D., Hackl, T., Huemer, C., Urrutia, J.: Empty monochromatic triangles. Comput. Geom. 42(9), 934\u2013938 (2009)","journal-title":"Comput. Geom."},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.comgeo.2012.02.005","volume":"46","author":"O Aichholzer","year":"2013","unstructured":"Aichholzer, O., Fabila-Monroy, R., Hackl, T., Van Kreveld, M., Pilz, A., Ramos, P., Vogtenhuber, B.: Blocking delaunay triangulations. Comput. Geom. 46(2), 154\u2013159 (2013)","journal-title":"Comput. Geom."},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Comb. 23(1), 67\u201384 (2007)","journal-title":"Graphs Comb."},{"issue":"4","key":"25_CR17","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1137\/090767947","volume":"23","author":"O Aichholzer","year":"2010","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Vogtenhuber, B.: Large bichromatic point sets admit empty monochromatic 4-gons. SIAM J. Discrete Math. 23(4), 2147\u20132155 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.comgeo.2004.02.003","volume":"29","author":"O Aichholzer","year":"2004","unstructured":"Aichholzer, O., Hurtado, F., Noy, M.: A lower bound on the number of triangulations of planar point sets. Comput. Geom. 29(2), 135\u2013145 (2004)","journal-title":"Comput. Geom."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-0208(08)73484-4","volume":"60","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. North-Holland Math. Stud. 60, 9\u201312 (1982)","journal-title":"North-Holland Math. Stud."},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(90)90276-N","volume":"84","author":"J Akiyama","year":"1990","unstructured":"Akiyama, J., Urrutia, J.: Simple alternating path problem. Discrete Math. 84(1), 101\u2013103 (1990)","journal-title":"Discrete Math."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-55566-4_6","volume-title":"Discrete and Computational Geometry","author":"EM Arkin","year":"2003","unstructured":"Arkin, E.M., Mitchell, J.S.B., Fekete, S.P., Hurtado, F., Noy, M., Sacrist\u00e1n, V., Sethia, S.: On the reflexivity of point sets. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, pp. 139\u2013156. Springer, New York (2003)"},{"issue":"6","key":"25_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.comgeo.2011.01.001","volume":"44","author":"B Aronov","year":"2011","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness (delaunay) graphs. Comput. Geom. 44(6), 329\u2013344 (2011)","journal-title":"Comput. Geom."},{"issue":"7","key":"25_CR23","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.comgeo.2011.06.004","volume":"46","author":"B Aronov","year":"2013","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness gabriel graphs. Comput. Geom. 46(7), 894\u2013908 (2013)","journal-title":"Comput. Geom."},{"issue":"4","key":"25_CR24","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s00373-013-1316-x","volume":"30","author":"B Aronov","year":"2013","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness rectangle graphs. Graphs Comb. 30(4), 827\u2013846 (2013)","journal-title":"Graphs Comb."},{"issue":"3","key":"25_CR25","first-page":"139","volume":"15","author":"P Bose","year":"2013","unstructured":"Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., Taslakian, P.: Coloring and guarding arrangements. Discrete Math. Theor. Comput. Sci. 15(3), 139\u2013154 (2013)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"25_CR26","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/jgt.20214","volume":"54","author":"P Bose","year":"2007","unstructured":"Bose, P., Czyzowicz, J., Gao, Z., Morin, P., Wood, D.R.: Simultaneous diagonal flips in plane triangulations. J. Graph Theory 54(4), 307\u2013330 (2007)","journal-title":"J. Graph Theory"},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.comgeo.2008.04.001","volume":"42","author":"P Bose","year":"2009","unstructured":"Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geom. 42(1), 60\u201380 (2009)","journal-title":"Comput. Geom."},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-00219-9_18","volume-title":"Graph Drawing","author":"J Cibulka","year":"2009","unstructured":"Cibulka, J., Kyn\u010dl, J., M\u00e9sz\u00e1ros, V., Stola\u0159, R., Valtr, P.: Hamiltonian alternating paths on bicolored double-chains. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"key":"25_CR29","unstructured":"Claverol, M., Garijo, D., Hurtado, F., Cuevas, D.L., Seara, C.: The alternating path problem revisited. In: Proceedings XIV Spanish Meeting on Computational Geometry, EGC 2011, Alcal\u00e1 de Henares, Spain, June 27\u201330, 2011, pp. 115\u2013118. Universidad de Sevilla (2013)"},{"issue":"3","key":"25_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0925-7721(03)00013-0","volume":"26","author":"O Devillers","year":"2003","unstructured":"Devillers, O., Hurtado, F., K\u00e1rolyi, G., Seara, C.: Chromatic variants of the erdos-szekeres theorem on points in convex position. Comput. Geom. 26(3), 193\u2013208 (2003)","journal-title":"Comput. Geom."},{"issue":"2","key":"25_CR31","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1137\/110849407","volume":"27","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Schulz, A., Sheffer, A., T\u00f3th, C.D.: Bounds on the maximum multiplicity of some common geometric graphs. SIAM J. Discrete Math. 27(2), 802\u2013826 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR32","unstructured":"Enomoto, H., Kanda, K., Masui, T., Oda, Y., Ota, K.: Private communication"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02414146","volume":"103","author":"P Erd\u00f6s","year":"1975","unstructured":"Erd\u00f6s, P.: On some problems of elementary and combinatorial geometry. Annali di Matematica pura ed applicata 103(1), 99\u2013108 (1975)","journal-title":"Annali di Matematica pura ed applicata"},{"key":"25_CR34","first-page":"463","volume":"2","author":"P Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"25_CR35","unstructured":"Frati, F.: Planar packing of diameter-four trees. In: Proceedings of the XXI Canadian Conference on Computational Geometry: Vancouver, BC, August 17\u201319, 2009, pp. 95\u201398 (2009)"},{"issue":"6","key":"25_CR36","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ipl.2008.11.002","volume":"109","author":"F Frati","year":"2009","unstructured":"Frati, F., Geyer, M., Kaufmann, M.: Planar packing of trees and spider trees. Inform. Process. Lett. 109(6), 301\u2013307 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"02","key":"25_CR37","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1142\/S0218195903001098","volume":"13","author":"J Galtier","year":"2003","unstructured":"Galtier, J., Hurtado, F., Noy, M., P\u00e9rennes, S., Urrutia, J.: Simultaneous edge flipping in triangulations. Int. J. Comput. Geom. Appl. 13(02), 113\u2013133 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"25_CR38","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/jgt.10042","volume":"40","author":"A Garc\u00eda","year":"2002","unstructured":"Garc\u00eda, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.: Packing trees into planar graphs. J. Graph Theory 40(3), 172\u2013181 (2002)","journal-title":"J. Graph Theory"},{"issue":"5","key":"25_CR39","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.comgeo.2013.12.009","volume":"47","author":"A Garc\u00eda","year":"2014","unstructured":"Garc\u00eda, A., Huemer, C., Hurtado, F., Tejel, J.: Compatible spanning trees. Comput. Geom. 47(5), 563\u2013584 (2014)","journal-title":"Comput. Geom."},{"issue":"2","key":"25_CR40","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s00373-015-1546-1","volume":"31","author":"A Garc\u00eda","year":"2015","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. Graphs Comb. 31(2), 407\u2013425 (2015)","journal-title":"Graphs Comb."},{"issue":"2","key":"25_CR41","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00373-015-1547-0","volume":"31","author":"A Garc\u00eda","year":"2015","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. Graphs Comb. 31(2), 427\u2013452 (2015)","journal-title":"Graphs Comb."},{"issue":"4","key":"25_CR42","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of $$k_n$$. Comput. Geom. 16(4), 211\u2013221 (2000)","journal-title":"Comput. Geom."},{"key":"25_CR43","unstructured":"Garc\u00eda, A., Tejel, J.: Private communication"},{"key":"25_CR44","unstructured":"Garc\u00eda-Lopez, J., Nicol\u00e1s, C.M.: A counterexample about convex partitions. In: IV Jornadas de Matem\u00e1tica Discreta y Algor\u00edtmica 2004, Cercedilla, 5\u20138 Septiembre, 2004, p. 213 (2004)"},{"key":"25_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40104-6_31","volume-title":"Algorithms and Data Structures","author":"M Geyer","year":"2013","unstructured":"Geyer, M., Hoffmann, M., Kaufmann, M., Kusters, V., T\u00f3th, C.D.: Planar packing of binary trees. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 353\u2013364. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40104-6_31"},{"key":"25_CR46","unstructured":"Gonz\u00e1lez-Mart\u00ednez, A.C., Cravioto-Lagos, J., Urrutia, J.: Almost empty monochromatic polygons in planar point sets. In: Actas XVI Spanish Meeting on Computational Geometry, Barcelona, 1\u20133 de julio, 2015, pp. 81\u201384 (2015)"},{"issue":"4","key":"25_CR47","first-page":"673","volume":"I","author":"A G\u00f6rlich","year":"2009","unstructured":"G\u00f6rlich, A.: Packing cycles and unicyclic graphs into planar graphs. Demonstr. Math. XLI I(4), 673\u2013679 (2009)","journal-title":"Demonstr. Math. XLI"},{"key":"25_CR48","unstructured":"Hajnal, P., M\u00e9sz\u00e1ros, V.: Note on noncrossing path in colored convex sets. Discr. Math. Theor. Comput. Sci. (2015, accepted)"},{"key":"25_CR49","first-page":"149","volume":"11","author":"SM Hedetniemi","year":"1981","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: A note on packing two trees into $$k_n$$. Ars Combin. 11, 149\u2013153 (1981)","journal-title":"Ars Combin."},{"issue":"4","key":"25_CR50","doi-asserted-by":"publisher","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"JD Horton","year":"1983","unstructured":"Horton, J.D.: Sets with no empty convex 7-gons. Can. Math. Bull. 26(4), 482 (1983)","journal-title":"Can. Math. Bull."},{"key":"25_CR51","unstructured":"Hurtado, F.A.: Problemes geom\u00e8trics de visibilitat. Ph.D. thesis, Departamento de Matem\u00e1tica Aplicada i Telem\u00e0tica, UPC (1993)"},{"key":"25_CR52","unstructured":"Hurtado, F.: Looking through a window. In: Proceedings of the Fifth Canadian Conference on Computational Geometry: University of Waterloo, August 5\u20139, 1993, pp. 234\u2013239 (1993)"},{"key":"25_CR53","unstructured":"Hurtado, F., Marc, N., El n\u00famero de triangulaciones de un pol\u00edgono. In: Proceedings of the IV Encuentros de Geometr\u00eda Computacional: Granada, pp. 1\u20136 (1993)"},{"issue":"1","key":"25_CR54","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(94)00331-C","volume":"149","author":"F Hurtado","year":"1996","unstructured":"Hurtado, F., Noy, M.: Ears of triangulations and catalan numbers. Discrete Math. 149(1), 319\u2013324 (1996)","journal-title":"Discrete Math."},{"issue":"6","key":"25_CR55","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0925-7721(95)00027-5","volume":"6","author":"F Hurtado","year":"1996","unstructured":"Hurtado, F., Noy, M.: Triangulations, visibility graph and reflex vertices of a simple polygon. Comput. Geom. 6(6), 355\u2013369 (1996)","journal-title":"Comput. Geom."},{"issue":"3","key":"25_CR56","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","volume":"13","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M.: Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. 13(3), 179\u2013188 (1999)","journal-title":"Comput. Geom."},{"issue":"3","key":"25_CR57","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete Comput. Geom. 22(3), 333\u2013346 (1999)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"25_CR58","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(95)00285-5","volume":"162","author":"F Hurtado","year":"1996","unstructured":"Hurtado, F., Serra, O., Urrutia, J.: Hiding points in arrangements of segments. Discrete Math. 162(1), 187\u2013197 (1996)","journal-title":"Discrete Math."},{"issue":"01","key":"25_CR59","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1142\/S021819590000005X","volume":"10","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A., Kano, M., Yoshimoto, K.: Alternating hamilton cycles with minimum number of crossings in the plane. Int. J. Comput. Geom. Appl. 10(01), 73\u201378 (2000)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"19","key":"25_CR60","doi-asserted-by":"publisher","first-page":"4315","DOI":"10.1016\/j.disc.2007.08.013","volume":"308","author":"J Kyn\u010dl","year":"2008","unstructured":"Kyn\u010dl, J., Pach, J., T\u00f3th, G.: Long alternating paths in bicolored point sets. Discrete Math. 308(19), 4315\u20134321 (2008)","journal-title":"Discrete Math."},{"issue":"6","key":"25_CR61","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/S0195-6698(89)80072-1","volume":"10","author":"CW Lee","year":"1989","unstructured":"Lee, C.W.: The associahedron and triangulations of the $$n$$-gon. Eur. J. Comb. 10(6), 551\u2013560 (1989)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"25_CR62","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"JM Lucas","year":"1993","unstructured":"Lucas, J.M., Vanbaronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms 15(3), 343\u2013366 (1993)","journal-title":"J. Algorithms"},{"issue":"15","key":"25_CR63","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1016\/j.disc.2006.03.035","volume":"306","author":"C Merino","year":"2006","unstructured":"Merino, C., Salazar, G., Urrutia, J.: On the length of longest alternating paths for multicoloured point sets in convex position. Discrete Math. 306(15), 1791\u20131797 (2006)","journal-title":"Discrete Math."},{"key":"25_CR64","unstructured":"Oda, Y., Ota, K.: Tight planar packings of two trees. In: Twenty-second European Workshop on Computational Geometry Delphi, Greece March 27\u201329, 2006, p. 215 (2006)"},{"issue":"9","key":"25_CR65","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.dam.2011.08.026","volume":"161","author":"J Pach","year":"2013","unstructured":"Pach, J., T\u00f3th, G.: Monochromatic empty triangles in two-colored point sets. Discrete Appl. Math. 161(9), 1259\u20131261 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"06","key":"25_CR66","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1017\/S096354831300031X","volume":"22","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A.: Counting plane graphs: cross-graph charging schemes. Comb. Probab. Comput. 22(06), 935\u2013954 (2013)","journal-title":"Comb. Probab. Comput."},{"issue":"7","key":"25_CR67","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.jcta.2011.04.002","volume":"118","author":"M Sharir","year":"2011","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: On degrees in random triangulations of point sets. J. Comb. Theory Ser. A 118(7), 1979\u20131999 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"key":"25_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-34191-5_13","volume-title":"Computational Geometry","author":"DL Souvaine","year":"2012","unstructured":"Souvaine, D.L., T\u00f3th, C.D., Winslow, A.: Simultaneously flippable edges in triangulations. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 138\u2013145. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34191-5_13"},{"issue":"3","key":"25_CR69","doi-asserted-by":"publisher","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":"2","key":"25_CR70","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0166-218X(94)00120-3","volume":"64","author":"M Urabe","year":"1996","unstructured":"Urabe, M.: On a partition into convex polygons. Discrete Appl. Math. 64(2), 179\u2013191 (1996)","journal-title":"Discrete Appl. Math."},{"key":"25_CR71","unstructured":"Urabe, M.: On a partition of point sets into convex polygons. In: Proceedings of the Ninth Canadian Conference on Computational Geometry, August 11\u201313, Queen\u2019s Universiy, Kingston, Ontario, pp. 179\u2013191 (1997)"},{"key":"25_CR72","unstructured":"Urrutia, J.: Coloraciones, tetraedralizaciones, y tetraedros vac\u00edos en coloraciones de conjuntos de puntos en $$\\mathbb{R}^3$$. In: Proceedings of the X Encuentros de Geometr\u00eda Computacional: Sevilla, Junio 16\u201317, 2003, pp. 95\u2013100 (2003)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry and Graphs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48532-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:09:29Z","timestamp":1710166169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-48532-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319485317","9783319485324"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48532-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry and Graphs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}