{"id":"https://openalex.org/W1558921963","doi":"https://doi.org/10.1007/11940128_27","title":"Parameterized Problems on Coincidence Graphs","display_name":"Parameterized Problems on Coincidence Graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1558921963","doi":"https://doi.org/10.1007/11940128_27","mag":"1558921963"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5003534754","display_name":"Sylvain Guillemot","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I208215962","https://openalex.org/I4210101743","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Sylvain Guillemot","raw_affiliation_strings":["LIRMM, 161 rue Ada, 34392 Cedex 5, Montpellier"],"affiliations":[{"raw_affiliation_string":"LIRMM, 161 rue Ada, 34392 Cedex 5, Montpellier","institution_ids":["https://openalex.org/I4210101743"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003534754"],"corresponding_institution_ids":["https://openalex.org/I4210101743"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":61},"biblio":{"volume":null,"issue":null,"first_page":"253","last_page":"266"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9999,"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":"Graph Theory and Algorithms","score":0.9999,"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/T11567","display_name":"Automata Theory and Formal Languages","score":0.9986,"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/T11269","display_name":"Text Compression and Indexing Algorithms","score":0.9972,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/parameterized-complexity","display_name":"Parameterized Complexity","score":0.558833},{"id":"https://openalex.org/keywords/approximate-matching","display_name":"Approximate Matching","score":0.502546},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.50160336},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4196073}],"concepts":[{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.77885175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7423484},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.73731095},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.50160336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49113485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4740588},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42096266},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4196073},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41788727},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.41716483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1519147138","https://openalex.org/W1539375795","https://openalex.org/W1971393213","https://openalex.org/W1973852671","https://openalex.org/W2009147258","https://openalex.org/W2011039300","https://openalex.org/W2027999353","https://openalex.org/W2037968786","https://openalex.org/W2101177721","https://openalex.org/W2108301529","https://openalex.org/W2108524515","https://openalex.org/W2125065856","https://openalex.org/W2296148711","https://openalex.org/W2897365112","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W4200634309","https://openalex.org/W2946244341","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W2132777284","https://openalex.org/W2051058708","https://openalex.org/W1999473833","https://openalex.org/W1983207144","https://openalex.org/W154868527","https://openalex.org/W1494268238"],"abstract_inverted_index":{"A":[0,14],"(k,r)-tuple":[1,23],"is":[2,16],"a":[3,22,53],"word":[4],"of":[5,11,45,55,80,87,104],"length":[6,89,106],"r":[7,94,111,150],"on":[8,38,49],"an":[9],"alphabet":[10],"size":[12],"k.":[13],"graph":[15,47],"(k,r)-representable":[17,50,92,109],"if":[18],"we":[19,117,126],"can":[20],"assign":[21],"to":[24,141],"each":[25],"vertex":[26],"such":[27],"that":[28,119],"two":[29,78],"vertices":[30],"are":[31,63,77,122],"connected":[32],"iff":[33],"the":[34,43,56,59,82,99,120,132],"associated":[35],"tuples":[36,86,103],"agree":[37],"some":[39],"component.":[40],"We":[41],"study":[42,62],"complexity":[44],"several":[46],"problems":[48,60,121],"graphs,":[51],"as":[52],"function":[54],"parameters":[57],"k,r;":[58],"under":[61],"Maximum":[64,71],"Independent":[65],"Set,":[66],"Minimum":[67],"Dominating":[68],"Set":[69],"and":[70,98,148],"Clique.":[72],"In":[73,114],"this":[74],"framework,":[75],"there":[76],"classes":[79],"interest:":[81],"graphs":[83,91,100,108],"representable":[84,101],"with":[85,93,102,110],"logarithmic":[88],"(i.e.":[90,107],"=":[95,112],"O(k":[96],"logn)),":[97],"polynomial":[105],"poly(n)).":[113],"both":[115],"cases,":[116],"show":[118],"computationally":[123],"hard,":[124],"though":[125],"obtain":[127],"stronger":[128],"hardness":[129,136],"results":[130,137,144],"in":[131],"second":[133],"case.":[134],"Our":[135],"also":[138],"allow":[139],"us":[140],"derive":[142],"optimality":[143],"for":[145],"Multidimensional":[146],"Matching":[147],"Disjoint":[149],"-Subsets.":[151]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1558921963","counts_by_year":[],"updated_date":"2024-11-30T15:59:17.489063","created_date":"2016-06-24"}