{"id":"https://openalex.org/W1992309827","doi":"https://doi.org/10.1137/110826813","title":"A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)","display_name":"A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1992309827","doi":"https://doi.org/10.1137/110826813","mag":"1992309827"},"language":"en","primary_location":{"id":"doi:10.1137/110826813","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110826813","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["[Institute of Informatics, University of Warsaw]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Institute of Informatics, University of Warsaw]","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["[Institute of Informatics, University of Warsaw]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Institute of Informatics, University of Warsaw]","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["[Institute of Informatics, University of Warsaw]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Institute of Informatics, University of Warsaw]","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083165224","display_name":"Jakub Onufry Wojtaszczyk","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105926","display_name":"Institute of Mathematics and Informatics","ror":"https://ror.org/01b5dy719","country_code":"BG","type":"facility","lineage":["https://openalex.org/I24768866","https://openalex.org/I4210105926"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["BG","CZ","PL"],"is_corresponding":false,"raw_author_name":"Jakub Onufry Wojtaszczyk","raw_affiliation_strings":["Institute of Mathematics, University of Warsaw#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University of Warsaw#TAB#","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210105926","https://openalex.org/I4210120266"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.34,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59796925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":"4","first_page":"815","last_page":"828"},"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.9987999796867371,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.62872713804245},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6157121658325195},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6017935276031494},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5951771140098572},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.510296106338501},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5058343410491943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.462430864572525},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.42577800154685974},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.41913869976997375},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.416655033826828},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27167606353759766}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.62872713804245},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6157121658325195},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6017935276031494},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5951771140098572},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.510296106338501},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5058343410491943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.462430864572525},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.42577800154685974},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.41913869976997375},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.416655033826828},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27167606353759766},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110826813","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110826813","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1967387782","https://openalex.org/W1973199140","https://openalex.org/W1989984435","https://openalex.org/W1990755119","https://openalex.org/W2048988825","https://openalex.org/W2051856222","https://openalex.org/W2152728086","https://openalex.org/W2199961663","https://openalex.org/W2911854207"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W2380525562","https://openalex.org/W4291316360","https://openalex.org/W4297911588","https://openalex.org/W4229747356","https://openalex.org/W3121941015","https://openalex.org/W1542397451","https://openalex.org/W398688634"],"abstract_inverted_index":{"One":[0,78],"of":[1,28,35,66,75,85,118,196,206,226,231,266],"the":[2,6,10,29,51,91,128,133,148,176,221,232,243,267,304,315],"driving":[3],"problems":[4],"in":[5,14,26,87,213,264],"CSP":[7],"area":[8],"is":[9,56,90,162,251],"dichotomy":[11,313],"conjecture,":[12],"formulated":[13],"1993":[15],"by":[16],"Feder":[17,254],"and":[18,23,200,242,308],"Vardi":[19],"[Monotone":[20],"monadic":[21],"SNP":[22],"constraint":[24,52],"satisfaction,":[25],"Proceedings":[27,265],"25th":[30],"Annual":[31,269],"Symposium":[32,271],"on":[33,164,272],"Theory":[34],"Computing,":[36],"ACM,":[37,275],"New":[38,276],"York,":[39,277],"1993,":[40],"pp.":[41,107,281],"612--622],":[42],"stating":[43],"that":[44,217],"for":[45,116,156,239,259,303,314],"any":[46],"fixed":[47],"relational":[48],"structure":[49],"$\\Gamma$":[50],"satisfaction":[53],"problem":[54,152,167,184,235,307],"CSP($\\Gamma$)":[55],"either":[57],"NP-complete":[58],"or":[59],"polynomial":[60],"time":[61,293],"solvable.":[62],"A":[63],"large":[64],"amount":[65],"research":[67],"has":[68,220,236],"gone":[69],"into":[70],"checking":[71],"various":[72],"specific":[73],"cases":[74],"this":[76,137,183,249,296],"conjecture.":[77],"such":[79,214],"variant":[80],"which":[81,126,143,153],"attracted":[82],"a":[83,141,151,157,165,188,215,286,300,312],"lot":[84],"attention":[86],"recent":[88],"years":[89,241],"List":[92,112],"Matrix":[93,113],"Partition":[94,114],"problem.":[95,135,181,318],"In":[96,136,182,295],"2004":[97],"Cameron":[98],"et":[99,255],"al.":[100,256],"[SIAM":[101],"J.":[102],"Discrete":[103,273],"Math.,":[104],"21":[105],"(2007),":[106],"900--929]":[108],"classified":[109],"almost":[110],"all":[111],"variants":[115],"matrices":[117],"size":[119],"at":[120,171],"most":[121],"four.":[122],"The":[123,229],"only":[124],"case":[125],"resisted":[127,154],"classification":[129],"became":[130],"known":[131,168,245],"as":[132,173,175,224],"Stubborn":[134,177],"paper":[138,250,297],"we":[139,185,201,298,310],"show":[140],"result":[142],"enables":[144],"us":[145],"to":[146,169,203,210,248,253],"finish":[147],"classification---thus":[149],"solving":[150],"attacks":[155],"few":[158],"years.":[159],"Our":[160],"approach":[161],"based":[163],"combinatorial":[166],"be":[170],"least":[172],"hard":[174],"problem---the":[178],"3-Compatible":[179,233,305],"Coloring":[180,234,306,317],"are":[186],"given":[187],"complete":[189],"graph":[190],"with":[191,285],"each":[192,211],"edge":[193,219],"assigned":[194],"one":[195,205],"three":[197,208],"possible":[198],"colors":[199,209],"want":[202],"assign":[204],"those":[207],"vertex":[212],"way":[216],"no":[218],"same":[222],"color":[223],"both":[225],"its":[227],"endpoints.":[228],"tractability":[230],"been":[237],"open":[238],"several":[240],"best":[244],"algorithm":[246,284,302],"prior":[247],"due":[252],"[Two":[257],"algorithms":[258],"general":[260],"list":[261],"matrix":[262],"partitions,":[263],"16th":[268],"ACM-SIAM":[270],"Algorithms,":[274],"SIAM,":[278],"Philadelphia,":[279],"2005,":[280],"870--876]---a":[282],"quasipolynomial":[283],"$n^{O(\\log":[287],"n":[288],"/":[289],"\\log":[290,291],"n)}$":[292],"complexity.":[294],"present":[299],"polynomial-time":[301],"consequently":[309],"prove":[311],"k-Compatible":[316]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}