{"id":"https://openalex.org/W4324009754","doi":"https://doi.org/10.1007/978-3-031-27051-2_29","title":"Roman k-Domination: Hardness, Approximation and\u00a0Parameterized Results","display_name":"Roman k-Domination: Hardness, Approximation and\u00a0Parameterized Results","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4324009754","doi":"https://doi.org/10.1007/978-3-031-27051-2_29"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-27051-2_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-27051-2_29","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/A5082281894","display_name":"A. Mohanapriya","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"A. Mohanapriya","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, India","institution_ids":["https://openalex.org/I39244652"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040581684","display_name":"P. Renjith","orcid":null},"institutions":[{"id":"https://openalex.org/I114845381","display_name":"National Institute of Technology Calicut","ror":"https://ror.org/03yyd7552","country_code":"IN","type":"education","lineage":["https://openalex.org/I114845381"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Renjith","raw_affiliation_strings":["National Institute of Technology, Calicut, Kozhikode, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Technology, Calicut, Kozhikode, India","institution_ids":["https://openalex.org/I114845381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075479783","display_name":"N. Sadagopan","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Sadagopan","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, India","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082281894"],"corresponding_institution_ids":["https://openalex.org/I39244652"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8309,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.88699834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T12288","display_name":"Optimization and Search Problems","score":0.9912999868392944,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8064305782318115},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8052517175674438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7520686388015747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.550645112991333},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4864461421966553},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.48181644082069397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4484798312187195},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43604645133018494},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.42446836829185486},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41360530257225037},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.41137826442718506},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4085002541542053},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.25854772329330444},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12743866443634033},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1134844422340393}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8064305782318115},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8052517175674438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7520686388015747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.550645112991333},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4864461421966553},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.48181644082069397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4484798312187195},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43604645133018494},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.42446836829185486},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41360530257225037},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.41137826442718506},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4085002541542053},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25854772329330444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12743866443634033},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1134844422340393},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-27051-2_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-27051-2_29","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1519450118","https://openalex.org/W1557513888","https://openalex.org/W1963724532","https://openalex.org/W1984228559","https://openalex.org/W2028333952","https://openalex.org/W2143996311","https://openalex.org/W2346913169","https://openalex.org/W2744781146","https://openalex.org/W3016425788","https://openalex.org/W3128085997","https://openalex.org/W3157752031"],"related_works":["https://openalex.org/W4385327816","https://openalex.org/W2061237693","https://openalex.org/W3139101777","https://openalex.org/W4220852510","https://openalex.org/W2083238533","https://openalex.org/W1964113132","https://openalex.org/W4302405066","https://openalex.org/W2949743119","https://openalex.org/W2788975631","https://openalex.org/W2046834193"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}