{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:23Z","timestamp":1725456743643},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029652","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"530-537","source":"Crossref","is-referenced-by-count":2,"title":["The k-section of treewidth restricted graphs"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Wiegers","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. In T. Lepist\u00f6 and A. Salomaa, editors, Proceedings of ICALP'88, pages 38\u201351. Springer Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_105"},{"issue":"2","key":"61_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T.N. Bui","year":"1987","unstructured":"T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171\u2013191, 1987.","journal-title":"Combinatorica"},{"key":"61_CR3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"M.W. Bern, E.L. Lawler, and A.L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms, 8:216\u2013235, 1987.","journal-title":"Journal of Algorithms"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender. Dynamic programming on graphs with bounded treewidth. In Lecture Notes in Computer Science, pages 38\u201351. ICALP 88, Springer Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_110"},{"key":"61_CR5","unstructured":"B. Courcelle. The monadic second-order theory of graphs I: Recognizable sets of finite graphs. Research report, submitted for publication, Universit\u00e9 Bordeaux, 1986\u201388."},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Proceedings of the 19th Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"61_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979."},{"key":"61_CR8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E.T. Gurari","year":"1984","unstructured":"E.T. Gurari and I.H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. Journal of Algorithms, 5:531\u2013546, 1984.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"61_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.K. Kernighan","year":"1970","unstructured":"B.K. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 49(2):291\u2013307, 1970.","journal-title":"Bell Systems Technical Journal"},{"key":"61_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B. Monien","year":"1988","unstructured":"B. Monien and I.H. Sudborough. Min-cut is NP-Complete for edge weighted trees. Theoretical Computer Science, 58:209\u2013229, 1988.","journal-title":"Theoretical Computer Science"},{"key":"61_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour. Graph minors. II. algorithmic aspects of treewidth. Journal of Algorithms, 7:309\u2013322, 1986.","journal-title":"Journal of Algorithms"},{"key":"61_CR12","unstructured":"P.R. Suaris and G. Kedem. Quadrisection: A new apporach to standard cell layout. In Digest of Technical Papers, pages 474\u2013477. Int. Conf. on Computer-Aided Design, Nov. 1987."},{"issue":"4","key":"61_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(89)90140-3","volume":"33","author":"E. Wanke","year":"1989","unstructured":"E. Wanke and M. Wiegers. Undeciability of the bandwidth problem on certain linear graph languages. Information Processing Letters, 33(4):193\u2013197, 1989.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:13Z","timestamp":1586578513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029652","relation":{},"subject":[]}}