{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:39Z","timestamp":1725663399185},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160786"},{"type":"electronic","value":"9783540397588"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16078-7_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:36:50Z","timestamp":1330177010000},"page":"153-170","source":"Crossref","is-referenced-by-count":6,"title":["Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Lengauer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"H.N. Gabow\/Z. Galil \/T. Spencer\/R.E. Tarjan: Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. Typescript 1985, to appear in COMBINATORIKA","DOI":"10.1007\/BF02579168"},{"key":"13_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey\/D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (CA), 1979"},{"key":"13_CR3","unstructured":"T. Lengauer\/K. Mehlhorn: The HILL-System: A design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts. Proc. Conference on Advanced Research in VLSI (ed. P. Penfield Jr.) M.I.T. (1984), 139\u2013149"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"D. Harel\/R.E. Tarjan: Fast algorithms for finding nearest common ancestors. In: SICOMP 13.2 (1984), 338\u2013355","DOI":"10.1137\/0213024"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"T. Lengauer: The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE-FOCS 1982, 358\u2013368","DOI":"10.1109\/SFCS.1982.92"},{"key":"13_CR6","volume-title":"Efficient solution of connectivity problems on hierarchically defined graphs. Reihe \"Theoretische Informatik\" No. 24, FB 17","author":"T. Lengauer","year":"1985","unstructured":"T. Lengauer: Efficient solution of connectivity problems on hierarchically defined graphs. Reihe \"Theoretische Informatik\" No. 24, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985"},{"key":"13_CR7","volume-title":"Hierarchical planarity testing algorithms. Reihe \"Theoretische Informatik\" No. 25, FB 17","author":"T. Lengauer","year":"1985","unstructured":"T. Lengauer: Hierarchical planarity testing algorithms. Reihe \"Theoretische Informatik\" No. 25, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985"},{"key":"13_CR8","volume-title":"Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Reihe \"Theoretische Informatik\" No. 26, FB 17","author":"T. Lengauer","year":"1985","unstructured":"T. Lengauer: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Reihe \"Theoretische Informatik\" No. 26, FB 17, Universit\u00e4t-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985"},{"key":"13_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan: Data structures and network algorithms. SIAM, Philadelphia (PA), 1983"}],"container-title":["Lecture Notes in Computer Science","STACS 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16078-7_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:51Z","timestamp":1605625791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16078-7_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540160786","9783540397588"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-16078-7_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}