{"id":"https://openalex.org/W1581812120","doi":"https://doi.org/10.1007/11917496_8","title":"A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs","display_name":"A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1581812120","doi":"https://doi.org/10.1007/11917496_8","mag":"1581812120"},"language":"en","primary_location":{"id":"doi:10.1007/11917496_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11917496_8","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/A5048738368","display_name":"Serge Gaspers","orcid":"https://orcid.org/0000-0002-6947-9238"},"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"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Serge Gaspers","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"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/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul, Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul, Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul, Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":["https://openalex.org/I4210161954"]},{"raw_affiliation_string":"Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul, Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048738368"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3471,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.91740532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"78","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9923999905586243,"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.9793999791145325,"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/combinatorics","display_name":"Combinatorics","score":0.8170647025108337},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7414228916168213},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6955980062484741},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6696370244026184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5541518926620483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5097086429595947},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.48264867067337036},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.45238494873046875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4011506736278534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3325446844100952},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12399652600288391},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10218486189842224}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8170647025108337},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7414228916168213},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6955980062484741},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6696370244026184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5541518926620483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5097086429595947},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.48264867067337036},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.45238494873046875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4011506736278534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3325446844100952},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12399652600288391},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10218486189842224},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11917496_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11917496_8","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-00460733v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00460733","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":"WG'2006 : 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2006, Bergen, Norway. pp.78-89, ⟨10.1007/11917496_8⟩","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":23,"referenced_works":["https://openalex.org/W1483891445","https://openalex.org/W1512871835","https://openalex.org/W1516574938","https://openalex.org/W1582963151","https://openalex.org/W1593916827","https://openalex.org/W1804016314","https://openalex.org/W1976422444","https://openalex.org/W1999216089","https://openalex.org/W2006278018","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2013568176","https://openalex.org/W2033410225","https://openalex.org/W2037637265","https://openalex.org/W2044531679","https://openalex.org/W2054643041","https://openalex.org/W2073025989","https://openalex.org/W2096495231","https://openalex.org/W2097844290","https://openalex.org/W2099474653","https://openalex.org/W2127390687","https://openalex.org/W2154520530","https://openalex.org/W4251769540"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W3164644441","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2991587872","https://openalex.org/W3004945501","https://openalex.org/W3118753906","https://openalex.org/W2561239406","https://openalex.org/W2907170473"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}