{"id":"https://openalex.org/W1512871835","doi":"https://doi.org/10.1007/11785293_16","title":"Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes","display_name":"Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1512871835","doi":"https://doi.org/10.1007/11785293_16","mag":"1512871835"},"language":"en","primary_location":{"id":"doi:10.1007/11785293_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11785293_16","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":"middle","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["LITA, Universit\u00e9 de Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 de Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070492372","display_name":"Mathieu Liedloff","orcid":"https://orcid.org/0000-0003-2518-606X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["LITA, Universit\u00e9 de Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 de Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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":2.0843,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84974824,"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":"148","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/chordal-graph","display_name":"Chordal graph","score":0.8661794066429138},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.704414963722229},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6498064994812012},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5735569000244141},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5613763928413391},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5433195233345032},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.512150764465332},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4772077202796936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4749703109264374},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.47284772992134094},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4268672466278076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4238811433315277},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41236746311187744},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.41026610136032104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40498512983322144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3443080186843872},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1650373935699463},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1349940299987793},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06441593170166016}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8661794066429138},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.704414963722229},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6498064994812012},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5735569000244141},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5613763928413391},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5433195233345032},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.512150764465332},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4772077202796936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4749703109264374},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.47284772992134094},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4268672466278076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4238811433315277},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41236746311187744},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.41026610136032104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40498512983322144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3443080186843872},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1650373935699463},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1349940299987793},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06441593170166016},{"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":6,"locations":[{"id":"doi:10.1007/11785293_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11785293_16","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:CiteSeerX.psu:10.1.1.117.7343","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.7343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/swat06.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.168.5930","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dim.uchile.cl/%7Esgaspers/papers/Swat2006.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.168.6854","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.6854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dim.uchile.cl/%7Esgaspers/papers/DSGraphClasses.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.2947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/mindomclass.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00460694v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00460694","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":"SWAT'2006 : 10th Scandinavian Workshop on Algorithm Theory, Jul 2006, Riga, Latvia. pp.148-159, ⟨10.1007/11785293_16⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1537447662","https://openalex.org/W1579049696","https://openalex.org/W1582963151","https://openalex.org/W1593916827","https://openalex.org/W1983156760","https://openalex.org/W1984394682","https://openalex.org/W1999216089","https://openalex.org/W2029448190","https://openalex.org/W2054643041","https://openalex.org/W2073279057","https://openalex.org/W2075840509","https://openalex.org/W2096495231","https://openalex.org/W2117657015","https://openalex.org/W2127390687","https://openalex.org/W2143474538","https://openalex.org/W2163718580","https://openalex.org/W2170702810","https://openalex.org/W2320198223","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W2903402681","https://openalex.org/W2117608641","https://openalex.org/W1681620790","https://openalex.org/W4298846841","https://openalex.org/W2952658105","https://openalex.org/W645031676","https://openalex.org/W4283803822","https://openalex.org/W2157783000"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}