{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:30Z","timestamp":1760440710286},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_7","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"37-49","source":"Crossref","is-referenced-by-count":8,"title":["Characterization of Unlabeled Level Planar Graphs"],"prefix":"10.1007","author":[{"given":"J. Joseph","family":"Fowler","sequence":"first","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-73545-8_26","volume-title":"COCOON 2007","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Erten, C., Fowler, J.J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S.G., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings. In: COCOON 2007. LNCS, vol.\u00a04598, pp. 254\u2013263. Springer, Heidelberg (2007)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous graph embedding. Computational Geometry: Theory and Applications\u00a036(2), 117\u2013130 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"6","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/21.23105","volume":"18","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., Nardelli, E.: Hierarchies and planarity theory. IEEE Transactions on Systems, Man, and Cybernetics\u00a018(6), 1035\u20131046 (1988)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P. Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica\u00a044(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-70904-6_35","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2007","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 367\u2013369. Springer, Heidelberg (2007)"},{"key":"7_CR6","unstructured":"Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled planar graphs. Technical Report TR06-04, University of Arizona (2006), \n                    \n                      ftp:\/\/ftp.cs.arizona.edu\/reports\/2006\/TR06-04.pdf"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11618058_19","volume-title":"Graph Drawing","author":"M. Geyer","year":"2006","unstructured":"Geyer, M., Kaufmann, M., Vrto, I.: Two trees which are self-intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 201\u2013210. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"7_CR8","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.\u00a0280(1-3), 51\u201363 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.7155\/jgaa.00045","volume":"6","author":"M. J\u00fcnger","year":"2002","unstructured":"J\u00fcnger, M., Leipert, S.: Level planar embedding in linear time. J. Graph Algorithms Appl.\u00a06(1), 67\u2013113 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR10","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":"1999","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 224\u2013237. Springer, Heidelberg (1999)"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur les probl\u00e8mes des courbes gauches en Topologie. Fundamenta Mathematicae\u00a015, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:58Z","timestamp":1619522158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_7","relation":{},"subject":[]}}