{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:37Z","timestamp":1755221017766,"version":"3.43.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1016795620388","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T13:14:30Z","timestamp":1041167670000},"page":"137-154","source":"Crossref","is-referenced-by-count":1,"title":["DAB Ensemble Planning \u2013 Problems and Techniques"],"prefix":"10.1007","volume":"18","author":[{"given":"Albert","family":"Gr\u00e4f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"353001_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz, New methods to color the vertices of a graph, Communications of the ACM 22(4) (1979) 251-256.","journal-title":"Communications of the ACM"},{"key":"353001_CR2","volume-title":"Algorithmic aspects of constrained unit disk graphs","author":"H. Breu","year":"1996","unstructured":"H. Breu, Algorithmic aspects of constrained unit disk graphs, Ph.D. thesis, Department of Computer Science, University of British Columbia (1996)."},{"key":"353001_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"R. Carraghan and P.M. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters 9 (1990) 375-382.","journal-title":"Operations Research Letters"},{"key":"353001_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990) 165-177.","journal-title":"Discrete Mathematics"},{"key":"353001_CR5","unstructured":"P. Crescenzi and V. Kann, A compendium of NP optimization problems (1999), http:\/\/www.nada.kth.se\/theory\/problemlist.html."},{"key":"353001_CR6","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 (Freeman, New York, 1979)."},{"key":"353001_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Computer Science and Applied Mathematics (Academic Press, New York, 1980)."},{"key":"353001_CR8","volume-title":"Coloring and recognizing special graph classes","author":"A. Gr\u00e4f","year":"1995","unstructured":"A. Gr\u00e4f, Coloring and recognizing special graph classes, Ph.D. thesis, Johannes Gutenberg-Universit\u00e4t Mainz, Germany (1995)."},{"volume-title":"Handbook of Combinatorics","year":"1995","key":"353001_CR9","unstructured":"R.L. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz (eds), Handbook of Combinatorics North-Holland, Amsterdam, 1995)."},{"key":"353001_CR10","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"W.K. Hale, Frequency assignment: Theory and applications, Proceedings of IEEE 68 (1980) 1497-1514.","journal-title":"Proceedings of IEEE"},{"key":"353001_CR11","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995)."},{"issue":"3","key":"353001_CR12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D.W. Matula","year":"1983","unstructured":"D.W. Matula and L.L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, Journal of the Association of Computing Machinery 30(3) (1983) 417-427.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"353001_CR13","volume-title":"Graphenorientierte Planung von Sendernetzen","author":"A. Quellmalz","year":"1993","unstructured":"A. Quellmalz, Graphenorientierte Planung von Sendernetzen, S\u00fcdwestfunk Schriftenreihe Rundfunktechnik 3 (Nomos Verlagsgesellschaft, Baden-Baden, 1993)."},{"key":"353001_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"F.S. Roberts","year":"1991","unstructured":"F.S. Roberts, T-colorings of graphs: Recent results and open problems, Discrete Mathematics 93 (1991) 229-245.","journal-title":"Discrete Mathematics"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016795620388.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016795620388\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016795620388.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:45:55Z","timestamp":1754635555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016795620388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["353001"],"URL":"https:\/\/doi.org\/10.1023\/a:1016795620388","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}