{"id":"https://openalex.org/W2124046904","doi":"https://doi.org/10.1007/11847250_12","title":"An Exact Algorithm for the Minimum Dominating Clique Problem","display_name":"An Exact Algorithm for the Minimum Dominating Clique Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2124046904","doi":"https://doi.org/10.1007/11847250_12","mag":"2124046904"},"language":"en","primary_location":{"id":"doi:10.1007/11847250_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11847250_12","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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"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/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France","LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France","institution_ids":["https://openalex.org/I4210148061"]},{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France#TAB#","institution_ids":["https://openalex.org/I4210148061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070492372","display_name":"Mathieu Liedloff","orcid":"https://orcid.org/0000-0003-2518-606X"},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France","LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France","institution_ids":["https://openalex.org/I4210148061"]},{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, Metz, France#TAB#","institution_ids":["https://openalex.org/I4210148061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109894460"],"corresponding_institution_ids":["https://openalex.org/I4210148061"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17804632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"130","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9940999746322632,"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/dominating-set","display_name":"Dominating set","score":0.8130266666412354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6507753133773804},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6373167037963867},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5475616455078125},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5142033100128174},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.510749101638794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4941120445728302},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4748654365539551},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.44183388352394104},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4310660660266876},{"id":"https://openalex.org/keywords/simplex-graph","display_name":"Simplex graph","score":0.42643916606903076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4233025014400482},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3711477518081665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3645515441894531},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17108580470085144},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12243413925170898},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09287762641906738},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.04614675045013428}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.8130266666412354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6507753133773804},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6373167037963867},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5475616455078125},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5142033100128174},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.510749101638794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4941120445728302},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4748654365539551},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.44183388352394104},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4310660660266876},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.42643916606903076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4233025014400482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3711477518081665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3645515441894531},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17108580470085144},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12243413925170898},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09287762641906738},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.04614675045013428}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11847250_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11847250_12","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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00460727v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00460727","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IWPEC'2006 : 2nd International Workshop on Parameterized and Exact Computation, Sep 2006, Z\u00fcrich, Switzerland. pp.130-141, ⟨10.1007/11847250_12⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W173980447","https://openalex.org/W301099071","https://openalex.org/W1493071618","https://openalex.org/W1563108031","https://openalex.org/W1581552469","https://openalex.org/W1581812120","https://openalex.org/W1582963151","https://openalex.org/W1584965761","https://openalex.org/W1593916827","https://openalex.org/W1969186119","https://openalex.org/W1985573889","https://openalex.org/W1999216089","https://openalex.org/W2007200873","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2013568176","https://openalex.org/W2073025989","https://openalex.org/W2096495231","https://openalex.org/W2097844290","https://openalex.org/W2107351840","https://openalex.org/W2119774304","https://openalex.org/W2127390687","https://openalex.org/W2561675875","https://openalex.org/W4285719527","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2091356038","https://openalex.org/W1783742161","https://openalex.org/W2085971773","https://openalex.org/W2098381534","https://openalex.org/W2219991221","https://openalex.org/W2019546243","https://openalex.org/W2186006531","https://openalex.org/W4386955575","https://openalex.org/W2544657472","https://openalex.org/W154317836"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}