{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:48:55Z","timestamp":1710251335230},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"12","funder":[{"name":"DFG","award":["Ka812\/17-1"],"award-info":[{"award-number":["Ka812\/17-1"]}]},{"name":"MIUR project AMANDA","award":["2012C4E3KT_001"],"award-info":[{"award-number":["2012C4E3KT_001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1093\/comjnl\/bxw035","type":"journal-article","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T00:38:27Z","timestamp":1470271107000},"page":"1831-1838","source":"Crossref","is-referenced-by-count":5,"title":["SEFE = C-Planarity?"],"prefix":"10.1093","volume":"59","author":[{"given":"P.","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,8,3]]},"reference":[{"key":"2016120903150694000_59.12.1831.1","unstructured":"Bl\u00e4sius, T. , Kobourov, S.G. and Rutter, I. (2013) Simultaneous Embedding of Planar Graphs. In Tamassia, R. (ed.), Handbook of Graph Drawing and Visualization. CRC Press."},{"key":"2016120903150694000_59.12.1831.2","doi-asserted-by":"crossref","unstructured":"Feng, Q. , Cohen, R.F. and Eades, P. (1995) Planarity for Clustered Graphs. In Spirakis, P.G. (ed.) Pro. Algorithms\u2014ESA \u201895, Third Annual European Symposium, Corfu, Greece, September 25\u201327, 1995, Lecture Notes in Computer Science, 979, pp. 213\u2013226. Springer.","DOI":"10.1007\/3-540-60313-1_145"},{"key":"2016120903150694000_59.12.1831.3","doi-asserted-by":"crossref","unstructured":"Gassner, E. , J\u00fcnger, M. , Percan, M. , Schaefer, M. and Schulz, M. (2006) Simultaneous Graph Embeddings with Fixed Edges. In Fomin, F.V. (ed.) Proc. Graph-Theoretic Concepts in Computer Science, 32nd Int. Workshop, WG 2006, Bergen, Norway, June 22\u201324, 2006, Lecture Notes in Computer Science, 4271, pp. 325\u2013335. Springer.","DOI":"10.1007\/11917496_29"},{"key":"2016120903150694000_59.12.1831.4","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00298"},{"key":"2016120903150694000_59.12.1831.5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.016"},{"key":"2016120903150694000_59.12.1831.6","doi-asserted-by":"crossref","unstructured":"Angelini, P. , Da Lozzo, G. , Di Battista, G. and Frati, F. (2016) Strip planarity testing for embedded planar graphs. Algorithmica, 1\u201338. doi: 10.1007\/s00453-016-0128-9 .","DOI":"10.1007\/s00453-016-0128-9"},{"key":"2016120903150694000_59.12.1831.7","doi-asserted-by":"publisher","DOI":"10.1109\/21.23105"},{"key":"2016120903150694000_59.12.1831.8","doi-asserted-by":"crossref","unstructured":"Hong, S.-H. and Nagamochi, H. (2014) Simpler Algorithms for Testing two-page Book Embedding of Partitioned Graphs. In Cai, Z. , Zelikovsky, A. and Bourgeois, A.G. (eds), Proc. Computing and Combinatorics\u201420th Int. Conf., COCOON 2014, Atlanta, GA, USA, August 4\u20136, 2014, Lecture Notes in Computer Science, 8591, pp. 477\u2013488. Springer.","DOI":"10.1007\/978-3-319-08783-2_41"},{"key":"2016120903150694000_59.12.1831.9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.015"},{"key":"2016120903150694000_59.12.1831.10","doi-asserted-by":"crossref","unstructured":"Angelini, P. , Di Bartolomeo, M. and Di Battista, G. (2012) Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In Didimo, W. and Patrignani, M. (eds), Proc. Graph Drawing\u201420th Int. Symposium, GD 2012, Redmond, WA, USA, September 19\u201321, 2012, Lecture Notes in Computer Science, 7704, pp. 79\u201389. Springer.","DOI":"10.1007\/978-3-642-36763-2_8"},{"key":"2016120903150694000_59.12.1831.11","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00289"},{"key":"2016120903150694000_59.12.1831.12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/2738054","article-title":"Simultaneous PQ-ordering with applications to constrained embedding problems","volume":"12","author":"Bl\u00e4sius","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"2016120903150694000_59.12.1831.13","unstructured":"Hoske, D. (2012) Book Embedding with Fixed Page Assignments. Bachelor thesis, Karlsruhe Institute of Technology, Karlsruhe, Germany."},{"key":"2016120903150694000_59.12.1831.14","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T. , Lueker, G.S. and Sun, J.Z. (2005) C-Planarity of Extrovert Clustered Graphs. In Healy, P. and Nikolov, N.S. (eds), Proc. Graph Drawing, 13th Int. Symposium, GD 2005, Limerick, Ireland, September 12\u201314, 2005, Lecture Notes in Computer Science, 3843, pp. 211\u2013222. Springer.","DOI":"10.1007\/11618058_20"},{"key":"2016120903150694000_59.12.1831.15","unstructured":"Jelnek, V. , Jelnkov\u00e1, E. , Kratochvl, J. and Lidick\u00fd, B. (2008) Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. In Tollis, I.G. and Patrignani, M. (eds), Proc. Graph Drawing, 16th Int. Symposium, GD 2008, Heraklion, Crete, Greece, September 21\u201324, 2008, Lecture Notes in Computer Science, 5417, pp. 121\u2013132. Springer."},{"key":"2016120903150694000_59.12.1831.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.011"},{"key":"2016120903150694000_59.12.1831.17","doi-asserted-by":"crossref","unstructured":"Feng, Q. , Cohen, R.F. and Eades, P. (1995) How to Draw a Planar Clustered Graph. In Du, D. and Li, M. (eds), Proc. Computing and Combinatorics, 1st Annual Int. Conf., COCOON \u201895 , Xi'an, China, August 24\u201326, 1995, Lecture Notes in Computer Science, 959, pp. 21\u201330. Springer.","DOI":"10.1007\/BFb0030816"},{"key":"2016120903150694000_59.12.1831.18","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E. (1998) A Linear Time Algorithm to Recognize Clustered Graphs and its Parallelization. In Lucchesi, C.L. and Moura, A.V. (eds), Proc. LATIN \u201898: Theoretical Informatics, 3rd Latin American Symposium, Campinas, Brazil, April, 20\u201324, 1998, Lecture Notes in Computer Science, 1380, pp. 239\u2013248. Springer.","DOI":"10.1007\/BFb0054325"},{"key":"2016120903150694000_59.12.1831.19","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00165"},{"key":"2016120903150694000_59.12.1831.20","doi-asserted-by":"crossref","unstructured":"Biedl, T.C. , Kaufmann, M. and Mutzel, P. (1998) Drawing Planar Partitions II: HH-drawings. In Hromkovic, J. and S\u00fdkora, O. (eds), Proc. Graph-Theoretic Concepts in Computer Science, 24th Int. Workshop, WG \u201898, Smolenice Castle, Slovak Republic, June 18\u201320, 1998, Lecture Notes in Computer Science, 1517, pp. 124\u2013136. Springer.","DOI":"10.1007\/10692760_11"},{"key":"2016120903150694000_59.12.1831.21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.090"},{"key":"2016120903150694000_59.12.1831.22","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00191"},{"key":"2016120903150694000_59.12.1831.23","unstructured":"Chimani, M. , Di Battista, G. , Frati, F. and Klein, K. (2014) Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. In Duncan, C.A. and Symvonis, A. (eds), Proc. Graph Drawing\u201422nd Int. Symposium, GD 2014, W\u00fcrzburg, Germany, September 24\u201326, 2014, Lecture Notes in Computer Science, 8871, pp. 416\u2013427. Springer."},{"key":"2016120903150694000_59.12.1831.24","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00192"},{"key":"2016120903150694000_59.12.1831.25","first-page":"1","article-title":"Toward the Hanani\u2013Tutte theorem for clustered graphs","volume":"1","author":"Fulek","year":"2014","journal-title":"ArXiv e-prints"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/12\/1831\/8344779\/bxw035.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T22:13:38Z","timestamp":1656972818000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,3]]},"references-count":25,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2016,12,9]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1093\/comjnl\/bxw035"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw035","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,3]]}}}