{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:02:37Z","timestamp":1726408957117},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_25","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T03:55:08Z","timestamp":1403668508000},"page":"282-293","source":"Crossref","is-referenced-by-count":0,"title":["Assigning Channels via the Meet-in-the-Middle Approach"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Kowalik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadiusz","family":"Soca\u0142a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput.\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"15","key":"25_CR2","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ipl.2011.05.008","volume":"111","author":"M. Cygan","year":"2011","unstructured":"Cygan, M., Kowalik, L.: Channel assignment via fast zeta transform. Inf. Process. Lett.\u00a0111(15), 727\u2013730 (2011)","journal-title":"Inf. Process. Lett."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 245\u2013256. Springer, Heidelberg (2004)"},{"issue":"12","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: Theory and applications. Proceedings of the IEEE\u00a068(12), 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM\u00a021(2), 277\u2013292 (1974)","journal-title":"J. ACM"},{"issue":"8","key":"25_CR6","first-page":"40","volume":"3","author":"T. Husfeldt","year":"2013","unstructured":"Husfeldt, T., Paturi, R., Sorkin, G.B., Williams, R.: Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports\u00a03(8), 40\u201372 (2013)","journal-title":"Dagstuhl Reports"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Junosza-Szaniawski, K., Rz\u0105\u017cewski, P.: An exact algorithm for the generalized list T-coloring problem. CoRR, abs\/1311.0603 (2013)","DOI":"10.46298\/dmtcs.2095"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.dam.2004.01.020","volume":"145","author":"D. Kr\u00e1l","year":"2005","unstructured":"Kr\u00e1l, D.: An exact algorithm for the channel assignment problem. Discrete Applied Mathematics\u00a0145(2), 326\u2013331 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0012-365X(02)00821-X","volume":"266","author":"C.J.H. McDiarmid","year":"2003","unstructured":"McDiarmid, C.J.H.: On the span in channel assignment problems: bounds, computing and counting. Discrete Mathematics\u00a0266(1-3), 387\u2013397 (2003)","journal-title":"Discrete Mathematics"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-79723-4_18","volume-title":"Parameterized and Exact Computation","author":"P. Traxler","year":"2008","unstructured":"Traxler, P.: The time complexity of constraint satisfaction. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 190\u2013201. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T06:31:51Z","timestamp":1649485911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}