Publication Information

{'id': 'https://openalex.org/W2963418598', 'doi': None, 'title': 'Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.', 'display_name': 'Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.', 'publication_year': 2018, 'publication_date': '2018-03-01', 'ids': {'openalex': 'https://openalex.org/W2963418598', 'mag': '2963418598'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.4230/LIPIcs.IPEC.2018.6', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5039626432', 'display_name': 'Lars Jaffke', 'orcid': 'https://orcid.org/0000-0003-4856-5863'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Lars Jaffke', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5041792622', 'display_name': 'O‐joung Kwon', 'orcid': 'https://orcid.org/0000-0003-1820-1962'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'O-joung Kwon', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5057918982', 'display_name': 'Torstein J. F. Strømme', 'orcid': 'https://orcid.org/0000-0002-3896-3166'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Torstein J. F. Strømme', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5019858728', 'display_name': 'Jan Arne Telle', 'orcid': 'https://orcid.org/0000-0002-9429-5377'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Jan Arne Telle', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.19, 'has_fulltext': False, 'cited_by_count': 3, 'citation_normalized_percentile': {'value': 0.4052, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 75, 'max': 77}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9989, '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': 'Graph Theory and Algorithms', 'score': 0.9989, '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/T11329', 'display_name': 'Limits and Structures in Graph Theory', 'score': 0.9928, 'subfield': {'id': 'https://openalex.org/subfields/2607', 'display_name': 'Discrete Mathematics and Combinatorics'}, 'field': {'id': 'https://openalex.org/fields/26', 'display_name': 'Mathematics'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T10720', 'display_name': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9914, '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/indifference-graph', 'display_name': 'Indifference graph', 'score': 0.6627818}, {'id': 'https://openalex.org/keywords/graph-limits', 'display_name': 'Graph Limits', 'score': 0.565437}, {'id': 'https://openalex.org/keywords/parameterized-complexity', 'display_name': 'Parameterized Complexity', 'score': 0.551321}, {'id': 'https://openalex.org/keywords/maximal-independent-set', 'display_name': 'Maximal independent set', 'score': 0.5375933}, {'id': 'https://openalex.org/keywords/constraint-satisfaction-problems', 'display_name': 'Constraint Satisfaction Problems', 'score': 0.536707}, {'id': 'https://openalex.org/keywords/interval-graph', 'display_name': 'Interval graph', 'score': 0.5275055}, {'id': 'https://openalex.org/keywords/hypergraphs', 'display_name': 'Hypergraphs', 'score': 0.525997}, {'id': 'https://openalex.org/keywords/treewidth', 'display_name': 'Treewidth', 'score': 0.5193185}, {'id': 'https://openalex.org/keywords/graph-algorithms', 'display_name': 'Graph Algorithms', 'score': 0.507382}, {'id': 'https://openalex.org/keywords/cograph', 'display_name': 'Cograph', 'score': 0.46675467}, {'id': 'https://openalex.org/keywords/dominating-set', 'display_name': 'Dominating set', 'score': 0.41446692}, {'id': 'https://openalex.org/keywords/modular-decomposition', 'display_name': 'Modular decomposition', 'score': 0.41213638}], 'concepts': [{'id': 'https://openalex.org/C160446614', 'wikidata': 'https://www.wikidata.org/wiki/Q1322892', 'display_name': 'Chordal graph', 'level': 3, 'score': 0.76798475}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.76607716}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.7568563}, {'id': 'https://openalex.org/C74133993', 'wikidata': 'https://www.wikidata.org/wiki/Q3115472', 'display_name': 'Indifference graph', 'level': 3, 'score': 0.6627818}, {'id': 'https://openalex.org/C165464430', 'wikidata': 'https://www.wikidata.org/wiki/Q1570441', 'display_name': 'Parameterized complexity', 'level': 2, 'score': 0.62137824}, {'id': 'https://openalex.org/C43517604', 'wikidata': 'https://www.wikidata.org/wiki/Q7144893', 'display_name': 'Pathwidth', 'level': 4, 'score': 0.5580847}, {'id': 'https://openalex.org/C34388435', 'wikidata': 'https://www.wikidata.org/wiki/Q2267362', 'display_name': 'Bounded function', 'level': 2, 'score': 0.5390837}, {'id': 'https://openalex.org/C18359143', 'wikidata': 'https://www.wikidata.org/wiki/Q7888149', 'display_name': 'Maximal independent set', 'level': 5, 'score': 0.5375933}, {'id': 'https://openalex.org/C67810366', 'wikidata': 'https://www.wikidata.org/wiki/Q835942', 'display_name': 'Interval graph', 'level': 5, 'score': 0.5275055}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.5233269}, {'id': 'https://openalex.org/C132569581', 'wikidata': 'https://www.wikidata.org/wiki/Q5067368', 'display_name': 'Treewidth', 'level': 5, 'score': 0.5193185}, {'id': 'https://openalex.org/C102192266', 'wikidata': 'https://www.wikidata.org/wiki/Q4545823', 'display_name': '1-planar graph', 'level': 4, 'score': 0.48413596}, {'id': 'https://openalex.org/C59824394', 'wikidata': 'https://www.wikidata.org/wiki/Q5141281', 'display_name': 'Cograph', 'level': 5, 'score': 0.46675467}, {'id': 'https://openalex.org/C42812', 'wikidata': 'https://www.wikidata.org/wiki/Q1082910', 'display_name': 'Partition (number theory)', 'level': 2, 'score': 0.424494}, {'id': 'https://openalex.org/C146661039', 'wikidata': 'https://www.wikidata.org/wiki/Q2915204', 'display_name': 'Dominating set', 'level': 4, 'score': 0.41446692}, {'id': 'https://openalex.org/C187407849', 'wikidata': 'https://www.wikidata.org/wiki/Q6889712', 'display_name': 'Modular decomposition', 'level': 5, 'score': 0.41213638}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.40607077}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.28844088}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.12475106}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.4230/LIPIcs.IPEC.2018.6', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3195265556', 'https://openalex.org/W3189810776', 'https://openalex.org/W3159014463', 'https://openalex.org/W3135451832', 'https://openalex.org/W3124209799', 'https://openalex.org/W3099519164', 'https://openalex.org/W2963838695', 'https://openalex.org/W2963355426', 'https://openalex.org/W2963089667', 'https://openalex.org/W2439127873', 'https://openalex.org/W2407435835', 'https://openalex.org/W2148842617', 'https://openalex.org/W2112212574', 'https://openalex.org/W2067653823', 'https://openalex.org/W2031276298', 'https://openalex.org/W2029854525', 'https://openalex.org/W1684832175', 'https://openalex.org/W1584902019', 'https://openalex.org/W1576051470', 'https://openalex.org/W110470963'], 'abstract_inverted_index': {'We': [0, 31], 'generalize': [1], 'the': [2, 41], 'family': [3], 'of': [4, 83, 101], '$(\\sigma,': [5, 103], '\\rho)$-problems': [6, 104], 'and': [7, 27, 45, 55, 69, 74, 86], 'locally': [8], 'checkable': [9], 'vertex': [10], 'partition': [11], 'problems': [12, 21, 36], 'to': [13], 'their': [14, 70, 75], 'distance': [15, 35], 'versions,': [16], 'which': [17], 'naturally': [18], 'captures': [19], 'well-known': [20], 'such': [22, 58], 'as': [23, 59], 'distance-$r$': [24, 28], 'dominating': [25], 'set': [26], 'independent': [29], 'set.': [30], 'show': [32, 97], 'that': [33, 98], 'these': [34, 94], 'are': [37, 105], 'XP': [38], 'parameterized': [39, 107], 'by': [40, 108], 'structural': [42], 'parameter': [43], 'mim-width,': [44], 'hence': [46], 'polynomial': [47], 'on': [48], 'graph': [49], 'classes': [50, 100], 'where': [51], 'mim-width': [52, 109], 'is': [53], 'bounded': [54], 'quickly': [56], 'computable,': [57], '$k$-trapezoid': [60], 'graphs,': [61, 66, 78, 81, 85], 'Dilworth': [62], '$k$-graphs,': [63], '(circular)': [64], 'permutation': [65], 'interval': [67], 'graphs': [68, 73], 'complements,': [71, 76], 'convex': [72], '$k$-polygon': [77], 'circular': [79], 'arc': [80], 'complements': [82], '$d$-degenerate': [84], '$H$-graphs': [87], 'if': [88], 'given': [89], 'an': [90], '$H$-representation.': [91], 'To': [92], 'supplement': [93], 'findings,': [95], 'we': [96], 'many': [99], '(distance)': [102], 'W[1]-hard': [106], '+': [110], 'solution': [111], 'size.': [112]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2963418598', 'counts_by_year': [{'year': 2022, 'cited_by_count': 1}, {'year': 2020, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 1}], 'updated_date': '2024-09-15T23:14:37.708636', 'created_date': '2019-07-30'}