{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:09:05Z","timestamp":1725628145570},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540168133"},{"type":"electronic","value":"9783642713880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/978-3-642-71388-0_36","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:37:56Z","timestamp":1320230276000},"page":"456-469","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchische Darstellung Geometrischer Objekte und Ihre Algorithmische Bedeutung"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Lengauer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","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"},{"key":"36_CR2","volume-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N.\/Galil, Z.\/Spencer, T.\/Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Typescript (1985). To appear in COMBINATORICA"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Galperin, H.\/Wigderson, A.: Succinct representations of graphs. In: Information & Control 56 (1983) 183\u2013198","DOI":"10.1016\/S0019-9958(83)80004-7"},{"key":"36_CR4","first-page":"139","volume-title":"Proceedings of the MIT-Conference on Advanced Research in VLSI","author":"T Lengauer","year":"1984","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":"36_CR5","doi-asserted-by":"crossref","unstructured":"Kedem, G.: The Quad-CIF Tree: A data structure for hierarchical on-line algorithms. Proceedings of 19th Design Automation Conference (1982) 352\u2013357","DOI":"10.1145\/800263.809229"},{"key":"36_CR6","volume-title":"Hierarchical graph algorithms","author":"T Lengauer","year":"1984","unstructured":"Lengauer, T.: Hierarchical graph algorithms. TR-SFB 124, No. 15, FB 10, Universit\u00e4t des Saarlandes, Saarbr\u00fccken (1984)"},{"key":"36_CR7","volume-title":"Theoretische Informatik","author":"T Lengauer","year":"1985","unstructured":"Lengauer, T.: Efficient solution of connectivity problems on hierarchically defined graphs. \u201cTheoretische Informatik\u201d No. 24, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn (1985)"},{"key":"36_CR8","first-page":"201","volume-title":"Proceedings of the WG\u201985","author":"T Lengauer","year":"1985","unstructured":"Lengauer, T.: Efficient solution of biconnectivity problems on hierarchically defined graphs. Proceedings of the WG\u201985 (H. Noltemeier, ed. ), Trauner Verlag (1985) 201\u2013216"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Lengauer, T.: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Proceedings of STACS 86 (B. Monien, G. Vidal-Naquet, eds.), Springer Lecture Notes in Computer Science No. 216 (1986) 153\u2013170","DOI":"10.1007\/3-540-16078-7_73"},{"key":"36_CR10","volume-title":"Proceedings of ICALP 86","author":"T Lengauer","year":"1986","unstructured":"Lengauer, T.: Hierarchical planarity testing algorithms. Proceedings of ICALP 86, Springer Lecture Notes in Computer Science (1986)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Lengauer, T.: Exploiting hierarchy in VLSI design. Proceedings of the Aegean Workshop on Computing (AWOC)\u201986","DOI":"10.1007\/3-540-16766-8_16"},{"key":"36_CR12","volume-title":"Introduction of VLSI systems","author":"C Mead","year":"1980","unstructured":"Mead, C.\/Conway, L.: Introduction of VLSI systems. Addison-Wesley (1980)"},{"key":"36_CR13","volume-title":"Diplomarbeit","author":"E Wanke","year":"1986","unstructured":"Wanke, E.: Resultate und Implementierungen hierarchischer Graphenalgorithmen. Diplomarbeit, FB 17, Universit\u00e4t-Gesamthochschule Paderborn (1986)"}],"container-title":["Informatik-Fachberichte","Informatik-Anwendungen \u2014 Trends und Perspektiven"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-71388-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T23:13:00Z","timestamp":1606259580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-71388-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540168133","9783642713880"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-71388-0_36","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1986]]}}}