{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:22Z","timestamp":1759638442463},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_18","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:31:03Z","timestamp":1283671863000},"page":"218-228","source":"Crossref","is-referenced-by-count":11,"title":["Clustered Level Planarity"],"prefix":"10.1007","author":[{"given":"Michael","family":"Forster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Bachmaier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. 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. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-44969-8_8","volume-title":"Drawing Graphs","author":"R. Brockenauer","year":"2001","unstructured":"Brockenauer, R., Cornelsen, S.: Drawing Clusters and Hierarchies. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, ch. 8, pp. 193\u2013227. Springer, Heidelberg (2001)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0021798","volume-title":"Graph Drawing","author":"M. Chandramouli","year":"1996","unstructured":"Chandramouli, M., Diwan, A.A.: Upward Numbering Testing for Triconnected Graphs. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 140\u2013151. Springer, Heidelberg (1996)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. Journal of Computer and System Sciences\u00a030, 54\u201376 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0054325","volume-title":"LATIN\u201998: Theoretical Informatics","author":"E. Dahlhaus","year":"1998","unstructured":"Dahlhaus, E.: A Linear Time Algorithm to Recognize Clustered Planar Graphs and Its Parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 239\u2013248. Springer, Heidelberg (1998)"},{"issue":"6","key":"18_CR6","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"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for Clustered Graphs (Extended abstract). In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-36151-0_26","volume-title":"Graph Drawing","author":"M. Forster","year":"2002","unstructured":"Forster, M.: Applying Crossing Reduction Strategies to Layered Compound Graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 276\u2013284. Springer, Heidelberg (2002)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-36151-0_21","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2002","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-Planarity Testing of Clustered Graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 220\u2013235. Springer, Heidelberg (2002)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-46648-7_21","volume-title":"Graph Drawing","author":"P. Healy","year":"1999","unstructured":"Healy, P., Kuusik, A.: The Vertex-Exchange Graph: A New Concept for Multi- Level Crossing Minimisation. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 205\u2013216. Springer, Heidelberg (1999)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0021813","volume-title":"Graph Drawing","author":"L.S. 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.\u00a01027, pp. 300\u2013311. Springer, Heidelberg (1996)"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and Queue Layouts of Directed Acyclic Graphs: Part II. SIAM Journal on Computing\u00a028(5), 1588\u20131626 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-46648-7_7","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1999","unstructured":"J\u00fcnger, M., Leipert, S.: Level Planar Embedding in Linear Time. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 72\u201381. Springer, Heidelberg (1999)"},{"issue":"1","key":"18_CR14","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":"18_CR15","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":"18_CR16","unstructured":"Leipert, S.: Level Planarity Testing and Embedding in Linear Time. Dissertation, Mathematisch-Naturwissenschaftliche Fakult\u00e4t der Universit\u00e4t zu K\u00f6ln (1998)"},{"key":"18_CR17","unstructured":"Sander, G.: Layout of Compound Directed Graphs. Technical Report A\/03\/96, Universit\u00e4t Saarbr\u00fccken (1996)"},{"key":"18_CR18","unstructured":"Sander, G.: Visualisierungstechniken f\u00fcr den Compilerbau. PhD thesis, Universit\u00e4t Saarbr\u00fccken (1996)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(98)00270-9","volume":"217","author":"G. Sander","year":"1999","unstructured":"Sander, G.: Graph Layout for Applications in Compiler Construction. Theoretical Computer Science\u00a0217, 175\u2013214 (1999)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T20:45:07Z","timestamp":1553028307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}