{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:04:08Z","timestamp":1742403848128,"version":"3.32.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1007\/bf01928924","type":"journal-article","created":{"date-parts":[[2005,7,24]],"date-time":"2005-07-24T18:04:47Z","timestamp":1122228287000},"page":"213-230","source":"Crossref","is-referenced-by-count":1,"title":["Linear arrangement problems on recursively partitioned graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"T.","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"R.","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01928924_CR1","first-page":"171","volume":"7\/2","author":"TN Bui","year":"1987","unstructured":"Bui TN, Chauduri S, Leighton FT, Sipser M (1987) Graph bisection algorithms with good average case behaviour. Combinatorica 7\/2:171\u2013191","journal-title":"Combinatorica"},{"key":"BF01928924_CR2","doi-asserted-by":"crossref","unstructured":"Fellows MR, Langston MA (1988) Layout permutation problems and well-partially-ordered sets. Proc. 5th MIT Conference on Advanced Research in VLSI","DOI":"10.7551\/mitpress\/1102.003.0025"},{"key":"BF01928924_CR3","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman"},{"key":"BF01928924_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Sys Tech Journal 49:291\u2013307","journal-title":"Bell Sys Tech Journal"},{"key":"BF01928924_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou CH (1976) The NP-completeness of the bandwidth minimization problem. Computing 16:263\u2013270","journal-title":"Computing"},{"key":"BF01928924_CR6","first-page":"313","volume":"00","author":"JB Saxe","year":"1980","unstructured":"Saxe JB (1980) Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM Journal on Algebraic and Discrete Methods 00:313\u2013369","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"BF01928924_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","volume":"8","author":"Y Shiloach","year":"1979","unstructured":"Shiloach Y (1979) A minimum linear arrangement algorithm for undirected trees. SIAM Journal on Computing 8:15\u201332","journal-title":"SIAM Journal on Computing"},{"key":"BF01928924_CR8","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M Yannakakis","year":"1985","unstructured":"Yannakakis M (1985) A polynomial time algorithm for the mincut linear arrangement of trees. Journal ACM 32:950\u2013959","journal-title":"Journal ACM"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01928924.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01928924\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01928924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T17:13:07Z","timestamp":1735837987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01928924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":8,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01928924"],"URL":"https:\/\/doi.org\/10.1007\/bf01928924","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"type":"print","value":"0340-9422"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}