{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:51:55Z","timestamp":1770324715450,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s1571-0653(05)80034-4","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T11:22:13Z","timestamp":1114860133000},"page":"102-105","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Solving Frequency Assignment Problems via Tree-Decomposition1"],"prefix":"10.1016","volume":"3","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":"78","reference":[{"key":"10.1016\/S1571-0653(05)80034-4_BIB1","series-title":"A branch-and-cut algorithm for the frequency assignment problem. Research Memorandum 96\/011","author":"Aardal","year":"1996"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddins in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"1-2","key":"10.1016\/S1571-0653(05)80034-4_BIB3","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernetica"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02125459","article-title":"A tabu search algorithm for frequency assignment","volume":"10","author":"Castelino","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB5","doi-asserted-by":"crossref","unstructured":"W.K. Hale. Frequency assignment: Theory and applications. Proceedings of the IEEE, 68:1497-1514, 1980.","DOI":"10.1109\/PROC.1980.11899"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB6","series-title":"Upper and lower bounding techniques for frequency assignment problems. Technical Report COSOR 95-34","author":"Hurkens","year":"1995"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB7","unstructured":"A. Kolen., A genetic algorithm for frequency assignment. Technical report, Maastricht University, 1999. Available athttp:\/\/www.unimaas.nl\/~aTkolen\/."},{"issue":"3-5","key":"10.1016\/S1571-0653(05)80034-4_BIB8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(98)00043-1","article-title":"The partial constraint satisfaction problem: Facets and lifting theorems","volume":"23","author":"Koster","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0653(05)80034-4_BIB10","unstructured":"S. Tiourine, C. Hurkens, and J.K. Lenstra. An overview of algorithmic approaches to frequency assignment problems. In Calma Symposium on Combinatorial Algorithms for Military Applications, pages 53-62, 1995. Available at http:\/\/www.win.tue.nl\/math\/bs\/combopt\/hurkens\/calma.html."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:05:56Z","timestamp":1550387156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":10,"alternative-id":["S1571065305800344"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80034-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}