{"id":"https://openalex.org/W2807356675","doi":"https://doi.org/10.1137/16m1107462","title":"Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs","display_name":"Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2807356675","doi":"https://doi.org/10.1137/16m1107462","mag":"2807356675"},"language":"en","primary_location":{"id":"doi:10.1137/16m1107462","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1107462","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/604496d6-c578-42bb-adca-a0eb480c95b4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043929563","display_name":"Pradeesha Ashok","orcid":"https://orcid.org/0000-0003-2174-0051"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I181514455","display_name":"International Institute of Information Technology Bangalore","ror":"https://ror.org/05h9eqy10","country_code":"IN","type":"education","lineage":["https://openalex.org/I181514455"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"Pradeesha Ashok","raw_affiliation_strings":["Rutgers University, New Brunswick, NJ 08901","International Institute of Information Technology, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, NJ 08901","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"International Institute of Information Technology, Bangalore, India","institution_ids":["https://openalex.org/I181514455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000225226","display_name":"Aditi Dudeja","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aditi Dudeja","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudeshna Kolay","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["IN","NL","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands","The Institute of Mathematical Sciences, Taramani, India and Department of Informatics, Uni-versity of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"The Institute of Mathematical Sciences, Taramani, India and Department of Informatics, Uni-versity of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I59611059","https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5043929563"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I181514455"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09492739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"2","first_page":"1189","last_page":"1208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9945999979972839,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8360965251922607},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.773237943649292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7687342166900635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7216818928718567},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.612433910369873},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5416359305381775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46379169821739197},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42914876341819763},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4195197522640228},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34298813343048096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08415701985359192}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8360965251922607},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.773237943649292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7687342166900635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7216818928718567},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.612433910369873},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5416359305381775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46379169821739197},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42914876341819763},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4195197522640228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34298813343048096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08415701985359192}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m1107462","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1107462","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/604496d6-c578-42bb-adca-a0eb480c95b4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/604496d6-c578-42bb-adca-a0eb480c95b4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ashok, P, Dudeja, A, Kolay, S & Saurabh, S 2018, 'Exact and fixed parameter tractable algorithms for max-conflict-free coloring in hypergraphs \u2217', SIAM Journal on Discrete Mathematics, vol. 32, no. 2, pp. 1189-1208. https://doi.org/10.1137/16M1107462","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/604496d6-c578-42bb-adca-a0eb480c95b4","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/604496d6-c578-42bb-adca-a0eb480c95b4","pdf_url":"https://research.tue.nl/nl/publications/604496d6-c578-42bb-adca-a0eb480c95b4","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 32(2), 1189 - 1208. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/604496d6-c578-42bb-adca-a0eb480c95b4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/604496d6-c578-42bb-adca-a0eb480c95b4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ashok, P, Dudeja, A, Kolay, S & Saurabh, S 2018, 'Exact and fixed parameter tractable algorithms for max-conflict-free coloring in hypergraphs \u2217', SIAM Journal on Discrete Mathematics, vol. 32, no. 2, pp. 1189-1208. https://doi.org/10.1137/16M1107462","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G1816994784","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320333065","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G4269630183","display_name":null,"funder_award_id":"306992","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1974867378","https://openalex.org/W1984121377","https://openalex.org/W2007225140","https://openalex.org/W2033159765","https://openalex.org/W2071386577","https://openalex.org/W2119116325","https://openalex.org/W2296148711","https://openalex.org/W2964222076"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W4301903827"],"abstract_inverted_index":{"Conflict-free":[0],"coloring":[1,22,29],"of":[2,10,23,55,60,78,87,115,208,253],"hypergraphs":[3,220],"is":[4,93,106,143,176],"a":[5,16,20,27,34,37,53,56,66,71,132,148,196,212,227,250],"very":[6],"well":[7],"studied":[8],"question":[9,140],"theoretical":[11],"and":[12,70,118,204],"practical":[13],"interest.":[14],"For":[15,65,147,215],"hypergraph":[17,68],"$H=(U,":[18],"\\mathcal{F})$,":[19],"conflict-free":[21,91,101,153,254],"$H$":[24,69],"refers":[25],"to":[26,131,199],"vertex":[28,35],"where":[30],"every":[31],"hyperedge":[32],"has":[33],"with":[36,129,159,184,245],"unique":[38],"color,":[39],"distinct":[40],"from":[41],"all":[42],"other":[43],"vertices":[44,77],"in":[45,112,211,239],"the":[46,76,85,113,122,139,144,164,167,200,206,216],"hyperedge.":[47],"In":[48,121,137],"this":[49,61,103,110,127,174],"paper,":[50],"we":[51,125,141,152,225,231],"initiate":[52],"study":[54,109,126,142],"natural":[57,133],"maximization":[58,104],"version":[59,105,252],"problem,":[62],"namely,":[63],"Max-CFC:":[64],"given":[67,149],"fixed":[72,177],"$r\\geq":[73],"2$,":[74],"color":[75,154,209],"$U$":[79],"using":[80,195],"$r$":[81,162],"colors":[82],"so":[83],"that":[84,89,173],"number":[86],"hyperedges":[88,158],"are":[90],"colored":[92],"maximized.":[94],"By":[95],"previously":[96],"known":[97],"hardness":[98],"results":[99],"for":[100,219,236,249],"coloring,":[102,255],"NP-hard.":[107],"We":[108,171],"problem":[111,128,175,203],"context":[114],"both":[116],"exact":[117,234],"parameterized":[119,123],"algorithms.":[120],"setting,":[124],"respect":[130],"parameter---the":[134],"solution":[135,168],"size.":[136],"particular,":[138],"following:":[145],"p-CFC:":[146],"hypergraph,":[150],"can":[151],"at":[155,160],"least":[156],"$k$":[157],"most":[161],"colors,":[163],"parameter":[165,178],"being":[166],"size":[169],"$k$.":[170],"show":[172],"tractable":[179],"by":[180,222],"designing":[181],"an":[182,233],"algorithm":[183,235],"running":[185,238],"time":[186],"$2^{\\mathcal{O}(k":[187],"\\log":[188,189,193],"k":[190,192],"+":[191],"r)}(n+m)^{\\mathcal{O}(1)}$":[194],"novel":[197],"connection":[198],"Unique":[201,256],"Coverage":[202],"applying":[205],"method":[207],"coding":[210],"nontrivial":[213],"manner.":[214],"special":[217],"case":[218],"induced":[221],"graph":[223],"neighborhoods":[224],"give":[226,232],"polynomial":[228],"kernel.":[229],"Finally,":[230],"Max-CFC":[237],"$\\mathcal{O}(2^{n+m})$":[240],"time.":[241],"All":[242],"our":[243],"algorithms,":[244],"minor":[246],"modifications,":[247],"work":[248],"stronger":[251],"Maximum":[257],"Coloring.":[258]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-06-13T00:00:00"}