{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:09:01Z","timestamp":1780330141667,"version":"3.54.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["16-31-60007"],"award-info":[{"award-number":["16-31-60007"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["5-100"],"award-info":[{"award-number":["5-100"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10951-018-0595-8","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T06:15:53Z","timestamp":1545113753000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Inductive \n                \n                  \n                \n                $$k$$\n                \n                  \n                    k\n                  \n                \n              -independent graphs and c-colorable subgraphs in scheduling: a review"],"prefix":"10.1007","volume":"22","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-218X","authenticated-orcid":false,"given":"Ren\u00e9","family":"van Bevern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"595_CR1","doi-asserted-by":"publisher","unstructured":"Akcoglu, K., Aspnes, J., DasGupta, B., & Kao, M. Y. (2002). Opportunity-cost algorithms for combinatorial auctions. In Applied optimization 74: Computational methods in decision-making, economics and finance (pp. 455\u2013479). Dordrecht: Kluwer. \n                    https:\/\/doi.org\/10.1007\/978-1-4757-3613-7_23","DOI":"10.1007\/978-1-4757-3613-7_23"},{"issue":"4","key":"595_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., & Zwick, U. (1995). Color-coding. Journal of the ACM, 42(4), 844\u2013856. \n                    https:\/\/doi.org\/10.1145\/210332.210337\n                    \n                  .","journal-title":"Journal of the ACM"},{"issue":"1","key":"595_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"EM Arkin","year":"1987","unstructured":"Arkin, E. M., & Silverberg, E. B. (1987). Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18(1), 1\u20138. \n                    https:\/\/doi.org\/10.1016\/0166-218X(87)90037-0\n                    \n                  .","journal-title":"Discrete Applied Mathematics"},{"key":"595_CR4","doi-asserted-by":"publisher","unstructured":"\u00c1sgeirsson, E. I., Halld\u00f3rsson, M. M., & Tonoyan, T. (2017). Universal framework for wireless scheduling problems. In 44th international colloquium on automata, languages, and programming, ICALP, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (pp 129:1\u2013129:15). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.129\n                    \n                  .","DOI":"10.4230\/LIPIcs.ICALP.2017.129"},{"issue":"2","key":"595_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"BS Baker","year":"1996","unstructured":"Baker, B. S., & Coffman, E. G. (1996). Mutual exclusion scheduling. Theoretical Computer Science, 162(2), 225\u2013243. \n                    https:\/\/doi.org\/10.1016\/0304-3975(96)00031-X\n                    \n                  .","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"595_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., & Chawla, S. (2004). Correlation clustering. Machine Learning, 56(1), 89\u2013113. \n                    https:\/\/doi.org\/10.1023\/B:MACH.0000033116.57574.95\n                    \n                  .","journal-title":"Machine Learning"},{"key":"595_CR7","doi-asserted-by":"publisher","unstructured":"van Bevern, R., Komusiewicz, C., & Sorge, M. (2017). A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks, 70(3), 262\u2013278. \n                    https:\/\/doi.org\/10.1002\/net.21742\n                    \n                   (WARP 2 special issue).","DOI":"10.1002\/net.21742"},{"key":"595_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10951-014-0398-5","volume":"18","author":"R Bevern van","year":"2015","unstructured":"van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. (2015). Interval scheduling and colorful independent sets. Journal of Scheduling, 18, 449\u2013469. \n                    https:\/\/doi.org\/10.1007\/s10951-014-0398-5\n                    \n                  .","journal-title":"Journal of Scheduling"},{"issue":"1","key":"595_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TNET.2011.2157831","volume":"20","author":"B Birand","year":"2012","unstructured":"Birand, B., Chudnovsky, M., Ries, B., Seymour, P., Zussman, G., & Zwols, Y. (2012). Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. IEEE\/ACM Transactions on Networks, 20(1), 163\u2013176. \n                    https:\/\/doi.org\/10.1109\/TNET.2011.2157831\n                    \n                  .","journal-title":"IEEE\/ACM Transactions on Networks"},{"key":"595_CR10","doi-asserted-by":"publisher","unstructured":"Blair, J. R. S., & Peyton, B. (1993). An introduction to chordal graphs and clique trees. In Graph theory and sparse matrix computation, IMA volumes in mathematics and its applications (vol. 56, pp 1\u201329). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1\n                    \n                  .","DOI":"10.1007\/978-1-4613-8369-7_1"},{"issue":"3","key":"595_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K. S., & Lueker, G. S. (1976). Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13(3), 335\u2013379. \n                    https:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1\n                    \n                  .","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"595_CR12","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"DG Corneil","year":"2009","unstructured":"Corneil, D. G., Olariu, S., & Stewart, L. (2009). The LBFS structure and recognition of interval graphs. SIAM Journal on Discrete Mathematics, 23(4), 1905\u20131953.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"595_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F. V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-319-21275-3\n                    \n                  ."},{"issue":"1","key":"595_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G. A. (1961). On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg, 25(1), 71\u201376. \n                    https:\/\/doi.org\/10.1007\/BF02992776\n                    \n                  .","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"595_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-1-4471-5559-1\n                    \n                  ."},{"key":"595_CR16","doi-asserted-by":"publisher","unstructured":"Faenza, Y., Oriolo, G., & Stauffer, G. (2011). An algorithmic decomposition of claw-free graphs leading to an \n                    \n                      \n                    \n                    $$O(n^3)$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            n\n                            3\n                          \n                          )\n                        \n                      \n                    \n                  -algorithm for the weighted stable set problem. In Proceedings of the 22nd ACM\u2013SIAM symposium on discrete algorithms (SODA\u201911) (pp. 630\u2013646). Philadelphia: SIAM. \n                    https:\/\/doi.org\/10.1137\/1.9781611973082.49\n                    \n                  .","DOI":"10.1137\/1.9781611973082.49"},{"issue":"1","key":"595_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M. R., Hermelin, D., Rosamond, F., & Vialette, S. (2009). On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410(1), 53\u201361. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2008.09.065\n                    \n                  .","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"595_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows, M. R., Jansen, B. M. P., & Rosamond, F. A. (2013). Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal of Combinatorics, 34(3), 541\u2013566. \n                    https:\/\/doi.org\/10.1016\/j.ejc.2012.04.008\n                    \n                  .","journal-title":"European Journal of Combinatorics"},{"key":"595_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized complexity theory","author":"J Flum","year":"2006","unstructured":"Flum, J., & Grohe, M. (2006). Parameterized complexity theory. Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/3-540-29953-X\n                    \n                  ."},{"key":"595_CR20","unstructured":"Frank, A. (1975). Some polynomial algorithms for certain graphs and hypergraphs. In Proceedings of the 5th British combinatorial conference, congressus numerantium (vol. XV, pp. 211\u2013226)."},{"issue":"1","key":"595_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2008.04.016","volume":"157","author":"F Gardi","year":"2009","unstructured":"Gardi, F. (2009). Mutual exclusion scheduling with interval graphs or related classes, Part I. Discrete Applied Mathematics, 157(1), 19\u201335. \n                    https:\/\/doi.org\/10.1016\/j.dam.2008.04.016\n                    \n                  .","journal-title":"Discrete Applied Mathematics"},{"key":"595_CR22","doi-asserted-by":"publisher","unstructured":"Gaur, D. R., & Krishnamurti, R. (2003). Scheduling intervals using independent sets in claw-free graphs. In Proceedings of the international conference on computational science and its applications (ICCSA 2003) (pp. 254\u2013262). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/3-540-44839-X_28\n                    \n                  .","DOI":"10.1007\/3-540-44839-X_28"},{"key":"595_CR23","first-page":"109","volume":"109","author":"A Gy\u00e1rf\u00e1s","year":"1995","unstructured":"Gy\u00e1rf\u00e1s, A., & West, D. (1995). Multitrack interval graphs. Congressus Numerantium, 109, 109\u2013116.","journal-title":"Congressus Numerantium"},{"key":"595_CR24","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M. M. (2016). Invited paper: Models for wireless algorithms. In Proceedings of the 14th international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt\u201916) (pp. 377\u2013381). New York: IEEE. \n                    https:\/\/doi.org\/10.1109\/WIOPT.2016.7492945\n                    \n                  .","DOI":"10.1109\/WIOPT.2016.7492945"},{"key":"595_CR25","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M. M., & Karlsson, R. K. (2006). Strip graphs: Recognition and scheduling. In Proceedings of the 32nd international workshop on graph-theoretic concepts in computer science (WG\u201906), Lecture notes in computer science (vol. 4271, pp. 137\u2013146). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/11917496_13\n                    \n                  .","DOI":"10.1007\/11917496_13"},{"key":"595_CR26","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M. M., & Tonoyan, T. (2015). How well can graphs represent wireless interference? In Proceedings of the 47th annual ACM symposium on theory of computing (STOC\u201915) (pp. 635\u2013644). New York: ACM. \n                    https:\/\/doi.org\/10.1145\/2746539.2746585\n                    \n                  .","DOI":"10.1145\/2746539.2746585"},{"issue":"4","key":"595_CR27","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1287\/mnsc.1100.1302","volume":"57","author":"W H\u00f6hn","year":"2011","unstructured":"H\u00f6hn, W., K\u00f6nig, F. G., M\u00f6hring, R. H., & L\u00fcbbecke, M. E. (2011). Integrated sequencing and scheduling in coil coating. Management Science, 57(4), 647\u2013666. \n                    https:\/\/doi.org\/10.1287\/mnsc.1100.1302\n                    \n                  .","journal-title":"Management Science"},{"issue":"1","key":"595_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00231-9","volume":"215","author":"RE Jamison","year":"2000","unstructured":"Jamison, R. E., & Mulder, H. M. (2000). Tolerance intersection graphs on binary trees with constant tolerance 3. Discrete Mathematics, 215(1), 115\u2013131. \n                    https:\/\/doi.org\/10.1016\/S0012-365X(99)00231-9\n                    \n                  .","journal-title":"Discrete Mathematics"},{"issue":"49","key":"595_CR29","doi-asserted-by":"publisher","first-page":"4253","DOI":"10.1016\/j.tcs.2010.09.001","volume":"411","author":"M Jiang","year":"2010","unstructured":"Jiang, M. (2010). On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theoretical Computer Science, 411(49), 4253\u20134262. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2010.09.001\n                    \n                  .","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"595_CR30","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00453-012-9651-5","volume":"66","author":"M Jiang","year":"2013","unstructured":"Jiang, M. (2013). Recognizing \n                    \n                      \n                    \n                    $$d$$\n                    \n                      \n                        d\n                      \n                    \n                  -interval graphs and d-track interval graphs. Algorithmica, 66(3), 541\u2013563. \n                    https:\/\/doi.org\/10.1007\/s00453-012-9651-5\n                    \n                  .","journal-title":"Algorithmica"},{"key":"595_CR31","doi-asserted-by":"publisher","unstructured":"Kammer, F., Tholey, T., & Voepel, H. (2010). Approximation algorithms for intersection graphs. In Proceedings of the 13th international workshop on approximation algorithms for combinatorial optimization problems and 14th workshop on randomized techniques in computation: Algorithms and techniques (APPROX\u201910 and RANDOM\u201910), Lecture notes in computer science (vol. 6302, pp. 260\u2013273). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-642-15369-3_20\n                    \n                  .","DOI":"10.1007\/978-3-642-15369-3_20"},{"issue":"5","key":"595_CR32","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AWJ Kolen","year":"2007","unstructured":"Kolen, A. W. J., Lenstra, J. K., Papadimitriou, C. H., & Spieksma, F. C. R. (2007). Interval scheduling: A survey. Naval Research Logistics, 54(5), 530\u2013543. \n                    https:\/\/doi.org\/10.1002\/nav.20231\n                    \n                  .","journal-title":"Naval Research Logistics"},{"key":"595_CR33","doi-asserted-by":"publisher","unstructured":"Komusiewicz, C., & Niedermeier, R. (2012). New races in parameterized algorithmics. In Proceedings of the 37th international symposium on mathematical foundations of computer science (MFCS\u201912), Lecture notes in computer science (vol. 7464, pp. 19\u201330). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-642-32589-2_2\n                    \n                  .","DOI":"10.1007\/978-3-642-32589-2_2"},{"key":"595_CR34","unstructured":"K\u00f6se, A., Evirgen, N., G\u00f6kcesu, H., G\u00f6kcesu, K., & M\u00e9dard, M. (2017). Nearly optimal scheduling of wireless ad hoc networks in polynomial time. Available on \n                    arXiv:1712.00658\n                    \n                  ."},{"key":"595_CR35","doi-asserted-by":"publisher","unstructured":"K\u00f6se, A., & M\u00e9dard, M. (2017). Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs. In Proceedings of the 28th IEEE annual international symposium on personal, indoor, and mobile radio communications (PIMRC\u201917) (pp. 1\u20137). New York: IEEE. \n                    https:\/\/doi.org\/10.1109\/PIMRC.2017.8292404\n                    \n                  .","DOI":"10.1109\/PIMRC.2017.8292404"},{"issue":"3","key":"595_CR36","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S089548019936521X","volume":"16","author":"Y Metelsky","year":"2003","unstructured":"Metelsky, Y., & Tyshkevich, R. (2003). Line graphs of Helly hypergraphs. SIAM Journal on Discrete Mathematics, 16(3), 438\u2013448. \n                    https:\/\/doi.org\/10.1137\/S089548019936521X\n                    \n                  .","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"595_CR37","doi-asserted-by":"publisher","unstructured":"Misra, N., Panolan, F., Rai, A., Raman, V., & Saurabh, S. (2013). Parameterized algorithms for max colorable induced subgraph problem on perfect graphs. In Proceedings of the 39th international workshop on graph-theoretic concepts in computer science (WG\u201913) (pp. 370\u2013381). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-642-45043-3_32\n                    \n                  .","DOI":"10.1007\/978-3-642-45043-3_32"},{"key":"595_CR38","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., & van Bevern, R. (2018). Parameterized complexity of machine scheduling: 15 open problems. Computers and Operations Research, 100, 254\u2013261. \n                    https:\/\/doi.org\/10.1016\/j.cor.2018.07.020\n                    \n                  .","journal-title":"Computers and Operations Research"},{"issue":"4","key":"595_CR39","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0196-6774(82)90030-X","volume":"3","author":"K Nakajima","year":"1982","unstructured":"Nakajima, K., & Hakimi, S. L. (1982). Complexity results for scheduling tasks with discrete starting times. Journal of Algorithms, 3(4), 344\u2013361. \n                    https:\/\/doi.org\/10.1016\/0196-6774(82)90030-X\n                    \n                  .","journal-title":"Journal of Algorithms"},{"key":"595_CR40","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R. (2006). Invitation to fixed-parameter algorithms. Oxford: Oxford University Press. \n                    https:\/\/doi.org\/10.1093\/acprof:oso\/9780198566076.001.0001\n                    \n                  ."},{"key":"595_CR41","doi-asserted-by":"publisher","unstructured":"Niedermeier, R. (2010). Reflections on multivariate algorithmics and problem parameterization. In Proceedings of the 27th international symposium on theoretical aspects of computer science (STACS\u201910), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, LIPIcs (vol. 5, pp. 17\u201332). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2010.2495\n                    \n                  .","DOI":"10.4230\/LIPIcs.STACS.2010.2495"},{"issue":"3","key":"595_CR42","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"C Papadimitriou","year":"1979","unstructured":"Papadimitriou, C., & Yannakakis, M. (1979). Scheduling interval-ordered tasks. SIAM Journal on Computing, 8(3), 405\u2013409. \n                    https:\/\/doi.org\/10.1137\/0208031\n                    \n                  .","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"595_CR43","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D. J., Tarjan, R. E., & Lueker, G. S. (1976). Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5(2), 266\u2013283. \n                    https:\/\/doi.org\/10.1137\/0205021\n                    \n                  .","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"595_CR44","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., & Tsur, D. (2004). Cluster graph modification problems. Discrete Applied Mathematics, 144(1\u20132), 173\u2013182. \n                    https:\/\/doi.org\/10.1016\/j.dam.2004.01.007\n                    \n                  .","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"595_CR45","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung, S. C., & Vlach, M. (2005). Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling, 8(5), 453\u2013460. \n                    https:\/\/doi.org\/10.1007\/s10951-005-2863-7\n                    \n                  .","journal-title":"Journal of Scheduling"},{"key":"595_CR46","unstructured":"Wegner, G. (1961). Eigenschaften der Nerven homologisch-einfacher Familien im\n                           \n                    \n                      \n                    \n                    $$R^n$$\n                    \n                      \n                        \n                          R\n                          n\n                        \n                      \n                    \n                  . Ph.D. Thesis, Universit\u00e4t G\u00f6ttingen."},{"issue":"3","key":"595_CR47","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0166-218X(84)90127-6","volume":"8","author":"DB West","year":"1984","unstructured":"West, D. B., & Shmoys, D. B. (1984). Recognizing graphs with fixed interval number is NP-complete. Discrete Applied Mathematics, 8(3), 295\u2013305. \n                    https:\/\/doi.org\/10.1016\/0166-218X(84)90127-6\n                    \n                  .","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"595_CR48","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M Yannakakis","year":"1987","unstructured":"Yannakakis, M., & Gavril, F. (1987). The maximum \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2), 133\u2013137. \n                    https:\/\/doi.org\/10.1016\/0020-0190(87)90107-4\n                    \n                  .","journal-title":"Information Processing Letters"},{"issue":"2","key":"595_CR49","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2151171.2151177","volume":"8","author":"Y Ye","year":"2012","unstructured":"Ye, Y., & Borodin, A. (2012). Elimination graphs. ACM Transactions on Algorithms, 8(2), 14:1\u201314:23. \n                    https:\/\/doi.org\/10.1145\/2151171.2151177\n                    \n                  .","journal-title":"ACM Transactions on Algorithms"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0595-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0595-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0595-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T19:17:25Z","timestamp":1576610245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0595-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["595"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0595-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}