{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:26Z","timestamp":1767314366744,"version":"3.48.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","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-3-032-11835-6_31","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:34:56Z","timestamp":1767314096000},"page":"431-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Plane Cycles in\u00a0Geometric Multipartite Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4502-8571","authenticated-orcid":false,"given":"Marco","family":"Ricci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6769-7098","authenticated-orcid":false,"given":"Jonathan","family":"Rollin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2134-4852","authenticated-orcid":false,"given":"Andr\u00e9","family":"Schulz","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,1,2]]},"reference":[{"key":"31_CR1","unstructured":"Abellanas, M., Garc\u00eda, A., Hurtado, F., Tejel, J.: Caminos alternantes. In: Proceedings of the X Encuentros de Geometr\u00eda Computacional (EGC X), pp. 7\u201312 (2003). https:\/\/dccg.upc.edu\/people\/ferran\/alternatingPaths.pdf"},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Akitaya, H.A., Korman, M., Rudoy, M., Souvaine, D.L., T\u00f3th, C.D.: Circumscribing polygons and polygonizations for disjoint line segments. In: Barequet, G., Wang, Y. (eds.) 35th International Symposium on Computational Geometry (SoCG 2019), pp. 9:1\u20139:17 (2019). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2019.9","DOI":"10.4230\/LIPICS.SOCG.2019.9"},{"issue":"1","key":"31_CR3","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. Discret. Math. 84(1), 101\u2013103 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90276-N","journal-title":"Discret. Math."},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-39219-2_7","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Bandyapadhyay","year":"2020","unstructured":"Bandyapadhyay, S., Banik, A., Bhore, S., N\u00f6llenburg, M.: Geometric planar networks on bichromatic points. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 79\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_7"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/J.TCS.2021.09.035","volume":"895","author":"S Bandyapadhyay","year":"2021","unstructured":"Bandyapadhyay, S., Banik, A., Bhore, S., N\u00f6llenburg, M.: Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895, 124\u2013136 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2021.09.035","journal-title":"Theor. Comput. Sci."},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. 23(3), 303\u2013312 (2002). https:\/\/doi.org\/10.1016\/S0925-7721(01)00069-4","journal-title":"Comput. Geom."},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/JGAA.00132","volume":"10","author":"S Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is np-hard. J. Graph Algorithms Appl. 10(2), 353\u2013363 (2006). https:\/\/doi.org\/10.7155\/JGAA.00132","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR9","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). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_18"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/J.COMGEO.2017.05.009","volume":"68","author":"M Claverol","year":"2018","unstructured":"Claverol, M., Olaverri, A.G., Garijo, D., Seara, C., Tejel, J.: On Hamiltonian alternating cycles and paths. Comput. Geom. 68, 146\u2013166 (2018). https:\/\/doi.org\/10.1016\/J.COMGEO.2017.05.009","journal-title":"Comput. Geom."},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976). https:\/\/doi.org\/10.1137\/0205049","journal-title":"SIAM J. Comput."},{"key":"31_CR12","unstructured":"Jiang, R., Jiang, K., Jiang, M.: Linking disjoint segments into a simple polygon is hard (2021). http:\/\/arxiv.org\/abs\/2108.12812. Preprint"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane\u2014a survey\u2014. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and computational geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol 25, pp. 551\u2013570. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-55566-4_25","DOI":"10.1007\/978-3-642-55566-4_25"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-47738-1_17","volume-title":"Discrete and Computational Geometry","author":"A Kaneko","year":"2001","unstructured":"Kaneko, A., Kano, M.: On paths in a complete bipartite geometric graph. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol. 2098, pp. 187\u2013191. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47738-1_17"},{"issue":"1","key":"31_CR15","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(1), 73\u201378 (2000). https:\/\/doi.org\/10.1142\/S021819590000005X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S00373-020-02210-8","volume":"37","author":"M Kano","year":"2021","unstructured":"Kano, M., Urrutia, J.: Discrete geometry on colored point sets in the plane\u2013a survey. Graphs Combin. 37(1), 1\u201353 (2021). https:\/\/doi.org\/10.1007\/S00373-020-02210-8","journal-title":"Graphs Combin."},{"issue":"19","key":"31_CR17","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. Discret. Math. 308(19), 4315\u20134321 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.08.013","journal-title":"Discret. Math."},{"issue":"15","key":"31_CR18","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. Discret. Math. 306(15), 1791\u20131797 (2006). https:\/\/doi.org\/10.1016\/J.DISC.2006.03.035","journal-title":"Discret. Math."},{"key":"31_CR19","unstructured":"M\u00e9sz\u00e1ros, V.: Extremal problems on planar point sets. Ph.D. thesis, University of Szeged, Bolyai Institute (2011)"},{"key":"31_CR20","doi-asserted-by":"publisher","unstructured":"Mulzer, W., Valtr, P.: Long alternating paths exist. In: Cabello, S., Chen, D.Z. (eds.) 36th International Symposium on Computational Geometry (SoCG 2020), pp. 57:1\u201357:16 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.57","DOI":"10.4230\/LIPIcs.SoCG.2020.57"},{"issue":"6","key":"31_CR21","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1137\/0218075","volume":"18","author":"D Rappaport","year":"1989","unstructured":"Rappaport, D.: Computing simple circuits from a set of line segments is NP-complete. SIAM J. Comput. 18(6), 1128\u20131139 (1989). https:\/\/doi.org\/10.1137\/0218075","journal-title":"SIAM J. Comput."},{"key":"31_CR22","unstructured":"Ricci, M., Rollin, J., Schulz, A., Weinberger, A.: On plane cycles in geometric multipartite graphs (2025). http:\/\/arxiv.org\/abs\/2506.20421. Preprint"},{"key":"31_CR23","doi-asserted-by":"publisher","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discret. Comput. Geom. 1, 343\u2013353 (1986). https:\/\/doi.org\/10.1007\/BF02187706","DOI":"10.1007\/BF02187706"},{"key":"31_CR24","unstructured":"Soukup, J.: Bicolored point sets admitting non-crossing alternating Hamiltonian paths (2024). http:\/\/arxiv.org\/abs\/2404.06105. Preprint"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:34:57Z","timestamp":1767314097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_31","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}