{"id":"https://openalex.org/W1594618647","doi":"https://doi.org/10.1007/978-3-642-13073-1_4","title":"An Exact Algorithm for Connected Red-Blue Dominating Set","display_name":"An Exact Algorithm for Connected Red-Blue Dominating Set","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1594618647","doi":"https://doi.org/10.1007/978-3-642-13073-1_4","mag":"1594618647"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13073-1_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13073-1_4","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/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"],"affiliations":[{"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"],"affiliations":[{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["Laboratoire d\u2019Informatique Fondamentale d\u2019Orl\u00e9ans, Universit\u00e9 d\u2019Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans, Universit\u00e9 d'Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Fondamentale d\u2019Orl\u00e9ans, Universit\u00e9 d\u2019Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]},{"raw_affiliation_string":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans, Universit\u00e9 d'Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090561191"],"corresponding_institution_ids":["https://openalex.org/I56306041"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3662,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.61595628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9890000224113464,"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.9319000244140625,"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.7339478731155396},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.723008930683136},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.611802875995636},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5996729135513306},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.562523603439331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48244768381118774},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46866071224212646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43790191411972046},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42527955770492554},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41251397132873535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32418692111968994}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7339478731155396},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.723008930683136},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.611802875995636},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5996729135513306},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.562523603439331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48244768381118774},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46866071224212646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43790191411972046},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42527955770492554},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41251397132873535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32418692111968994}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-13073-1_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13073-1_4","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-00461066v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00461066","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":"CIAC'2010 : 7th International Conference on Algorithms and Complexity, May 2010, Rome, Italy. pp.25-36, ⟨10.1007/978-3-642-13073-1_4⟩","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":14,"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/W2069643240","https://openalex.org/W2103164681","https://openalex.org/W2125065856","https://openalex.org/W2133106928","https://openalex.org/W2143481064","https://openalex.org/W2535182880"],"related_works":["https://openalex.org/W2920849150","https://openalex.org/W1511480398","https://openalex.org/W2174077876","https://openalex.org/W2339534957","https://openalex.org/W1980648360","https://openalex.org/W4242473996","https://openalex.org/W1991925252","https://openalex.org/W2023302035","https://openalex.org/W2739849971","https://openalex.org/W3187836939"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}