{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:24:04Z","timestamp":1766377444590,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":61,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811565328"},{"type":"electronic","value":"9789811565335"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-15-6533-5_12","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"211-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Beyond Clustered Planar Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., Fulek, R., T\u00f3th, C.D.: Recognizing weak embeddings of graphs. ACM Trans. Algorithms, 15(4):50:1\u201350:27 (2019)","DOI":"10.1145\/3344549"},{"issue":"12","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1093\/comjnl\/bxw035","volume":"59","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Da Lozzo, G.: SEFE = C-Planarity? Comput. J. 59(12), 1831\u20131838 (2016)","journal-title":"Comput. J."},{"issue":"6","key":"12_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":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.comgeo.2014.08.001","volume":"48","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Relaxing the constraints of clustered planarity. Comput. Geom. 48(2), 42\u201375 (2015)","journal-title":"Comput. Geom."},{"key":"12_CR5","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)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","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:1\u201332:42 (2015)","DOI":"10.1145\/2629341"},{"issue":"4","key":"12_CR7","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. J. Graph Algorithms Appl. 21(4), 731\u2013755 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"12_CR8","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":"12_CR9","doi-asserted-by":"crossref","unstructured":"Angelini, P., Eades, P., Hong, S.-H., Klein, K., Kobourov, S.G., Liotta, G., Navarra, A., Tappini, A.: Turning cliques into paths to achieve planarity. In: Biedl, T.C., Kerren, A. (eds.) 26th International Symposium on Graph Drawing and Network Visualization, vol. 11282 of LNCS, pp. 67\u201374. Springer (2018)","DOI":"10.1007\/978-3-030-04414-5_5"},{"issue":"11","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/TVCG.2010.265","volume":"17","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Brandenburg, F.-J., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using (x, y)-clustering and hybrid visualizations. IEEE Trans. Vis. Comput. Graph. 17(11), 1587\u20131598 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"12_CR11","unstructured":"Besa, J.J., Da Lozzo, G., Goodrich, M.T.: Computing k-modal embeddings of planar digraphs. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, vol. 144 of LIPIcs, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"12_CR12","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."},{"issue":"2","key":"12_CR13","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)","journal-title":"Comput. Geom."},{"key":"12_CR14","unstructured":"Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. PhD thesis, The University of British Columbia, Canada (1996)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2000\u20132011. SIAM (2017)","DOI":"10.1137\/1.9781611974782.130"},{"issue":"8","key":"12_CR16","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1007\/s00453-017-0322-4","volume":"80","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. Algorithmica 80(8), 2286\u20132323 (2018)","journal-title":"Algorithmica"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Chimani, M., Klein, K.: Shrinking the search space for clustered planarity. In: Didimo, W., Patrignani, M. (eds.) 20th International Symposium on Graph Drawing, vol. 7704 of LNCS, pp. 90\u2013101. Springer (2012)","DOI":"10.1007\/978-3-642-36763-2_9"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Chimani, M., Gutwenger, C., Jansen, M., Klein, K., Mutzel, P.: Computing maximum c-planar subgraphs. In: Tollis, I.G., Patrignani, M. (ed.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 114\u2013120. Springer (2008)","DOI":"10.1007\/978-3-642-00219-9_12"},{"issue":"2","key":"12_CR19","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(2), 197\u2013230 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jda.2005.06.002","volume":"4","author":"S Cornelsen","year":"2006","unstructured":"Cornelsen, S., Wagner, D.: Completely connected clustered graphs. J. Discrete Algorithms 4(2), 313\u2013323 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Cortese, P.F., Patrignani, M.: Clustered planarity = flat clustered planarity. In: Biedl, T.C., Kerren, A. (eds.) 26th International Symposium on Graph Drawing and Network Visualization, vol. 11282 of LNCS, pp. 23\u201338. Springer (2018)","DOI":"10.1007\/978-3-030-04414-5_2"},{"issue":"2","key":"12_CR22","first-page":"225","volume":"12","author":"PF Cortese","year":"2008","unstructured":"Cortese, P.F., Di Battista, G., Frati, F., Patrignani, M., Pizzonia, M.: C-planarity of c-connected clustered graphs. J. Graph Alg. Appl. 12(2), 225\u2013262 (2008)","journal-title":"J. Graph Alg. Appl."},{"issue":"7","key":"12_CR23","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., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discrete Math. 309(7), 1856\u20131869 (2009)","journal-title":"Discrete Math."},{"issue":"2","key":"12_CR24","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. J. Graph Algorithms Appl. 22(2), 139\u2013176 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: Subexponential-time and FPT algorithms for embedded flat clustered planarity. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) 44th International Workshop on Graph-Theoretic Concepts in Computer Science, vol. 11159 of LNCS, pp. 111\u2013124. Springer (2018)","DOI":"10.1007\/978-3-030-00256-5_10"},{"key":"12_CR26","unstructured":"Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: C-planarity testing of embedded clustered graphs with bounded dual carving-width. In: Jansen, B.M.P., Telle, J.A. (eds.) 14th International Symposium on Parameterized and Exact Computation, vol. 148 of LIPIcs, pp. 9:1\u20139:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E.: A linear time algorithm to recognize clustered graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) Third Latin American Symposium on Theoretical Informatics, vol. 1380 of LNCS, pp. 239\u2013248. Springer (1998)","DOI":"10.1007\/BFb0054325"},{"issue":"3","key":"12_CR28","first-page":"349","volume":"13","author":"G Di Battista","year":"2009","unstructured":"Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. J. Graph Alg. Appl. 13(3), 349\u2013378 (2009)","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"12_CR29","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)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) First Annual International Conference on Computing and Combinatorics, vol. 959 of LNCS, pp. 21\u201330. Springer (1995)","DOI":"10.1007\/BFb0030816"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) Third Annual European Symposium on Algorithms, vol. 979 of LNCS, pp. 213\u2013226. Springer (1995)","DOI":"10.1007\/3-540-60313-1_145"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) Algorithms - ESA \u201995, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, vol. 979 of LNCS, pp. 213\u2013226. Springer (1995)","DOI":"10.1007\/3-540-60313-1_145"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Fulek, R.: Bounded embeddings of graphs in the plane. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) 27th International Workshop on Combinatorial Algorithms, vol. 9843 of LNCS, pp. 31\u201342. Springer (2016)","DOI":"10.1007\/978-3-319-44543-4_3"},{"key":"12_CR34","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":"12_CR35","unstructured":"Fulek, R.: Embedding graphs into embedded graphs. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation, vol.\u00a092 of LIPIcs, pp. 34:1\u201334:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"12_CR36","unstructured":"Fulek, R., Kyncl, J.: Hanani-Tutte for approximating maps of graphs. In: Speckmann, B., T\u00f3th, C.D. (eds.) 34th International Symposium on Computational Geometry, vol.\u00a099 of LIPIcs, pp. 39:1\u201339:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Fulek, R., T\u00f3th, C.D.: Atomic embeddability, clustered planarity, and thickenability. In: Chawla, S. (ed.) 2020 ACM-SIAM Symposium on Discrete Algorithms, pp. 2876\u20132895. SIAM (2020)","DOI":"10.1137\/1.9781611975994.175"},{"key":"12_CR38","unstructured":"Fulek, R., Kyncl, J., Malinovic, I., P\u00e1lv\u00f6lgyi, D.: Efficient c-planarity testing algebraically. CoRR, abs\/1305.4519 (2013)"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The Rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"12_CR40","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Giacomo, E.D., Liotta, G., Patrignani, M., Rutter, I., Tappini, A.: NodeTrix planarity testing with small clusters. Algorithmica 81(9), 3464\u20133493 (2019)","DOI":"10.1007\/s00453-019-00585-6"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Lueker, G.S., Sun, J.Z.: C-planarity of extrovert clustered graphs. In: Healy, P., Nikolov, N.S. (eds.) 13th International Symposium on Graph Drawing, vol. 3843 of LNCS, pp. 211\u2013222. Springer (2005)","DOI":"10.1007\/11618058_20"},{"key":"12_CR43","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: Kobourov, S.G., Goodrich, M.T. (eds.) 10th International Symposium on Graph Drawing, vol. 2528 of LNCS, pp. 220\u2013235. Springer (2002)","DOI":"10.1007\/3-540-36151-0_21"},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"73","DOI":"10.7155\/jgaa.00160","volume":"12","author":"C Gutwenger","year":"2008","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. J. Graph Algorithms Appl. 12(1), 73\u201395 (2008)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P., Schaefer, M.: Practical experience with hanani-tutte for testing c-planarity. In: McGeoch, C.C., Meyer, U. (eds.) Sixteenth Workshop on Algorithm Engineering and Experiments, pp. 86\u201397. SIAM (2014)","DOI":"10.1137\/1.9781611973198.9"},{"issue":"6","key":"12_CR46","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry, N., Fekete, J.-D., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302\u20131309 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"6","key":"12_CR47","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/TVCG.2008.141","volume":"14","author":"N Henry","year":"2008","unstructured":"Henry, N., Bezerianos, A., Fekete, J.-D.: Improving the readability of clustered social networks using node duplication. IEEE Trans. Vis. Comput. Graph. 14(6), 1317\u20131324 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"12_CR48","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2015.12.039","volume":"725","author":"S-H Hong","year":"2018","unstructured":"Hong, S.-H., Nagamochi, H.: Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725, 79\u201398 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR49","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.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 121\u2013132. Springer (2008)","DOI":"10.1007\/978-3-642-00219-9_13"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Jel\u00ednek, V., Such\u00fd, O., Tesar, M., Vyskocil, T.: Clustered planarity: clusters with few outgoing edges. In: Tollis, I.G., Patrignani, M. (eds.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 102\u2013113. Springer (2008)","DOI":"10.1007\/978-3-642-00219-9_11"},{"issue":"4","key":"12_CR51","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)","journal-title":"Comput. Geom."},{"issue":"3","key":"12_CR52","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., Vyskocil, T.: Clustered planarity: Small clusters in cycles and Eulerian graphs. J. Graph Algorithms Appls 13(3), 379\u2013422 (2009)","journal-title":"J. Graph Algorithms Appls"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Kammer, F.: Simultaneous embedding with two bends per edge in polynomial area. In: Arge, L., Freivalds, R. (eds.) 10th Scandinavian Workshop on Algorithm Theory, vol. 4059 of LNCS, pp. 255\u2013267. Springer (2006)","DOI":"10.1007\/11785293_25"},{"key":"12_CR54","unstructured":"Kindermann, P., Klemz, B., Rutter, I., Schnider, P., Schulz, A.: The partition spanning forest problem. CoRR, abs\/1809.02710 (2018)"},{"issue":"3","key":"12_CR55","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1145\/65950.65952","volume":"36","author":"T Lengauer","year":"1989","unstructured":"Lengauer, T.: Hierarchical planarity testing algorithms. J. ACM 36(3), 474\u2013509 (1989)","journal-title":"J. ACM"},{"key":"12_CR56","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Graph planarity testing with hierarchical embedding constraints. CoRR, abs\/1904.12596 (2019)"},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Simultaneous FPQ-ordering and hybrid planarity testing. In: Chatzigeorgiou, A., Dondi, R., Herodotou, H., Kapoutsis, C.A., Manolopoulos, Y., Papadopoulos, G.A., Sikora, F. (eds.) 46th International Conference on Current Trends in Theory and Practice of Informatics, vol. 12011 of LNCS, pp. 617\u2013626. Springer (2020)","DOI":"10.1007\/978-3-030-38919-2_51"},{"issue":"1","key":"12_CR58","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-015-0018-6","volume":"76","author":"T Mchedlidze","year":"2016","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Extending convex partial drawings of graphs. Algorithmica 76(1), 47\u201367 (2016)","journal-title":"Algorithmica"},{"key":"12_CR59","doi-asserted-by":"crossref","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Battista, G.D. (ed.) 5th International Symposium on Graph Drawing, vol. 1353 of LNCS, pp. 248\u2013261. Springer (1997)","DOI":"10.1007\/3-540-63938-1_67"},{"issue":"4","key":"12_CR60","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367\u2013440 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR61","unstructured":"Unger, W.: On the k-colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) 5th Annual Symposium on Theoretical Aspects of Computer Science, vol. 294 of LNCS, pp. 61\u201372. Springer (1988)"}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T10:31:35Z","timestamp":1669026695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_12","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}