{"id":"https://openalex.org/W1977068662","doi":"https://doi.org/10.1007/s00453-011-9533-2","title":"An Exact Exponential Time Algorithm for Power Dominating Set","display_name":"An Exact Exponential Time Algorithm for Power Dominating Set","publication_year":2011,"publication_date":"2011-06-07","ids":{"openalex":"https://openalex.org/W1977068662","doi":"https://doi.org/10.1007/s00453-011-9533-2","mag":"1977068662"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-011-9533-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9533-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5084871383","display_name":"Daniel Binkele-Raible","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Binkele-Raible","raw_affiliation_strings":["FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Universit\u00e4t Trier, Trier, Germany","Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Trier, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Universit\u00e4t Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]},{"raw_affiliation_string":"Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Trier, Germany#TAB#","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015688812","display_name":"Henning Fernau","orcid":"https://orcid.org/0000-0002-4444-3220"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Fernau","raw_affiliation_strings":["FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Universit\u00e4t Trier, Trier, Germany","Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Trier, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Universit\u00e4t Trier, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]},{"raw_affiliation_string":"Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik/Wirtschaftsinformatik, Trier, Germany#TAB#","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084871383"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.9516,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85107481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"1-2","first_page":"323","last_page":"346"},"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.9980000257492065,"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.9697999954223633,"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.8961664438247681},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7270652055740356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6756657361984253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6532694697380066},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6391540765762329},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5671414732933044},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.535592794418335},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4927580654621124},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4818666875362396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47269514203071594},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.43302568793296814},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.4294106960296631},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4290398955345154},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42329296469688416},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4213525652885437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38696229457855225},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.30036166310310364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20480898022651672},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1915929615497589},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11636322736740112}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.8961664438247681},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7270652055740356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6756657361984253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6532694697380066},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6391540765762329},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5671414732933044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.535592794418335},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4927580654621124},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4818666875362396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47269514203071594},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.43302568793296814},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.4294106960296631},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4290398955345154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42329296469688416},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4213525652885437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38696229457855225},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30036166310310364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20480898022651672},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1915929615497589},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11636322736740112},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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":[{"id":"doi:10.1007/s00453-011-9533-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9533-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1488639514","https://openalex.org/W1506292197","https://openalex.org/W1582963151","https://openalex.org/W1666834859","https://openalex.org/W1833689605","https://openalex.org/W1880580445","https://openalex.org/W1967424311","https://openalex.org/W1973547296","https://openalex.org/W1976697697","https://openalex.org/W2001630194","https://openalex.org/W2012624063","https://openalex.org/W2015963099","https://openalex.org/W2020112047","https://openalex.org/W2023728975","https://openalex.org/W2039168577","https://openalex.org/W2040813792","https://openalex.org/W2044600597","https://openalex.org/W2045704027","https://openalex.org/W2069643240","https://openalex.org/W2073025989","https://openalex.org/W2089718638","https://openalex.org/W2103164681","https://openalex.org/W2133106928","https://openalex.org/W2136595209","https://openalex.org/W2211439443","https://openalex.org/W2399859260","https://openalex.org/W2499121576","https://openalex.org/W2899292663"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W2963404550","https://openalex.org/W1123717642","https://openalex.org/W2984335350","https://openalex.org/W2736530170","https://openalex.org/W3178466616","https://openalex.org/W2683281999","https://openalex.org/W2003716984","https://openalex.org/W2045704027","https://openalex.org/W2589488020"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}