{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:28Z","timestamp":1748751328834,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_27","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"329-343","source":"Crossref","is-referenced-by-count":2,"title":["Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Felix","family":"Land","sequence":"additional","affiliation":[]},{"given":"Maren","family":"Kaluza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khot, S.: Optimal long code test with one free bit. In: 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 453\u2013462. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.23"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/120882160","volume":"43","author":"AA Bulatov","year":"2014","unstructured":"Bulatov, A.A., Marx, D.: Constraint satisfaction parameterized by solution size. SIAM J. Comput. 43(2), 573\u2013616 (2014)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.jcss.2007.06.015","volume":"74","author":"C Calabro","year":"2008","unstructured":"Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-SAT: An isolation lemma for k-CNFs. J. Comput. Syst. Sci. 74(3), 386\u2013393 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10878-006-7137-6","volume":"11","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: On the computational hardness based on linear fpt-reductions. J. Comb. Optim. 11(2), 231\u2013247 (2006)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","volume":"92","author":"J Du","year":"1991","unstructured":"Du, J., Leung, J.Y., Young, G.H.: Scheduling chain-structured tasks to minimize makespan and mean flow time. Inf. Comput. 92(2), 219\u2013236 (1991)","journal-title":"Inf. Comput."},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 8, 438\u2013448 (1987)","journal-title":"J. Algorithms"},{"key":"27_CR8","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, p. 25. IEEE Computer Society (2002)","DOI":"10.1109\/CCC.2002.1004334"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Lin, B.: The parameterized complexity of k-biclique. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 605\u2013615. SIAM (2015)","DOI":"10.1137\/1.9781611973730.41"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Conditional hardness of precedence constrained scheduling on identical machines. In: Schulman, L.J. (ed.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 745\u2013754. ACM (2010)","DOI":"10.1145\/1806689.1806791"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: Np-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:16Z","timestamp":1748744356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}