{"id":"https://openalex.org/W2884007467","doi":"https://doi.org/10.1007/s10951-018-0595-8","title":"Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review","display_name":"Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review","publication_year":2018,"publication_date":"2018-12-18","ids":{"openalex":"https://openalex.org/W2884007467","doi":"https://doi.org/10.1007/s10951-018-0595-8","mag":"2884007467"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-018-0595-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-018-0595-8","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1712.06481","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthias Bentert","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ren\u00e9 van Bevern","orcid":"https://orcid.org/0000-0002-4805-218X"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]},{"id":"https://openalex.org/I4210127387","display_name":"Siberian Branch of the Russian Academy of Sciences","ror":"https://ror.org/02frkq021","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Ren\u00e9 van Bevern","raw_affiliation_strings":["Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russian Federation","Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russian Federation"],"raw_orcid":"https://orcid.org/0000-0002-4805-218X","affiliations":[{"raw_affiliation_string":"Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russian Federation","institution_ids":["https://openalex.org/I188973947"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russian Federation","institution_ids":["https://openalex.org/I4210096862","https://openalex.org/I4210127387"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rolf Niedermeier","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188973947","https://openalex.org/I4210096862","https://openalex.org/I4210127387"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.3279,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.82685479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"1","first_page":"3","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5967000126838684,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5967000126838684,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1388999968767166,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05009999871253967,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7401000261306763},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7032999992370605},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.49900001287460327},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4968999922275543},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4675000011920929},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.45329999923706055},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43369999527931213},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.37599998712539673}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7401000261306763},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7032999992370605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6565999984741211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5971999764442444},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.49900001287460327},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4968999922275543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47110000252723694},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.45329999923706055},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43369999527931213},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.37599998712539673},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.3546000123023987},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.3479999899864197},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.34689998626708984},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3264000117778778},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3109999895095825},{"id":"https://openalex.org/C21563000","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive reasoning","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.30709999799728394},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3057999908924103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30399999022483826},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.30219998955726624}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10951-018-0595-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-018-0595-8","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1712.06481","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.06481","pdf_url":"https://arxiv.org/pdf/1712.06481","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:spr:jsched:v:22:y:2019:i:1:d:10.1007_s10951-018-0595-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10951-018-0595-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2018.53","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2018.53","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1712.06481","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.06481","pdf_url":"https://arxiv.org/pdf/1712.06481","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1199465631","display_name":null,"funder_award_id":"5--100","funder_id":"https://openalex.org/F4320321912","funder_display_name":"Ministry of Education and Science of the Russian Federation"},{"id":"https://openalex.org/G6434419953","display_name":null,"funder_award_id":"16-31-60007","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"}],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"},{"id":"https://openalex.org/F4320321912","display_name":"Ministry of Education and Science of the Russian Federation","ror":"https://ror.org/00ghqgy32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W127421644","https://openalex.org/W1492613353","https://openalex.org/W1511638527","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1954494745","https://openalex.org/W1992649763","https://openalex.org/W1993342383","https://openalex.org/W1998389851","https://openalex.org/W1998893700","https://openalex.org/W2008024785","https://openalex.org/W2019977411","https://openalex.org/W2024491681","https://openalex.org/W2035331304","https://openalex.org/W2039917366","https://openalex.org/W2043493954","https://openalex.org/W2051627428","https://openalex.org/W2052174059","https://openalex.org/W2060983467","https://openalex.org/W2062221600","https://openalex.org/W2076027639","https://openalex.org/W2079455887","https://openalex.org/W2086119402","https://openalex.org/W2095263228","https://openalex.org/W2095785938","https://openalex.org/W2106164341","https://openalex.org/W2107223449","https://openalex.org/W2110171203","https://openalex.org/W2113280143","https://openalex.org/W2116087731","https://openalex.org/W2119452138","https://openalex.org/W2137012936","https://openalex.org/W2151677066","https://openalex.org/W2152355908","https://openalex.org/W2294341534","https://openalex.org/W2296148711","https://openalex.org/W2425429136","https://openalex.org/W2534345173","https://openalex.org/W2751935900","https://openalex.org/W2766871017","https://openalex.org/W2775104858","https://openalex.org/W2914414140","https://openalex.org/W2914959486","https://openalex.org/W2963327417","https://openalex.org/W3176255773","https://openalex.org/W4234503811","https://openalex.org/W6947701759"],"related_works":[],"abstract_inverted_index":{"Inductive":[0],"$$k$$":[1,62],"-independent":[2,63,129,133],"graphs":[3,6,134],"generalize":[4],"chordal":[5,104],"and":[7,103,130],"have":[8],"recently":[9],"been":[10],"advocated":[11],"in":[12,137],"the":[13,54,68,89,112,115],"context":[14],"of":[15,23,33,44,57,80,101],"interference-avoiding":[16],"wireless":[17],"communication":[18],"scheduling.":[19,138],"The":[20],"NP-hard":[21],"problem":[22,59,72,94],"finding":[24,34],"maximum-weight":[25],"induced":[26],"c-colorable":[27],"subgraphs,":[28],"which":[29,106],"is":[30,73,95,114],"a":[31],"generalization":[32],"maximum":[35],"independent":[36],"sets,":[37],"naturally":[38],"occurs":[39],"when":[40],"selecting":[41],"$$c$$":[42],"sets":[43],"pairwise":[45],"non-conflicting":[46],"jobs":[47],"(modeled":[48],"as":[49],"graph":[50,124],"vertices).":[51],"We":[52,65],"investigate":[53],"parameterized":[55],"complexity":[56],"this":[58],"on":[60,76,98],"inductive":[61,81,127,131],"graphs.":[64,83],"show":[66],"that":[67,88],"Maximum":[69],"Independent":[70],"Set":[71],"W[1]-hard":[74],"even":[75],"2-simplicial":[77],"3-minoes\u2014a":[78],"subclass":[79],"2-independent":[82],"In":[84,109],"contrast,":[85],"we":[86,121],"prove":[87],"more":[90],"general":[91],"Max-Weightc-Colorable":[92],"Subgraph":[93],"fixed-parameter":[96],"tractable":[97],"edge-wise":[99],"unions":[100],"cluster":[102],"graphs,":[105],"are":[107],"2-simplicial.":[108],"both":[110],"cases,":[111],"parameter":[113],"solution":[116],"size.":[117],"Aside":[118],"from":[119],"this,":[120],"survey":[122],"other":[123],"classes":[125],"between":[126],"$$1$$":[128],"$$2$$":[132],"with":[135],"applications":[136]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2018-08-03T00:00:00"}