{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:40:40Z","timestamp":1766378440544,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030682101"},{"type":"electronic","value":"9783030682118"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68211-8_20","type":"book-chapter","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:20:57Z","timestamp":1613690457000},"page":"247-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["2-Colored Point-Set Embeddings of Partial 2-Trees"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"suffix":"Jr.","given":"Jaroslav","family":"Han\u010dl","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"issue":"2\u20133","key":"20_CR1","first-page":"141","volume":"93","author":"M Abellanas","year":"1999","unstructured":"Abellanas, M., Garcia-Lopez, J., Hern\u00e1ndez-Pe\u00f1ver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. DAM 93(2\u20133), 141\u2013148 (1999)","journal-title":"DAM"},{"key":"20_CR2","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, 101\u2013103 (1990)","journal-title":"Discrete Math."},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"731","DOI":"10.7155\/jgaa.00437","volume":"21","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. JGAA 21(4), 731\u2013755 (2017)","journal-title":"JGAA"},{"issue":"2\u20133","key":"20_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2\u20133), 129\u2013142 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561\u20131583 (2019)","DOI":"10.1007\/s00453-018-0487-5"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"2","author":"P Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. JGAA 2(1), 1\u201315 (1997)","journal-title":"JGAA"},{"key":"20_CR7","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)","journal-title":"Comput. Geom."},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.7155\/jgaa.00461","volume":"22","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Computing nodetrix representations of clustered graphs. JGAA 22(2), 139\u2013176 (2018)","journal-title":"JGAA"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"12","author":"E Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: $$k-$$colored point-set embeddability of outerplanar graphs. JGAA 12(1), 29\u201349 (2008)","journal-title":"JGAA"},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1142\/S021819591000344X","volume":"20","author":"E Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Constrained point-set embeddability of planar graphs. Int. J. Comput. Geometry Appl. 20(5), 577\u2013600 (2010)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., G\u0105sieniec, L., Liotta, G., Navarra, A.: Colored point-set embeddings of acyclic graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 413\u2013425. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_32","DOI":"10.1007\/978-3-319-73915-1_32"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jda.2012.04.012","volume":"16","author":"E Di Giacomo","year":"2012","unstructured":"Di Giacomo, E., Grilli, L., Krug, M., Liotta, G., Rutter, I.: Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16, 34\u201352 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054106004273","volume":"17","author":"E Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. Int. J. Found. Comput. Sci. 17(5), 1071\u20131094 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"20_CR14","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 497\u2013522 (2004)"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. JGAA 7(4), 363\u2013398 (2003)","journal-title":"JGAA"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02573994","volume":"11","author":"Y Ikebe","year":"1994","unstructured":"Ikebe, Y., Perles, M.A., Tamura, A., Tokunaga, S.: The rooted tree embedding problem into points in the plane. Discrete Comput. Geometry 11(1), 51\u201363 (1994). https:\/\/doi.org\/10.1007\/BF02573994","journal-title":"Discrete Comput. Geometry"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kaneko, A., Kano, M., Suzuki, K.: Path coverings of two sets of points in the plane. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs, Volume 342 of Contemporary Mathematics. American Mathematical Society (2004)","DOI":"10.1090\/conm\/342\/06134"},{"key":"20_CR18","first-page":"73","volume":"10","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A., Kano, M., Yoshimoto, K.: Alternating hamilton cycles with minimum number of crossing in the plane. IJCGA 10, 73\u201378 (2000)","journal-title":"IJCGA"},{"key":"20_CR19","unstructured":"Kano, M.: Discrete geometry on red and blue points on the plane lattice. In: Proceedings of JCCGG 2009, pp. 30\u201333 (2009)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-10801-4_21","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"M Kaufmann","year":"2019","unstructured":"Kaufmann, M.: On point set embeddings for k-planar graphs with few bends per edge. In: Catania, B., Kr\u00e1lovi\u010d, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 260\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10801-4_21"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: few bends suffice for planar graphs. J. Graph Algorithms Appl. 6(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f6r\u0151csik, J.: Layout of rooted tree. In: Trotter, W.T. (ed.) Planar Graphs (DIMACS Series in Discrete Mathematics and Theoretical Computer Science), vol. 9, pp. 131\u2013137. American Mathematical Society (1993)","DOI":"10.1090\/dimacs\/009\/11"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graph. Combin. 17(4), 717\u2013728 (2001)","journal-title":"Graph. Combin."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0012-365X(95)00201-7","volume":"150","author":"S Tokunaga","year":"1996","unstructured":"Tokunaga, S.: On a straight-line embedding problem graphs. Discrete Math. 150, 371\u2013378 (1996)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68211-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:14:02Z","timestamp":1619302442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68211-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030682101","9783030682118"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68211-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yangon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Myanmar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uit.edu.mm\/walcom-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}