{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:46Z","timestamp":1767339586246,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_7","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T19:09:24Z","timestamp":1579892964000},"page":"79-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric Planar Networks on Bichromatic Points"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8875-0102","authenticated-orcid":false,"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7544-6125","authenticated-orcid":false,"given":"Aritra","family":"Banik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0104-1659","authenticated-orcid":false,"given":"Sujoy","family":"Bhore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.comgeo.2015.06.005","volume":"48","author":"A Karim Abu-Affash","year":"2015","unstructured":"Karim Abu-Affash, A., Biniaz, A., Carmi, P., Maheshwari, A., Smid, M.H.M.: Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9), 718\u2013731 (2015)","journal-title":"Comput. Geom."},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"1999","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S Anily","year":"1992","unstructured":"Anily, S., Hassin, R.: The swapping problem. Networks 22(4), 419\u2013433 (1992)","journal-title":"Networks"},{"issue":"5","key":"7_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Banik, A., Bhore, S., N\u00f6llenburg, M.: Geometric planar networks on bichromatic points. CoRR, \narXiv:1911.08924\n\n (2019)","DOI":"10.1007\/978-3-030-39219-2_7"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","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. Comb. Theory Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.comgeo.2016.05.004","volume":"57","author":"A Biniaz","year":"2016","unstructured":"Biniaz, A., Bose, P., Maheshwari, A., Smid, M.H.M.: Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57, 27\u201339 (2016)","journal-title":"Comput. Geom."},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1007\/s00454-017-9881-z","volume":"59","author":"A Biniaz","year":"2018","unstructured":"Biniaz, A., Bose, P., Maheshwari, A., Smid, M.H.M.: Plane bichromatic trees of low degree. Discrete Comput. Geom. 59(4), 864\u2013885 (2018)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.jda.2008.08.001","volume":"7","author":"MG Borgelt","year":"2009","unstructured":"Borgelt, M.G., van Kreveld, M.J., L\u00f6ffler, M., Luo, J., Merrick, D., Silveira, R.I., Vahedi, M.: Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4), 469\u2013478 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.comgeo.2016.07.005","volume":"58","author":"WS Evans","year":"2016","unstructured":"Evans, W.S., Liotta, G., Meijer, H., Wismath, S.K.: Alternating paths and cycles of minimum length. Comput. Geom. 58, 124\u2013135 (2016)","journal-title":"Comput. Geom."},{"key":"7_CR11","unstructured":"Frank, A., Triesch, E., Korte, B., Vygen, J.: On the bipartite travelling salesman problem (1998)"},{"key":"7_CR12","unstructured":"Kaneko, A., Kano, M., Suzuki, K.: Balanced partitions and path covering of two sets of points in the plane, preprint"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/PL00009441","volume":"21","author":"A Kaneko","year":"1999","unstructured":"Kaneko, A., Kano, M.: Straight-line embeddings of two rooted trees in the plane. Discrete Comput. Geom. 21(4), 603\u2013613 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete and Computational Geometry","author":"A Kaneko","year":"2003","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, pp. 551\u2013570. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-642-55566-4_25"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In: Symposium on Discrete Algorithms, SODA 2017, pp. 2495\u20132504 (2017)","DOI":"10.1137\/1.9781611974782.165"},{"issue":"19","key":"7_CR16","doi-asserted-by":"publisher","first-page":"4315","DOI":"10.1016\/j.disc.2007.08.013","volume":"308","author":"J Kyncl","year":"2008","unstructured":"Kyncl, J., Pach, J., T\u00f3th, G.: Long alternating paths in bicolored point sets. Discrete Math. 308(19), 4315\u20134321 (2008)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:01:49Z","timestamp":1579910509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}