{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:10:33Z","timestamp":1777889433110,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220114","type":"print"},{"value":"9783540248415","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24841-5_6","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:28:22Z","timestamp":1281299302000},"page":"78-90","source":"Crossref","is-referenced-by-count":13,"title":["On the Tree Width of Ada Programs"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Burgstaller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Blieberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth.\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for treedecomposable graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"6_CR3","series-title":"Series in Computer Science","volume-title":"Compilers, Principles, Techniques and Tools","author":"A.V. Aho","year":"1988","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques and Tools. Series in Computer Science. Addison-Wesley, Reading (1988)"},{"key":"6_CR4","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BFb0013504","volume-title":"Reliable Software Technologies - Ada Europe 96","author":"W. Gellerich","year":"1996","unstructured":"Gellerich, W., Kosiol, M., Ploedereder, E.: Where does GOTO go to? In: Strohmeier, A. (ed.) Ada-Europe 1996. LNCS, vol.\u00a01088, pp. 385\u2013395. Springer, Heidelberg (1996)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45643-0_7","volume-title":"Algorithm Engineering and Experiments","author":"J. Gustedt","year":"2002","unstructured":"Gustedt, J., M\u00e6hle, O.A., Telle, J.A.: The treewidth of Java programs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 42\u201351. Springer, Heidelberg (2002)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.1998.0956","volume":"29","author":"S. Kannan","year":"1998","unstructured":"Kannan, S., Proebsting, T.A.: Register allocation in structured programs. Journal of Algorithms\u00a029, 223\u2013237 (1998)","journal-title":"Journal of Algorithms"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00571421","volume":"1","author":"P. Puschner","year":"1989","unstructured":"Puschner, P., Koza, C.: Calculating the maximum execution time of real-time programs. The Journal of Real-Time Systems\u00a01, 159\u2013176 (1989)","journal-title":"The Journal of Real-Time Systems"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Series B\u00a035, 39\u201361 (1983)","journal-title":"J. Comb. Theory Series B"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M. Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree width and good register allocation. Information and Computation\u00a0142(2), 159\u2013181 (1998)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Reliable Software Technologies - Ada-Europe 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24841-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:13:41Z","timestamp":1620011621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24841-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220114","9783540248415"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24841-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}