{"id":"https://openalex.org/W2961347594","doi":"https://doi.org/10.1007/978-3-030-25005-8_5","title":"Algorithm and Hardness Results on Liar\u2019s Dominating Set and $$\\varvec{k}$$-tuple Dominating Set","display_name":"Algorithm and Hardness Results on Liar\u2019s Dominating Set and $$\\varvec{k}$$-tuple Dominating Set","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2961347594","doi":"https://doi.org/10.1007/978-3-030-25005-8_5","mag":"2961347594"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-25005-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-25005-8_5","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/A5101600345","display_name":"Sandip Banerjee","orcid":"https://orcid.org/0000-0003-4558-8779"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sandip Banerjee","raw_affiliation_strings":["Department of Computer Science, Hebrew University of Jerusalem, Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072487585","display_name":"Sujoy Bhore","orcid":"https://orcid.org/0000-0003-0104-1659"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Sujoy Bhore","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072487585"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4716,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82072404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"48","last_page":"60"},"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.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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.9987999796867371,"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.9106520414352417},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7488751411437988},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7097601294517517},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6914889812469482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.672119677066803},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.5874217748641968},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5756229162216187},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.5023672580718994},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46123623847961426},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.43974077701568604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4305305480957031},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4217143952846527},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41053104400634766},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.0917244553565979},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.061072349548339844}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.9106520414352417},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7488751411437988},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7097601294517517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6914889812469482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.672119677066803},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5874217748641968},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5756229162216187},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.5023672580718994},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46123623847961426},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.43974077701568604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4305305480957031},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4217143952846527},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41053104400634766},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0917244553565979},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.061072349548339844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-25005-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-25005-8_5","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W174616216","https://openalex.org/W1493071618","https://openalex.org/W1545816435","https://openalex.org/W1551836270","https://openalex.org/W1980243423","https://openalex.org/W1983805335","https://openalex.org/W2017926358","https://openalex.org/W2032081889","https://openalex.org/W2033877075","https://openalex.org/W2052665499","https://openalex.org/W2074106479","https://openalex.org/W2142455346","https://openalex.org/W2340787257","https://openalex.org/W2809751089","https://openalex.org/W2913409262","https://openalex.org/W2961347594","https://openalex.org/W4240607287"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W2907170473","https://openalex.org/W3164644441","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2991587872","https://openalex.org/W3118753906","https://openalex.org/W2561239406","https://openalex.org/W2954109725"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}