{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:29Z","timestamp":1725914669618},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_4","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"45-58","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical Partial Planarity"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"4_CR1","unstructured":"Angelini, P., Bekos, M.A.: Hierarchical partial planarity. CoRR, 1707.06844, (2017). \nhttp:\/\/arxiv.org\/abs\/1707.06844"},{"key":"4_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). doi:\n10.1016\/j.comgeo.2015.07.002","journal-title":"Comput. Geom."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-50106-2_41","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., et al.: Simultaneous orthogonal planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 532\u2013545. Springer, Cham (2016). doi:\n10.1007\/978-3-319-50106-2_41"},{"key":"4_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). doi:\n10.1016\/j.tcs.2014.11.016","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"4_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). doi:\n10.1145\/2629341","journal-title":"ACM Trans. Algorithms"},{"key":"4_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). doi:\n10.1016\/j.jda.2011.12.015.","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"4_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). doi:\n10.7155\/jgaa.00388","journal-title":"J. Graph Algorithms Appl."},{"issue":"11","key":"4_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). doi:\n10.1016\/j.ipl.2012.02.011","journal-title":"Inf. Process. Lett."},{"key":"4_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, London (2013)"},{"issue":"6","key":"4_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). doi:\n10.1016\/j.comgeo.2015.02.002","journal-title":"Comput. Geom."},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/2738054.","volume":"12","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). doi:\n10.1145\/2738054.","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"4_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). doi:\n10.1016\/j.comgeo.2006.05.006","journal-title":"Comput. Geom."},{"issue":"2","key":"4_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). doi:\n10.7155\/jgaa.00375","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-18173-8_11","volume-title":"Algorithms and Complexity","author":"G Lozzo Da","year":"2015","unstructured":"Da Lozzo, G., Rutter, I.: Planarity of streamed graphs. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 153\u2013166. Springer, Cham (2015). doi:\n10.1007\/978-3-319-18173-8_11"},{"issue":"4","key":"4_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). doi:\n10.1007\/BF01961541","journal-title":"Algorithmica"},{"issue":"5","key":"4_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). doi:\n10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"issue":"11","key":"4_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). doi:\n10.1093\/comjnl\/bxv048","journal-title":"Comput. J."},{"issue":"3","key":"4_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). doi:\n10.7155\/jgaa.00113","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","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., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 256\u2013267. Springer, Cham (2013). doi:\n10.1007\/978-3-319-03841-4_23"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77\u201390. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44541-2_8"},{"issue":"4","key":"4_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). doi:\n10.1016\/j.comgeo.2012.07.005","journal-title":"Comput. Geom."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90090-7","volume-title":"Drawing Graphs, Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models. LNCS, vol. 2025. Springer, Heidelberg (2001). doi:\n10.1016\/0095-8956(91)90090-7"},{"issue":"1","key":"4_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. Comb. Theory, Ser. B 52(1), 53\u201366 (1991). doi:\n10.1016\/0095-8956(91)90090-7","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-45803-7_2","volume-title":"Graph Drawing","author":"M Schaefer","year":"2014","unstructured":"Schaefer, M.: Picking planar edges; or, drawing a graph with a planar subgraph. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 13\u201324. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-45803-7_2"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1201\/9781420035315.ch52","volume-title":"Handbook of Discrete and Computational Geometry","author":"R Tamassia","year":"2004","unstructured":"Tamassia, R., Liotta, G.: Graph drawing. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn, pp. 1163\u20131185. Chapman and Hall\/CRC, London (2004). doi:\n10.1201\/9781420035315.ch52","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:07:07Z","timestamp":1509516427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}