{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:40:03Z","timestamp":1761597603536},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T00:00:00Z","timestamp":1431475200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00453-015-0004-z","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T12:57:20Z","timestamp":1431435440000},"page":"1435-1452","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assigning Channels Via the Meet-in-the-Middle Approach"],"prefix":"10.1007","volume":"74","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","published-online":{"date-parts":[[2015,5,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Counting paths and packings in halves. In: Fiat, A., Sanders, P. (eds.) Algorithms - ESA 2009. Lecture Notes in Computer Science, vol. 5757, pp. 578\u2013586. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04128-0_52","DOI":"10.1007\/978-3-642-04128-0_52"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","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\u2013exclusion. SIAM J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Kaski, P., Kowalik, \u0141.: Counting thin subgraphs via packings faster than meet-in-the-middle time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201914, pp. 594\u2013603. SIAM (2014)","DOI":"10.1137\/1.9781611973402.45"},{"issue":"6","key":"4_CR4","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., M\u00f6lle, D., Richter, S., Rossmanith, P., Sze, S.H., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"issue":"15","key":"4_CR5","doi-asserted-by":"crossref","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. 111(15), 727\u2013730 (2011)","journal-title":"Inf. Process. Lett."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Proceedings of the WG\u201904. Lecture Notes in Computer Science, vol. 3353, pp. 245\u2013256 (2004)","DOI":"10.1007\/978-3-540-30559-0_21"},{"issue":"12","key":"4_CR7","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980). doi: 10.1109\/PROC.1980.11899","journal-title":"Proc. IEEE"},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","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 21(2), 277\u2013292 (1974)","journal-title":"J. ACM"},{"issue":"8","key":"4_CR9","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 Rep. 3(8), 40\u201372 (2013)","journal-title":"Dagstuhl Rep."},{"issue":"2","key":"4_CR10","doi-asserted-by":"crossref","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. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2012.06.037","volume":"505","author":"K Junosza-Szaniawski","year":"2013","unstructured":"Junosza-Szaniawski, K., Kratochv\u00edl, J., Liedloff, M., Rossmanith, P., Rz\u0105\u017cewski, P.: Fast exact algorithm for labeling of graphs. Theor. Comput. Sci. 505, 42\u201354 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR12","first-page":"77","volume":"16","author":"K Junosza-Szaniawski","year":"2014","unstructured":"Junosza-Szaniawski, K., Rz\u0105\u017cewski, P.: An exact algorithm for the generalized list t-coloring problem. Discrete Math. Theor. Comput. Sci. 16(3), 77\u201394 (2014)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"4_CR13","doi-asserted-by":"crossref","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 Appl. Math. 145(2), 326\u2013331 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"4_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0012-365X(02)00821-X","volume":"266","author":"CJH McDiarmid","year":"2003","unstructured":"McDiarmid, C.J.H.: On the span in channel assignment problems: bounds, computing and counting. Discrete Math. 266(1\u20133), 387\u2013397 (2003)","journal-title":"Discrete Math."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Soca\u0142a, A.: Tight lower bound for the channel assignment problem. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201915), pp. 662\u2013675. SIAM (2015)","DOI":"10.1137\/1.9781611973730.45"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Traxler, P.: The time complexity of constraint satisfaction. In: Grohe, M., Niedermeier, R. (eds.) IWPEC. Lecture Notes in Computer Science, vol. 5018, pp. 190\u2013201. Springer (2008)","DOI":"10.1007\/978-3-540-79723-4_18"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0004-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0004-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0004-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T00:20:40Z","timestamp":1566692440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0004-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,13]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0004-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,13]]}}}