{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:38:40Z","timestamp":1773859120545,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["306465"],"award-info":[{"award-number":["306465"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["CE-ITI P202\/12\/G061"],"award-info":[{"award-number":["CE-ITI P202\/12\/G061"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007543","name":"Grantov\u00e1 Agentura, Univerzita Karlova","doi-asserted-by":"publisher","award":["1784214"],"award-info":[{"award-number":["1784214"]}],"id":[{"id":"10.13039\/100007543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["MN 59\/4-1"],"award-info":[{"award-number":["MN 59\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007397","name":"Univerzita Karlova v Praze","doi-asserted-by":"publisher","award":["UNCE\/SCI\/004"],"award-info":[{"award-number":["UNCE\/SCI\/004"]}],"id":[{"id":"10.13039\/100007397","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10107-019-01402-2","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T05:34:49Z","timestamp":1574228089000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Combinatorial n-fold integer programming and applications"],"prefix":"10.1007","volume":"184","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-5709","authenticated-orcid":false,"given":"Du\u0161an","family":"Knop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4721-5354","authenticated-orcid":false,"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,20]]},"reference":[{"key":"1402_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Ficler, J., Roditty, L., Shalom, O.S.: On the efficiency of the Hamming C-centerstring problems. In: Proceedings of CPM 2014, Lecture Notes in Computer Science, vol. 8486, pp. 1\u201310 (2014)","DOI":"10.1007\/978-3-319-07566-2_1"},{"issue":"39","key":"1402_CR2","doi-asserted-by":"crossref","first-page":"5239","DOI":"10.1016\/j.tcs.2011.05.034","volume":"412","author":"A Amir","year":"2011","unstructured":"Amir, A., Landau, G.M., Na, J.C., Park, H., Park, K., Sim, J.S.: Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39), 5239\u20135246 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1402_CR3","unstructured":"Avila, L.F., Garc\u0131a, A., Serna, M.J., Thilikos, D.M.: A list of parameterized problems in bioinformatics. Tech. Rep. LSI-06-24-R, Technical University of Catalonia (2006)"},{"issue":"(S\u20131)","key":"1402_CR4","doi-asserted-by":"crossref","first-page":"S55","DOI":"10.1186\/1471-2105-12-S1-S55","volume":"12","author":"C Boucher","year":"2011","unstructured":"Boucher, C., Ma, B.: Closest string with outliers. BMC Bioinform. 12((S\u20131)), S55 (2011)","journal-title":"BMC Bioinform."},{"key":"1402_CR5","doi-asserted-by":"crossref","unstructured":"Boucher, C., Wilkie, K.: Why large closest string instances are easy to solve in practice. In: Proceedings of SPIRE 2010, Lecture Notes in Computer Science, vol. 6393, pp. 106\u2013117 (2010)","DOI":"10.1007\/978-3-642-16321-0_10"},{"issue":"4","key":"1402_CR6","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TST.2014.6867518","volume":"19","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Guo, J., Niedermeier, R., Woeginger, G.J.: Parameterized algorithmics for computational social choice: nine research challenges. Tsinghua Sci. Tech. 19(4), 358\u2013373 (2014)","journal-title":"Tsinghua Sci. Tech."},{"key":"1402_CR7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1613\/jair.4285","volume":"50","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Such\u00fd, O., Woeginger, G.J.: A multivariate complexity analysis of lobbying in multiple referenda. J. Artif. Intell. Res. 50, 409\u2013446 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"1402_CR8","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Skowron, P., Talmon, N.: Elections with few candidates: Prices, weights, and covering problems. In: Proceedings of ADT 2015, Lecture Notes in Computer Science, vol. 9346, pp. 414\u2013431 (2015)","DOI":"10.1007\/978-3-319-23114-3_25"},{"key":"1402_CR9","unstructured":"Bulteau, L., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R.: Multivariate algorithmics for NP-hard string problems. Bull. EATCS 114, (2014)"},{"key":"1402_CR10","doi-asserted-by":"crossref","unstructured":"Chrobak, M., D\u00fcrr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. In: Proceedings of AAIM 2008, Lecture Notes in Computer Science, vol. 5034, pp. 120\u2013130 (2008)","DOI":"10.1007\/978-3-540-68880-8_13"},{"issue":"1","key":"1402_CR11","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/14098524X","volume":"26","author":"S Chubanov","year":"2016","unstructured":"Chubanov, S.: A polynomial-time descent method for separable convex optimization problems with linear constraints. SIAM J. Opt. 26(1), 856\u2013889 (2016)","journal-title":"SIAM J. Opt."},{"key":"1402_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"1402_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, New York (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"1402_CR14","first-page":"580","volume":"2011","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M-ellipsoid coverings. Proc. FOCS 2011, 580\u2013589 (2011)","journal-title":"Proc. FOCS"},{"key":"1402_CR15","doi-asserted-by":"crossref","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and geometric ideas in the theory of discrete optimization. MOS-SIAM series on optimization. SIAM, 14 (2013)","DOI":"10.1137\/1.9781611972443"},{"issue":"1","key":"1402_CR16","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64(1), 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"1402_CR17","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.M.: Faster algorithms for integer programs with block structure. In: Proceedings of ICALP 2018, Leibniz International Proceedings in Informatics, vol. 107, pp. 49:1\u201349:13 (2018)"},{"issue":"5","key":"1402_CR18","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett. 34(5), 564\u2013568 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1402_CR19","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. In: Proceedings of SODA 2018, pp. 808\u2013816 (2018)","DOI":"10.1137\/1.9781611975031.52"},{"key":"1402_CR20","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Proceedings of SAGT 2009, Lecture Notes in Computer Science, vol. 5814, pp. 299\u2013310 (2009)","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"1402_CR21","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of bribery in elections. In: Proceedings of AAAI 2006, pp. 641\u2013646 (2006)"},{"issue":"4","key":"1402_CR22","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s00224-011-9367-y","volume":"50","author":"MR Fellows","year":"2012","unstructured":"Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the number of numbers. Theory Comput. Syst. 50(4), 675\u2013693 (2012)","journal-title":"Theory Comput. Syst."},{"key":"1402_CR23","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Proceedings of ISAAC 2008, Lecture Notes in Computer Science, vol. 5369, pp. 294\u2013305. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-92182-0_28"},{"key":"1402_CR24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.dam.2017.02.010","volume":"248","author":"J Fiala","year":"2018","unstructured":"Fiala, J., Gaven\u010diak, T., Knop, D., Kouteck\u00fd, M., Kratochv\u00edl, J.: Parameterized complexity of distance labeling and uniform channel assignment problems. Discrete Appl. Math. 248, 46\u201355 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"23","key":"1402_CR25","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513\u20132523 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1402_CR26","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"PC Fishburn","year":"1977","unstructured":"Fishburn, P.C.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"1402_CR27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst. 30(2), 113\u2013119 (1997)","journal-title":"Theory Comput. Syst."},{"key":"1402_CR28","doi-asserted-by":"crossref","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Proceedings of IPEC 2013, Lecture Notes in Computer Science, vol. 8246, pp. 163\u2013176 (2013)","DOI":"10.1007\/978-3-319-03898-8_15"},{"key":"1402_CR29","unstructured":"Ganian, R.: Using neighborhood diversity to solve hard problems. Tech. rep. (2012). https:\/\/arxiv.org\/abs\/1201.3091"},{"key":"1402_CR30","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.artint.2017.12.006","volume":"257","author":"R Ganian","year":"2018","unstructured":"Ganian, R., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257, 61\u201371 (2018)","journal-title":"Artif. Intell."},{"key":"1402_CR31","first-page":"815","volume":"2017","author":"R Ganian","year":"2017","unstructured":"Ganian, R., Ordyniak, S., Ramanujan, M.S.: Going beyond primal treewidth for (M)ILP. Proc. AAAI 2017, 815\u2013821 (2017)","journal-title":"Proc. AAAI"},{"key":"1402_CR32","first-page":"830","volume":"2014","author":"MX Goemans","year":"2014","unstructured":"Goemans, M.X., Rothvo\u00df, T.: Polynomiality for bin packing with a constant number of item types. Proc. SODA 2014, 830\u2013839 (2014)","journal-title":"Proc. SODA"},{"issue":"1","key":"1402_CR33","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"1402_CR34","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol.\u00a02, 2nd edn. Springer-Verlag, Berlin (1993)","DOI":"10.1007\/978-3-642-78240-4"},{"issue":"1\u20132, Ser. A","key":"1402_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0638-z","volume":"145","author":"R Hemmecke","year":"2014","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Program. 145(1\u20132, Ser. A), 1\u201318 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"1402_CR36","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10107-011-0490-y","volume":"137","author":"R Hemmecke","year":"2013","unstructured":"Hemmecke, R., Onn, S., Romanchuk, L.: $$n$$-fold integer programming in cubic time. Math. Program. 137(1\u20132, Ser. A), 325\u2013341 (2013)","journal-title":"Math. Program."},{"key":"1402_CR37","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.tcs.2015.06.043","volume":"600","author":"D Hermelin","year":"2015","unstructured":"Hermelin, D., Rozenberg, L.: Parameterized complexity analysis for the closest string with wildcards problem. Theor. Comput. Sci. 600, 11\u201318 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1402_CR38","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. ACM 37(4), 843\u2013862 (1990)","journal-title":"J. ACM"},{"key":"1402_CR39","doi-asserted-by":"crossref","unstructured":"Jansen, B.M.P., Kratsch, S.: A structural approach to kernels for ILPs: treewidth and total unimodularity. In: Proceedings of ESA 2015, Lecture Notes in Computer Science, vol. 9294, pp. 779\u2013791 (2015)","DOI":"10.1007\/978-3-662-48350-3_65"},{"key":"1402_CR40","doi-asserted-by":"crossref","unstructured":"Jansen, K., Klein, K.: About the structure of the integer cone and its application to bin packing. In: Proceedings of SODA 2017, pp. 1571\u20131581 (2017)","DOI":"10.1137\/1.9781611974782.103"},{"key":"1402_CR41","unstructured":"Jansen, K., Rohwedder, L.: On integer programming and convolution. In: Proceedings of ITCS 2019, The Leibniz International Proceedings in Informatics, vol. 124, pp. 43:1\u201343:17 (2018)"},{"issue":"3","key":"1402_CR42","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1402_CR43","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2018","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling meets $$n$$-fold integer programming. J. Sched. 21(5), 493\u2013503 (2018)","journal-title":"J. Sched."},{"key":"1402_CR44","doi-asserted-by":"crossref","unstructured":"Knop, D., Kouteck\u00fd, M., Masa\u0159\u00edk, T., Toufar, T.: Simplified algorithmic metatheorems beyond MSO: Treewidth and neighborhood diversity. In: Proceedings of WG 2017, Lecture Notes in Computer Sciencce, vol. 10520, pp. 344\u2013357 (2017)","DOI":"10.1007\/978-3-319-68705-6_26"},{"key":"1402_CR45","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Combinatorial $$n$$-fold integer programming and applications. In: Proceedings of ESA 2017, The Leibniz International Proceedings in Informatics, vol. 87, pp. 54:1\u201354:14 (2017)"},{"key":"1402_CR46","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Voting and bribing in single-exponential time. In: Proceedings of STACS 2017, The Leibniz International Proceedings in Informatics, vol. 66, pp. 46:1\u201346:14 (2017)"},{"key":"1402_CR47","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. In: Proceedings of ICALP 2018, Leibniz International Proceedings in Informatics, vol. 107, pp. 85:1\u201385:14 (2018)"},{"issue":"5","key":"1402_CR48","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.jcss.2015.12.002","volume":"82","author":"S Kratsch","year":"2016","unstructured":"Kratsch, S.: On polynomial kernels for sparse integer linear programs. J. Comput. Syst. Sci. 82(5), 758\u2013766 (2016)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1402_CR49","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"1402_CR50","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanct\u00f4t","year":"2003","unstructured":"Lanct\u00f4t, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"key":"1402_CR51","unstructured":"Lanct\u00f4t, J. Kevin: Some string problems in computational biology. Ph.D. thesis, University of Waterloo (2000)"},{"issue":"4","key":"1402_CR52","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1402_CR53","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. ACM 49(2), 157\u2013171 (2002)","journal-title":"J. ACM"},{"key":"1402_CR54","unstructured":"Lokshtanov, D.: Parameterized integer quadratic programming: variables and coefficients. Tech. rep. (2015). http:\/\/arxiv.org\/abs\/1511.00310"},{"issue":"4","key":"1402_CR55","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput. 39(4), 1432\u20131443 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1402_CR56","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1137\/060673898","volume":"38","author":"D Marx","year":"2008","unstructured":"Marx, D.: Closest substring problems with small distances. SIAM J. Comput. 38(4), 1382\u20131410 (2008)","journal-title":"SIAM J. Comput."},{"key":"1402_CR57","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., van Bevern, R.: Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100, 254\u2013261 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"(1\u20132, Ser. B)","key":"1402_CR58","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154((1\u20132, Ser. B)), 533\u2013562 (2015)","journal-title":"Math. Program."},{"key":"1402_CR59","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Ubiquitous parameterization\u2014invitation to fixed-parameter algorithms. In: Proceedings of MFCS 2004, Lecture Notes in Computer Science, vol. 3153, pp. 84\u2013103 (2004)","DOI":"10.1007\/978-3-540-28629-5_4"},{"key":"1402_CR60","doi-asserted-by":"crossref","unstructured":"Nishimura, N., Simjour, N.: Enumerating neighbour and closest strings. In: Proceedings of IPEC 2012, Lecture Notes in Computer Science, vol. 7535, pp. 252\u2013263 (2012)","DOI":"10.1007\/978-3-642-33293-7_24"},{"key":"1402_CR61","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","DOI":"10.4171\/093"},{"key":"1402_CR62","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.disopt.2014.07.003","volume":"14","author":"S Onn","year":"2014","unstructured":"Onn, S.: Huge multiway table problems. Discrete Optim. 14, 72\u201377 (2014)","journal-title":"Discrete Optim."},{"issue":"4","key":"1402_CR63","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1137\/151004227","volume":"29","author":"S Onn","year":"2015","unstructured":"Onn, S., Sarrabezolles, P.: Huge unimodular $$n$$-fold programs. SIAM J. Discrete Math. 29(4), 2277\u20132283 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1402_CR64","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4) (1981)","DOI":"10.1145\/322276.322287"},{"key":"1402_CR65","doi-asserted-by":"crossref","unstructured":"Stojanovic, N., Berman, P., Gumucio, D., Hardison, R.C., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of WADS 1997, Lecture Notes in Computer Science, vol. 1272, pp. 126\u2013135 (1997)","DOI":"10.1007\/3-540-63307-3_53"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01402-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01402-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01402-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:47:31Z","timestamp":1605746851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01402-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":65,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1402"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01402-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,20]]},"assertion":[{"value":"27 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}