{"id":"https://openalex.org/W2277497915","doi":"https://doi.org/10.1007/s00453-008-9204-0","title":"Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs","display_name":"Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs","publication_year":2008,"publication_date":"2008-07-02","ids":{"openalex":"https://openalex.org/W2277497915","doi":"https://doi.org/10.1007/s00453-008-9204-0","mag":"2277497915"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9204-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9204-0","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Schools of Mathematics and Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel"],"affiliations":[{"raw_affiliation_string":"Schools of Mathematics and Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025279118","display_name":"Shai Gutner","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shai Gutner","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025279118"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.7159,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.93240672,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"54","issue":"4","first_page":"544","last_page":"556"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9979000091552734,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.749481201171875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6568381786346436},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6300963163375854},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5640424489974976},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5461536049842834},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5056359767913818},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48960477113723755},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4641246795654297},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.46261078119277954},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4608921408653259},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.457922101020813},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.41903793811798096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41153275966644287},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.38308876752853394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3798583745956421},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1506587564945221},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.09555289149284363}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.749481201171875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6568381786346436},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6300963163375854},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5640424489974976},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5461536049842834},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5056359767913818},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48960477113723755},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4641246795654297},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.46261078119277954},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4608921408653259},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.457922101020813},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41903793811798096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41153275966644287},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.38308876752853394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3798583745956421},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1506587564945221},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.09555289149284363}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-008-9204-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9204-0","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1484040084","https://openalex.org/W1570425181","https://openalex.org/W1967066104","https://openalex.org/W1983156760","https://openalex.org/W1991858502","https://openalex.org/W1992185324","https://openalex.org/W2007069176","https://openalex.org/W2047993669","https://openalex.org/W2075457919","https://openalex.org/W2079313211","https://openalex.org/W2084389562","https://openalex.org/W2087088044","https://openalex.org/W2093825995","https://openalex.org/W2109542562","https://openalex.org/W2128203754","https://openalex.org/W2129939288","https://openalex.org/W2131676402","https://openalex.org/W2144809360","https://openalex.org/W2151438396","https://openalex.org/W2158584754","https://openalex.org/W2170758948","https://openalex.org/W2296148711","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W3039948875","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W2907170473","https://openalex.org/W3164644441","https://openalex.org/W1537543462","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2898526288","https://openalex.org/W2607123191","https://openalex.org/W4286287454"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}