{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:59Z","timestamp":1759638659401,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_12","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"136-147","source":"Crossref","is-referenced-by-count":5,"title":["Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bachmaier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Brunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C. Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications\u00a09(1), 53\u201397 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"12_CR2","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 (extended abstract). In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 50\u201361. Springer, Heidelberg (2008)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"J. Boyer","year":"2004","unstructured":"Boyer, J., Myrvold, W.: On the cutting edge: Simplified $\\mathcal{O}(n)$ planarity by edge addition. Journal of Graph Algorithms and Applications\u00a08(3), 241\u2013273 (2004)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"6","key":"12_CR4","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 Transactions on Systems, Man, and Cybernetics\u00a018(6), 1035\u20131046 (1988)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-77537-9_10","volume-title":"Graph Drawing","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., Kobourov, S.G.: Minimum level nonplanar patterns for trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 69\u201375. Springer, Heidelberg (2008)"},{"issue":"2\u20133","key":"12_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2004.02.033","volume":"320","author":"P. Healy","year":"2004","unstructured":"Healy, P., Kuusik, A.: Algorithms for multi-level graph planarity testing and layout. Theoretical Computer Science\u00a0320(2\u20133), 331\u2013344 (2004)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","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 Mathematics\u00a0280, 51\u201363 (2004)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM"},{"issue":"1","key":"12_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. Journal of Graph Algorithms and Applications\u00a06(1), 67\u2013113 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs","author":"M. Kaufmann","year":"2001","unstructured":"Kaufmann, M., Wagner, D.: Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae\u00a015, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"12_CR12","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: International Symposium, Rome, pp. 215\u2013232 (1967)"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/43.45870","volume":"9","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., R\u00fclling, W.: Compaction on the torus. IEEE Transactions on Computer-Aided Design\u00a09(4), 389\u2013397 (1990)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"12_CR14","volume-title":"Biochemical Pathways: An Atlas of Biochemistry and Molecular Biology","author":"G. Michal","year":"1999","unstructured":"Michal, G.: Biochemical Pathways: An Atlas of Biochemistry and Molecular Biology. Wiley, Chichester (1999)"},{"issue":"2","key":"12_CR15","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 Transactions on Systems, Man, and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:15:33Z","timestamp":1715058933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}