{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:15Z","timestamp":1759638375874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_37","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"482-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Beyond Level Planarity"],"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"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"37_CR1","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Beyond level planarity. CoRR abs\/1510.08274v3 (2015). \n                      http:\/\/arxiv.org\/abs\/1510.08274v3"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.019","volume":"571","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Roselli, V.: The importance of being proper: (in clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571, 1\u20139 (2015). \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2014.12.019","journal-title":"Theor. Comput. Sci."},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-25878-7_39","volume-title":"Graph Drawing","author":"C Auer","year":"2012","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A.: Classification of planar upward embedding. In: Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 415\u2013426. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-25878-7_39"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F., Forster, M.: Radial level planarity testing and embedding in linear time. J. Graph Algorithms Appl. 9(1), 53\u201397 (2005). \n                      http:\/\/jgaa.info\/accepted\/2005\/BachmaierBrandenburgForster2005.9.1.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-87744-8_12","volume-title":"Algorithms - ESA 2008","author":"C Bachmaier","year":"2008","unstructured":"Bachmaier, C., Brunner, W.: Linear time planarity testing and embedding of strongly connected cyclic level graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 136\u2013147. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-87744-8_12"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-77537-9_8","volume-title":"Graph Drawing","author":"C Bachmaier","year":"2008","unstructured":"Bachmaier, C., Brunner, W., K\u00f6nig, C.: Cyclic level planarity testing and embedding. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 50\u201361. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-77537-9_8"},{"key":"37_CR7","series-title":"Discrete Mathematics and Its Applications","first-page":"349","volume-title":"Handbook of Graph Drawing and Visualization","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embeddings of planar graphs (Chap. 11). In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications, pp. 349\u2013382. Chapman and Hall\/CRC, Boca Raton (2013)"},{"issue":"2","key":"37_CR8","doi-asserted-by":"crossref","first-page":"16","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 (2016). \n                      http:\/\/doi.acm.org\/10.1145\/2738054","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"37_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). \n                      http:\/\/dx.doi.org\/10.1016\/S0022-0000(76)80045\u20131","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"37_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.comgeo.2013.08.003","volume":"47","author":"F Brandenburg","year":"2014","unstructured":"Brandenburg, F.: Upward planar drawings on the standing and the rolling cylinders. Comput. Geom. 47(1), 25\u201341 (2014). \n                      http:\/\/dx.doi.org\/10.1016\/j.comgeo.2013.08.003","journal-title":"Comput. Geom."},{"issue":"2","key":"37_CR11","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                      http:\/\/dx.doi.org\/10.1016\/j.comgeo.2006.05.006","journal-title":"Comput. Geom."},{"issue":"6","key":"37_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/21.23105","volume":"18","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Nardelli, E.: Hierarchies and planarity theory. IEEE Trans. Syst. Man Cybern. 18(6), 1035\u20131046 (1988). \n                      http:\/\/dx.doi.org\/10.1109\/21.23105","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-11805-0_9","volume-title":"Graph Drawing","author":"A Estrella-Balderrama","year":"2010","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: On the characterization of level planar trees by minimal patterns. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 69\u201380. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-11805-0_9"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24618-3_18","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"M Forster","year":"2004","unstructured":"Forster, M., Bachmaier, C.: Clustered level planarity. In: Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 218\u2013228. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-24618-3_18"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-0110-0_14","volume-title":"Thirty Essays on Geometric Graph Theory","author":"R Fulek","year":"2013","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani-Tutte, monotone drawings, and level-planarity. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 263\u2013287. Springer, New York (2013). \n                      http:\/\/dx.doi.org\/10.1007\/978-1-4614-0110-0_14"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00289","volume":"17","author":"B Haeupler","year":"2013","unstructured":"Haeupler, B., Raju Jampani, K., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms Appl. 17(3), 147\u2013171 (2013). \n                      http:\/\/dx.doi.org\/10.7155\/jgaa.00289","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"37_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disc.2003.02.001","volume":"280","author":"P Healy","year":"2004","unstructured":"Healy, P., Kuusik, A., Leipert, S.: A characterization of level planar graphs. Discrete Math. 280(1\u20133), 51\u201363 (2004). \n                      http:\/\/dx.doi.org\/10.1016\/j.disc.2003.02.001","journal-title":"Discrete Math."},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0021813","volume-title":"Graph Drawing","author":"LS Heath","year":"1996","unstructured":"Heath, L.S., Pemmaraju, S.V.: Recognizing leveled-planar dags in linear time. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 300\u2013311. Springer, Heidelberg (1996). doi:\n                      10.1007\/BFb0021813"},{"key":"37_CR19","volume-title":"Handbook of Data Structures and Applications","author":"W Hsu","year":"2004","unstructured":"Hsu, W., McConnell, R.M.: PQ trees, PC trees, and planar graphs. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications. Chapman and Hall\/CRC, Boca Raton (2004). \n                      http:\/\/dx.doi.org\/10.1201\/9781420035179"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 224\u2013237. Springer, Heidelberg (1998). doi:\n                      10.1007\/3-540-37623-2_17"},{"issue":"1","key":"37_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Comput. 8(1), 111\u2013114 (1979)","journal-title":"SIAM J. Comput."},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S1571-0653(04)00327-0","volume":"9","author":"B Randerath","year":"2001","unstructured":"Randerath, B., Speckenmeyer, E., Boros, E., Hammer, P.L., Kogan, A., Makino, K., Simeone, B., Cepek, O.: A satisfiability formulation of problems on level graphs. Electron. Notes Discrete Math. 9, 269\u2013277 (2001). \n                      http:\/\/dx.doi.org\/10.1016\/S1571-0653(04)00327\u20130","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"37_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). \n                      http:\/\/dx.doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"16\u201317","key":"37_CR24","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2012.05.028","volume":"160","author":"A Wotzlaw","year":"2012","unstructured":"Wotzlaw, A., Speckenmeyer, E., Porschen, S.: Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Appl. Math. 160(16\u201317), 2349\u20132363 (2012). \n                      http:\/\/dx.doi.org\/10.1016\/j.dam.2012.05.028","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:43:23Z","timestamp":1600476203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}