{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:59Z","timestamp":1725663059740},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:51:59Z","timestamp":1330195919000},"page":"215-225","source":"Crossref","is-referenced-by-count":7,"title":["Hierarchical planarity testing algorithms"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Lengauer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"23_CR1","first-page":"335","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. JCSS, Vol. 13 (1976), 335\u2013379","journal-title":"JCSS"},{"key":"23_CR2","first-page":"127","volume":"1","author":"J.L. Bentley","year":"1983","unstructured":"Bentley, J.L.\/Ottmann, T.\/Widmayer, P.: The complexity of manipulating hierarchically defined sets of rectangles. In: Advances in Computing Research (F.P. Preparata, ed.) (JAI Press Inc.) 1 (1983), 127\u2013158","journal-title":"JAI Press Inc."},{"issue":"1","key":"23_CR3","first-page":"54","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N.\/Nishuzeki, T.: A linear algorithm for embedding planar graphs using PQ-trees. JCSS 30,1 (1985), 54\u201376","journal-title":"JCSS"},{"key":"23_CR4","unstructured":"Lengauer, T.\/Mehlhorn, K.: The HILL-System: A design environment for the hierarchical specification, compaction and simulation of integrated circuit layouts. Proceedings of the MIT-Conference on Advanced Research in VLSI (P. Penfield Jr. ed.), Artech House Company (1984), 139\u2013149"},{"key":"23_CR5","unstructured":"Huang, M.A.\/Steiglitz, K.: A hierarchical compaction algorithm with low page-fault complexity. Proc. Conference on Advanced Research in VLSI (P. Penfield Jr. ed.), Artech House Inc. (1984), 203\u2013212"},{"issue":"3","key":"23_CR6","first-page":"145","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J.\/Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2,3 (1973), 145\u2013169","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J.\/Tarjan, R.E.: Efficient planarity testing. JACM 21,4 (1974), 549\u2013568","journal-title":"JACM"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Lengauer, T.: The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE-FOCS (1982), 358\u2013368","DOI":"10.1109\/SFCS.1982.92"},{"key":"23_CR9","unstructured":"Lengauer, T.: Efficient solution of connectivity problems on hierarchically defined graphs. \"Theoretische Informatik\" No. 24, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn, West-Germany (1985) (short version in: Proc. of WG '85 (H. Noltemeier, ed.), Trauner Verlag (1985), 201\u2013216)"},{"key":"23_CR10","volume-title":"Hierarchical planarity testing algorithms. \"Theoretische Informatik\" No. 25, FB 17","author":"T. Lengauer","year":"1985","unstructured":"Lengauer, T.: Hierarchical planarity testing algorithms. \"Theoretische Informatik\" No. 25, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn, West-Germany (1985)"},{"key":"23_CR11","first-page":"153","volume":"210","author":"T. Lengauer","year":"1986","unstructured":"Lengauer, T.: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Proc. STACS 86 (B. Monien, G. Vidal-Naquet, eds.), Springer LNCS 210 (1986), 153\u2013170","journal-title":"Springer LNCS"},{"issue":"2","key":"23_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1,2 (1972), 146\u2013160","journal-title":"SIAM J. Comput."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. AMS 34 (1932), 339\u2013362","journal-title":"Trans. AMS"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/2371127","volume":"55","author":"H. Whitney","year":"1933","unstructured":"Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55 (1933), 245\u2013254","journal-title":"Am. J. Math."},{"key":"23_CR15","first-page":"544","volume":"176","author":"K. Wagner","year":"1984","unstructured":"Wagner, K.: The complexity of problems concerning graphs with regularities. Proc. MFCS, Springer LNCS 176 (1984), 544\u2013552","journal-title":"Proc. MFCS, Springer LNCS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:54Z","timestamp":1605643854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}