{"id":"https://openalex.org/W1969151326","doi":"https://doi.org/10.1016/j.jda.2011.03.006","title":"An exact algorithm for connected red\u2013blue dominating set","display_name":"An exact algorithm for connected red\u2013blue dominating set","publication_year":2011,"publication_date":"2011-04-14","ids":{"openalex":"https://openalex.org/W1969151326","doi":"https://doi.org/10.1016/j.jda.2011.03.006","mag":"1969151326"},"language":"en","primary_location":{"id":"doi:10.1016/j.jda.2011.03.006","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jda.2011.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Discrete Algorithms","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/A5090561191","display_name":"Faisal N. Abu-Khzam","orcid":"https://orcid.org/0000-0001-5221-8421"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Faisal N. Abu-Khzam","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","institution_ids":["https://openalex.org/I56306041"]},{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon,","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051065386","display_name":"Amer E. Mouawad","orcid":"https://orcid.org/0000-0003-2481-4968"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Amer E. Mouawad","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon","institution_ids":["https://openalex.org/I56306041"]},{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon,","institution_ids":["https://openalex.org/I56306041"]}]},{"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/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]},{"id":"https://openalex.org/I4210096842","display_name":"Fondation FondaMental","ror":"https://ror.org/00rrhf939","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210096842"]},{"id":"https://openalex.org/I4387153997","display_name":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans","ror":"https://ror.org/01nr3td38","country_code":null,"type":"facility","lineage":["https://openalex.org/I12449238","https://openalex.org/I4210143826","https://openalex.org/I4387153997"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["Laboratoire d\u02bcInformatique Fondamentale d\u02bcOrl\u00e9ans, Universit\u00e9 d\u02bcOrl\u00e9ans, 45067 Orl\u00e9ans Cedex 2, France","Laboratoire dInformatique Fondamentale dOrl\u00e9ans, Universit\u00e9 dOrl\u00e9ans, 45067 Orl\u00e9ans Cedex 2, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u02bcInformatique Fondamentale d\u02bcOrl\u00e9ans, Universit\u00e9 d\u02bcOrl\u00e9ans, 45067 Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238","https://openalex.org/I4210096842"]},{"raw_affiliation_string":"Laboratoire dInformatique Fondamentale dOrl\u00e9ans, Universit\u00e9 dOrl\u00e9ans, 45067 Orl\u00e9ans Cedex 2, France#TAB#","institution_ids":["https://openalex.org/I12449238","https://openalex.org/I4387153997"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090561191"],"corresponding_institution_ids":["https://openalex.org/I56306041"],"apc_list":{"value":2400,"currency":"USD","value_usd":2400},"apc_paid":null,"fwci":0.5932,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.66639326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"3","first_page":"252","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9883000254631042,"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.9369000196456909,"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/vertex","display_name":"Vertex (graph theory)","score":0.7100421786308289},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6745047569274902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6056935787200928},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6017151474952698},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6015265583992004},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5353674292564392},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5058267116546631},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4793980121612549},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46094071865081787},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4300302267074585},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41295111179351807},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36501628160476685},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27592259645462036}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7100421786308289},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6745047569274902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6056935787200928},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6017151474952698},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6015265583992004},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5353674292564392},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5058267116546631},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4793980121612549},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46094071865081787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4300302267074585},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41295111179351807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36501628160476685},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27592259645462036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.jda.2011.03.006","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jda.2011.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Discrete Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00607125v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00607125","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":"Journal of Discrete Algorithms, 2011, 9 (3), pp.252-262. ⟨10.1016/j.jda.2011.03.006⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W272087405","https://openalex.org/W1534129599","https://openalex.org/W1593947471","https://openalex.org/W1666834859","https://openalex.org/W1850475437","https://openalex.org/W1963871092","https://openalex.org/W2011039300","https://openalex.org/W2040813792","https://openalex.org/W2045326192","https://openalex.org/W2069643240","https://openalex.org/W2125065856","https://openalex.org/W2127390687","https://openalex.org/W2133106928","https://openalex.org/W2261904201","https://openalex.org/W2535182880","https://openalex.org/W3121437753","https://openalex.org/W6609951575","https://openalex.org/W6631901709","https://openalex.org/W6635663034","https://openalex.org/W6638930044","https://openalex.org/W6678496407"],"related_works":["https://openalex.org/W2937242299","https://openalex.org/W3127652808","https://openalex.org/W2021517364","https://openalex.org/W1934761836","https://openalex.org/W2174077876","https://openalex.org/W1511480398","https://openalex.org/W4236913080","https://openalex.org/W2078908984","https://openalex.org/W4242473996","https://openalex.org/W3187836939"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}