{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:49:58Z","timestamp":1787496598559,"version":"build-2736575974"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Ka812\/18-1"],"award-info":[{"award-number":["Ka812\/18-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00453-018-0530-6","type":"journal-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:36:36Z","timestamp":1543451796000},"page":"2196-2221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical Partial Planarity"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"key":"530_CR1","series-title":"Volume 10520 of LNCS","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-68705-6_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Bekos, M.A.: Hierarchical partial planarity. In: Bodlaender, H.L., Woeginger, G.J. (eds.) Graph-Theoretic Concepts in Computer Science. Volume 10520 of LNCS, pp. 45\u201358. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-68705-6_4"},{"key":"530_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.comgeo.2015.07.002","volume":"50","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Binucci, C., Da Lozzo, G., Didimo, W., Grilli, L., Montecchiani, F., Patrignani, M., Tollis, I.G.: Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50, 34\u201348 (2015). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2015.07.002","journal-title":"Comput. Geom."},{"key":"530_CR3","series-title":"Volume 9801 of LNCS","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-50106-2_41","volume-title":"Graph Drawing","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Di Battista, G., Eades, P., Kindermann, P., Kratochv\u00edl, J., Lipp, F., Rutter, I.: Simultaneous orthogonal planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) Graph Drawing. Volume 9801 of LNCS, pp. 532\u2013545. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-50106-2_41"},{"key":"530_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71\u201389 (2015). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2014.11.016","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"530_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2629341","volume":"11","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32 (2015). \n                    https:\/\/doi.org\/10.1145\/2629341","journal-title":"ACM Trans. Algorithms"},{"key":"530_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jda.2011.12.015","volume":"14","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms 14, 150\u2013172 (2012). \n                    https:\/\/doi.org\/10.1016\/j.jda.2011.12.015","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"530_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.7155\/jgaa.00388","volume":"20","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous drawing of planar graphs with right-angle crossings and few bends. J. Graph Algorithms Appl. 20(1), 133\u2013158 (2016). \n                    https:\/\/doi.org\/10.7155\/jgaa.00388","journal-title":"J. Graph Algorithms Appl."},{"issue":"11","key":"530_CR8","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ipl.2012.02.011","volume":"112","author":"C Binucci","year":"2012","unstructured":"Binucci, C., Brandes, U., Di Battista, G., Didimo, W., Gaertler, M., Palladino, P., Patrignani, M., Symvonis, A., Zweig, K.A.: Drawing trees in a streaming model. Inf. Process. Lett. 112(11), 418\u2013422 (2012). \n                    https:\/\/doi.org\/10.1016\/j.ipl.2012.02.011","journal-title":"Inf. Process. Lett."},{"key":"530_CR9","first-page":"349","volume-title":"Handbook on Graph Drawing and Visualization","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC, Boca Raton (2013)"},{"issue":"6","key":"530_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.comgeo.2015.02.002","volume":"48","author":"T Bl\u00e4sius","year":"2015","unstructured":"Bl\u00e4sius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6), 459\u2013478 (2015). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2015.02.002","journal-title":"Comput. Geom."},{"key":"530_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/2738054","volume":"12(2):16:1\u201316","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2):16:1\u201316, 46 (2016). \n                    https:\/\/doi.org\/10.1145\/2738054","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"530_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117\u2013130 (2007). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2006.05.006","journal-title":"Comput. Geom."},{"issue":"2","key":"530_CR13","doi-asserted-by":"publisher","first-page":"681","DOI":"10.7155\/jgaa.00375","volume":"19","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Frati, F., Gutwenger, C., Lubiw, A., Mutzel, P., Schaefer, M.: Drawing partially embedded and simultaneously planar graphs. J. Graph Algorithms Appl. 19(2), 681\u2013706 (2015). \n                    https:\/\/doi.org\/10.7155\/jgaa.00375","journal-title":"J. Graph Algorithms Appl."},{"key":"530_CR14","series-title":"Volume 9079 of LNCS","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-18173-8_11","volume-title":"Algorithms and Complexity, CIAC","author":"G Lozzo Da","year":"2015","unstructured":"Da Lozzo, G., Rutter, I.: Planarity of streamed graphs. In: Paschos, V.T., Widmayer, P. (eds.) Algorithms and Complexity, CIAC. Volume 9079 of LNCS, pp. 153\u2013166. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18173-8_11"},{"issue":"4","key":"530_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996). \n                    https:\/\/doi.org\/10.1007\/BF01961541","journal-title":"Algorithmica"},{"issue":"5","key":"530_CR16","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996). \n                    https:\/\/doi.org\/10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"issue":"11","key":"530_CR17","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1093\/comjnl\/bxv048","volume":"58","author":"E Giacomo Di","year":"2015","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Planar and quasi-planar simultaneous geometric embedding. Comput. J. 58(11), 3126\u20133140 (2015). \n                    https:\/\/doi.org\/10.1093\/comjnl\/bxv048","journal-title":"Comput. J."},{"issue":"3","key":"530_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.7155\/jgaa.00113","volume":"9","author":"C Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Algorithms Appl. 9(3), 347\u2013364 (2005). \n                    https:\/\/doi.org\/10.7155\/jgaa.00113","journal-title":"J. Graph Algorithms Appl."},{"key":"530_CR19","series-title":"Volume 8242 of LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-03841-4_23","volume-title":"Graph Drawing","author":"MT Goodrich","year":"2013","unstructured":"Goodrich, M.T., Pszona, P.: Streamed graph drawing and the file maintenance problem. In: Wismath, S.K., Wolff, A. (eds.) Graph Drawing. Volume 8242 of LNCS, pp. 256\u2013267. Springer, Cham (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-319-03841-4_23"},{"key":"530_CR20","series-title":"Volume 1984 of LNCS","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2000","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) Graph Drawing. Volume 1984 of LNCS, pp. 77\u201390. Springer, Berlin (2000). \n                    https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"issue":"4","key":"530_CR21","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4), 466\u2013492 (2013). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2012.07.005","journal-title":"Comput. Geom."},{"issue":"3","key":"530_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1159892.1159895","volume":"2","author":"L Kowalik","year":"2006","unstructured":"Kowalik, L., Kurowski, M.: Oracles for bounded-length shortest paths in planar graphs. ACM Trans. Algorithms 2(3), 335\u2013363 (2006). \n                    https:\/\/doi.org\/10.1145\/1159892.1159895","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"530_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Combin. Theory Ser. B 52(1), 53\u201366 (1991). \n                    https:\/\/doi.org\/10.1016\/0095-8956(91)90090-7","journal-title":"J. Combin. Theory Ser. B"},{"key":"530_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-45803-7_2","volume-title":"Graph Drawing, volume 8871 of LNCS","author":"M Schaefer","year":"2014","unstructured":"Schaefer, M.: Picking planar edges; or, drawing a graph with a planar subgraph. In: Duncan, C.A., Symvonis, A. (eds.) Graph Drawing, volume 8871 of LNCS, pp. 13\u201324. Springer, Berlin (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-45803-7_2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0530-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0530-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0530-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T19:13:47Z","timestamp":1574968427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0530-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,29]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0530-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,29]]},"assertion":[{"value":"9 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}