{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:08:20Z","timestamp":1761894500409},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_32","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"338-350","source":"Crossref","is-referenced-by-count":13,"title":["Optimal Solutions for Frequency Assignment Problems via Tree Decomposition"],"prefix":"10.1007","author":[{"given":"Arie M. C. A.","family":"Koster","sequence":"first","affiliation":[]},{"given":"Stan P.M.","family":"van Hoesel","sequence":"additional","affiliation":[]},{"given":"Antoon W.J.","family":"Kolen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddins in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8:277\u2013284, 1987. 341","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"1-2","key":"32_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11(1-2):1\u201321, 1993. 339","journal-title":"Acta Cybernetica"},{"issue":"6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender. \u201cA linear time algorithm for finding tree-decompositions of small treewidth\u201d. SIAM Journal on Computing, 25(6):1305\u20131317, 1996. 341","journal-title":"SIAM Journal on Computing"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02125459","volume":"63","author":"D.J. Castelino","year":"1996","unstructured":"D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301\u2013319, 1996. 339","journal-title":"Annals of Operations Research"},{"key":"32_CR5","unstructured":"A. Kolen. A genetic algorithm for frequency assignment. Technical report, Maastricht University, 1999. Available at \n                  http:\/\/www.unimaas.nl\/~akolen\/\n                  \n                . 339, 347"},{"issue":"3-5","key":"32_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0167-6377(98)00043-1","volume":"23","author":"A.M.C.A. Koster","year":"1998","unstructured":"A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 23(3-5):89\u201397, 1998. 339, 341","journal-title":"Operations Research Letters"},{"key":"32_CR7","unstructured":"A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen. Solving frequency assignment problems via tree-decomposition. Technical Report RM 99\/011, Maastricht University, 1999. Available at \n                  http:\/\/www.unimaas.nl\/~akoster\/\n                  \n                . 340, 341, 343, 346"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P.D. Seymour. Graph minors. II. algorithmic aspects of treewidth. Journal of Algorithms, 7:309\u2013322, 1986. 339, 341","journal-title":"Journal of Algorithms"},{"key":"32_CR9","unstructured":"S. Tiourine, C. Hurkens, and J.K. Lenstra. \u201cAn overview of algorithmic approaches to frequency assignment problems\u201d. In Calma Symposium on Combinatorial Algorithms for Military Applications, pages 53\u201362, 1995. Available at \n                  http:\/\/www.win.tue.nl\/math\/bs\/combopt\/hurkens\/calma.html\n                  \n                . 339"},{"key":"32_CR10","unstructured":"S. R. Tiourine, C.A.J. Hurkens, and J.K. Lenstra. Local search algorithms for the radio link frequency assignment problem. Telecommunication systems, to appear, 1999. 339, 339"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T02:49:58Z","timestamp":1550285398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}