{"id":"https://openalex.org/W1519450118","doi":"https://doi.org/10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","display_name":"Roman Domination over Some Graph Classes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1519450118","doi":"https://doi.org/10.1007/11604686_10","mag":"1519450118"},"language":"en","primary_location":{"id":"doi:10.1007/11604686_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_10","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/A5070492372","display_name":"Mathieu Liedloff","orcid":"https://orcid.org/0000-0003-2518-606X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049113552","display_name":"Ton Kloks","orcid":"https://orcid.org/0000-0001-8825-3464"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ton Kloks","raw_affiliation_strings":["Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109448683","display_name":"Jiping Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jiping Liu","raw_affiliation_strings":["Department of Mathematics and Computer Science, The university of Lethbridge, Alberta, T1K 3M4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The university of Lethbridge, Alberta, T1K 3M4, Canada","institution_ids":["https://openalex.org/I107949126"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025918292","display_name":"Sheng\u2010Lung Peng","orcid":"https://orcid.org/0000-0002-9484-6677"},"institutions":[{"id":"https://openalex.org/I33096239","display_name":"National Dong Hwa University","ror":"https://ror.org/00mng9617","country_code":"TW","type":"education","lineage":["https://openalex.org/I33096239"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Sheng-Lung Peng","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan, R.O.C","institution_ids":["https://openalex.org/I33096239"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070492372"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5573,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.66007114,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"114"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9908999800682068,"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.7325797080993652},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6940674185752869},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.6868330240249634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5994068384170532},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.559744119644165},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5316942930221558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5213543176651001},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4901931881904602},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4693357050418854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37435996532440186},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17044851183891296},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1495390236377716}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7325797080993652},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6940674185752869},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.6868330240249634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5994068384170532},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.559744119644165},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5316942930221558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5213543176651001},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4901931881904602},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4693357050418854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37435996532440186},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17044851183891296},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1495390236377716}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11604686_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_10","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-00460691v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00460691","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":"WG'2005 : 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2005, Metz, France. pp.103-114, ⟨10.1007/11604686_10⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.46000000834465027,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1577883397","https://openalex.org/W1579049696","https://openalex.org/W1956427314","https://openalex.org/W1970088964","https://openalex.org/W1984228559","https://openalex.org/W2058946695","https://openalex.org/W2064544350","https://openalex.org/W2070838692","https://openalex.org/W2087928776","https://openalex.org/W2090249824","https://openalex.org/W2093541896","https://openalex.org/W2139312684","https://openalex.org/W2143474538","https://openalex.org/W2154503348","https://openalex.org/W2171760878","https://openalex.org/W2320198223","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W2963404550","https://openalex.org/W2794522194","https://openalex.org/W2984335350","https://openalex.org/W1123717642","https://openalex.org/W3217516113","https://openalex.org/W4226354266","https://openalex.org/W2736530170","https://openalex.org/W4313020364","https://openalex.org/W2034961945","https://openalex.org/W2762120601"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}