{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:29:03Z","timestamp":1770902943154,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17156-6_22","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:37Z","timestamp":1770899797000},"page":"293-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Hardness Results for\u00a0the\u00a0Restricted Santa Claus Problem"],"prefix":"10.1007","author":[{"given":"S. Anil","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus Problem. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pages 31\u201340. Association for Computing Machinery, Inc, (2006). https:\/\/doi.org\/10.1145\/1132516.1132522","DOI":"10.1145\/1132516.1132522"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus Meets Hypergraph Matchings. ACM Trans. Al. (TALG) 8(3), 1\u20139 (2012). https:\/\/doi.org\/10.1145\/2229163.2229168","DOI":"10.1145\/2229163.2229168"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bamas, \u00c9., Lindermayr, A., Megow, N., Rohwedder, L., Schl\u00f6ter, J.: Santa Claus meets Makespan and Matroids: algorithms and Reductions. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2829\u20132860. SIAM, (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.100","DOI":"10.1137\/1.9781611977912.100"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Davies, S., Rothvoss, T., Zhang, Y.: A Tale of Santa Claus, Hypergraphs and Matroids. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2748\u20132757. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.167","DOI":"10.1137\/1.9781611975994.167"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Annamalai, C., Kalaitzis, C., Svensson, O.: Combinatorial Algorithm for Restricted Max-Min Fair Allocation. ACM Trans. Al. (TALG) 13(3), 1\u201328 (2017). https:\/\/doi.org\/10.1145\/3070694","DOI":"10.1145\/3070694"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1), 39\u201349 (2013). https:\/\/doi.org\/10.1016\/j.jcss.2012.04.004","DOI":"10.1016\/j.jcss.2012.04.004"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1), 533\u2013562 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0830-9","DOI":"10.1007\/s10107-014-0830-9"},{"key":"22_CR8","unstructured":"Chen, L., Marx, D., Ye, D., Zhang, G.: Parameterized and approximation results for scheduling with a low rank processing time matrix. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), pages 1\u201314. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00far Informatik, (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.22"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Kouteck\u1ef3, M., Zink, J.: Complexity of scheduling few types of jobs on related and unrelated machines. J. Schedul. 28(1), 1\u201318 (2025). https:\/\/doi.org\/10.1007\/s10951-024-00827-8","DOI":"10.1007\/s10951-024-00827-8"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K., Land, F., Land, K.: Bounding the running time of algorithms for scheduling and packing problems. SIAM J. Disc. Math. 30(1), 343\u2013366 (2016). https:\/\/doi.org\/10.1137\/140952636","DOI":"10.1137\/140952636"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-78455-7_19","volume-title":"Frontiers in Algorithmics","author":"S Annamalai","year":"2018","unstructured":"Annamalai, S., Narayanaswamy, N.S.: Exact algorithms for allocation problems. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 251\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_19"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Ganian, R., Ordyniak, S., Ramanujan, M.S.: Going Beyond Primal Treewidth for (M)ILP. In: Proceedings of the AAAI Conference on Artificial Intelligence 31(1) (2017). https:\/\/doi.org\/10.1609\/aaai.v31i1.10644","DOI":"10.1609\/aaai.v31i1.10644"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized algorithms, vol. 4. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44777-2_1","volume-title":"Algorithms - ESA 2014","author":"A Abboud","year":"2014","unstructured":"Abboud, A., Lewi, K., Williams, R.: Losing weight by gaining edges. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 1\u201312. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_1"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:43Z","timestamp":1770899803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}