{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T22:36:09Z","timestamp":1784673369287,"version":"3.55.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["M2281-N35"],"award-info":[{"award-number":["M2281-N35"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00453-020-00725-3","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T14:03:27Z","timestamp":1591884207000},"page":"3282-3305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Embedding Graphs into Embedded Graphs"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8485-1774","authenticated-orcid":false,"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"issue":"4","key":"725_CR1","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s00454-017-9918-3","volume":"58","author":"HA Akitaya","year":"2017","unstructured":"Akitaya, H.A., Aloupis, G., Erickson, J., T\u00f3th, C.D.: Recognizing weakly simple polygons. Discrete Comput. Geom. 58(4), 785\u2013821 (2017)","journal-title":"Discrete Comput. Geom."},{"key":"725_CR2","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., Fulek, R., T\u00f3th, C.D.: Recognizing weak embeddings of graphs. ACM Trans. Algorithms (to appear) (2019). Prelimineary version available at arXiv:1709.09209","DOI":"10.1137\/1.9781611975031.20"},{"issue":"6","key":"725_CR3","doi-asserted-by":"publisher","first-page":"2484","DOI":"10.1007\/s00453-018-00541-w","volume":"81","author":"P Angelini","year":"2019","unstructured":"Angelini, P., Da Lozzo, G.: Clustered planarity with pipes. Algorithmica 81(6), 2484\u20132526 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"725_CR4","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/s00453-016-0128-9","volume":"77","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing for embedded planar graphs. Algorithmica 77(4), 1022\u20131059 (2017)","journal-title":"Algorithmica"},{"key":"725_CR5","doi-asserted-by":"crossref","unstructured":"Belyi, S.B.: Self-nonintersecting and non intersecting chains. Math. Notes Acad. Sci. USSR 34(4):802\u2013804 (1983). Translated from Matematicheskie Zametki, Vol. 34, No. 4, pp. 625\u2013628 (1983)","DOI":"10.1007\/BF01157400"},{"key":"725_CR6","doi-asserted-by":"crossref","unstructured":"Biedl, T.C.: Drawing planar partitions III: two constrained embedding problems. Rutcor Research Report 13-98 (1998)","DOI":"10.1145\/276884.276917"},{"key":"725_CR7","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.tcs.2015.10.011","volume":"609","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I.: A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609, 306\u2013315 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"725_CR8","unstructured":"Bremner, D.D.: Point visibility graphs and restricted-orientation polygon covering. Ph.D. thesis, Simon Fraser University (1993)"},{"key":"725_CR9","doi-asserted-by":"crossref","unstructured":"Chang, H.-C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1655\u20131670 (2015)","DOI":"10.1137\/1.9781611973730.110"},{"issue":"02","key":"725_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0129054119500011","volume":"30","author":"M Chimani","year":"2019","unstructured":"Chimani, M., Di Battista, G., Frati, F., Klein, K.: Advances on testing c-planarity of embedded flat clustered graphs. Int. J. Found. Comput. Sci. 30(02), 197\u2013230 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"725_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.7155\/jgaa.00165","volume":"12","author":"PF Cortese","year":"2008","unstructured":"Cortese, P.F., Battista, G.D., Frati, F., Patrignani, M., Pizzonia, M.: C-planarity of c-connected clustered graphs. J. Graph Algorithms Appl. 12(2), 225\u2013262 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"725_CR12","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2007.12.090","volume":"309","author":"PF Cortese","year":"2009","unstructured":"Cortese, P.F., Battista, G.D., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discrete Math. 309(7), 1856\u20131869 (2009)","journal-title":"Discrete Math."},{"issue":"6","key":"725_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G Di Battista","year":"1990","unstructured":"Di Battista, G., Liu, W.-P., Rival, I.: Bipartite graphs, upward drawings, and planarity. Inf. Process. Lett. 36(6), 317\u2013322 (1990)","journal-title":"Inf. Process. Lett."},{"key":"725_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2010)"},{"key":"725_CR15","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math. 11, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"725_CR16","first-page":"21","volume-title":"Computing and Combinatorics. Lecture Notes in Computer Science","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Ding-Zhu, D., Li, M. (eds.) Computing and Combinatorics. Lecture Notes in Computer Science, vol. 959, pp. 21\u201330. Springer, Berlin (1995)"},{"key":"725_CR17","first-page":"213","volume-title":"Algorithms\u2014ESA \u201995. Lecture Notes in Computer Science","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) Algorithms\u2014ESA \u201995. Lecture Notes in Computer Science, vol. 979, pp. 213\u2013226. Springer, Berlin (1995)"},{"key":"725_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2017.06.016","volume":"66","author":"R Fulek","year":"2017","unstructured":"Fulek, R.: C-planarity of embedded cyclic c-graphs. Comput. Geom. 66, 1\u201313 (2017)","journal-title":"Comput. Geom."},{"key":"725_CR19","unstructured":"Fulek, R., Kyn\u010dl, J.: Hanani\u2013Tutte for approximating maps of graphs. In: Proceedings of 34th Symposium on Computational Geometry (SoCG), Volume 99 of LIPIcs, pp. 39:1\u201339:15. Schloss Dagstuhl (2018)"},{"key":"725_CR20","first-page":"P4","volume":"22","author":"R Fulek","year":"2015","unstructured":"Fulek, R., Kyn\u010dl, J., Malinovic, I., P\u00e1lv\u00f6lgyi, D.: Clustered planarity testing revisited. Electron. J. Comb. 22, P4 (2015)","journal-title":"Electron. J. Comb."},{"key":"725_CR21","doi-asserted-by":"crossref","unstructured":"Fulek, R., T\u00f3th, C.D: Atomic embeddability, clustered planarity, and thickenability. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2876\u20132895. SIAM (2020)","DOI":"10.1137\/1.9781611975994.175"},{"key":"725_CR22","unstructured":"Goodrich, M.T., Lueker, G.S., Sun, J.Z.: C-planarity of extrovert clustered graphs. In: Healy, P., Nikolov, N.S. (eds.) Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland, 12\u201314 September 2005. Revised Papers, Berlin, Heidelberg, pp. 211\u2013222. Springer, Berlin Heidelberg (2006)"},{"key":"725_CR23","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) Graph Drawing: 10th International Symposium, GD 2002 Irvine, CA, USA, 26\u201328 August 2002 Revised Papers, Berlin, Heidelberg, pp. 220\u2013236. Springer, Berlin Heidelberg (2002)","DOI":"10.1007\/3-540-36151-0_21"},{"issue":"4","key":"725_CR24","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"725_CR25","doi-asserted-by":"crossref","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B.: Clustered planarity: embedded clustered graphs with two-component clusters. In: Tollis, I.G., Patrignani, M. (eds.) Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, 21\u201324 September 2008. Revised Papers, Berlin, Heidelberg, pp. 121\u2013132. Springer, Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-00219-9_13"},{"issue":"3","key":"725_CR26","doi-asserted-by":"publisher","first-page":"379","DOI":"10.7155\/jgaa.00192","volume":"13","author":"E Jel\u00ednkov\u00e1","year":"2009","unstructured":"Jel\u00ednkov\u00e1, E., K\u00e1ra, J., Kratochv\u00edl, J., Pergel, M., Such\u00fd, O., Vysko\u010dil, T.: Clustered planarity: small clusters in cycles and Eulerian graphs. J. Graph Algorithms Appl. 13(3), 379\u2013422 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"725_CR27","first-page":"305","volume":"22","author":"P Minc","year":"1997","unstructured":"Minc, P.: Embedding simplicial arcs into the plane. Topol. Proc. 22, 305\u2013340 (1997)","journal-title":"Topol. Proc."},{"key":"725_CR28","unstructured":"Rib\u00f3 Mor, A.: PhD thesis: realization and counting problems for planar structures: trees and linkages, polytopes and polyominoes. Freie U., Berlin (2006)"},{"issue":"3","key":"725_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.4064\/fm-65-3-325-343","volume":"65","author":"K Sieklucki","year":"1969","unstructured":"Sieklucki, K.: Realization of mappings. Fundam. Math. 65(3), 325\u2013343 (1969)","journal-title":"Fundam. Math."},{"issue":"1","key":"725_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-8641(03)00069-5","volume":"134","author":"M Skopenkov","year":"2003","unstructured":"Skopenkov, M.: On approximability by embeddings of cycles in the plane. Topol. Appl. 134(1), 1\u201322 (2003)","journal-title":"Topol. Appl."},{"issue":"3","key":"725_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02187729","volume":"4","author":"G Toussaint","year":"1989","unstructured":"Toussaint, G.: On separating two simple polygons by a single translation. Discrete Comput. Geom. 4(3), 265\u2013278 (1989)","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00725-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00725-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00725-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T23:57:52Z","timestamp":1623369472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00725-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["725"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00725-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"10 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}