{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:48:06Z","timestamp":1720640886014},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":[[2001,11]]},"DOI":"10.1016\/s1571-0653(04)00393-2","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"198-201","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs"],"prefix":"10.1016","volume":"10","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00393-2_BIB1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0653(04)00393-2_BIB2","first-page":"226","article-title":"A linear time algorithm for finding tree decompositions of small treewidth","author":"Bodlaender","year":"1993","journal-title":"Proceedings of the 25th Annual Association for Computing Machinery Symposium on the Theory of Computing"},{"key":"10.1016\/S1571-0653(04)00393-2_BIB3","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: Theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proceedings of the IEEE"},{"key":"10.1016\/S1571-0653(04)00393-2_BIB4","unstructured":"S. Hurley and R. Leese (editors), Models and Methods for Radio Channel Assignment, Oxford University Press to appear."},{"key":"10.1016\/S1571-0653(04)00393-2_BIB5","unstructured":"C. McDiarmid, Discrete mathematics and channel assignment, to appear."},{"key":"10.1016\/S1571-0653(04)00393-2_BIB6","series-title":"Tree Width and Tangles, a new measure of connectivity and some consequences, in Surveys in Combinatorics","author":"Reed","year":"1997"},{"key":"10.1016\/S1571-0653(04)00393-2_BIB7","first-page":"42","article-title":"Algorithmic Issues in the Geometry of Planar Linkage Movement","author":"Whitesides","year":"1992","journal-title":"The Australian Computer Journal, Special Issue on Algorithms"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003932?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003932?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:55:03Z","timestamp":1548597303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":7,"alternative-id":["S1571065304003932"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00393-2","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}