{"id":"https://openalex.org/W3145782476","doi":"https://doi.org/10.1016/j.ipl.2021.106118","title":"Local linear set on graphs with bounded twin cover number","display_name":"Local linear set on graphs with bounded twin cover number","publication_year":2021,"publication_date":"2021-03-25","ids":{"openalex":"https://openalex.org/W3145782476","doi":"https://doi.org/10.1016/j.ipl.2021.106118","mag":"3145782476"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2021.106118","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2021.106118","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","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/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Dept. of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-2588-5709","affiliations":[{"raw_affiliation_string":"Dept. of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073361240"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.1448,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47857037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"170","issue":null,"first_page":"106118","last_page":"106118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9988999962806702,"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.9868000149726868,"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/vertex-cover","display_name":"Vertex cover","score":0.8888294100761414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6730015277862549},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6286674737930298},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.622571587562561},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6221903562545776},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5671550631523132},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5594435334205627},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5223099589347839},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4929373264312744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48962169885635376},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4579227864742279},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.44686877727508545},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4333629012107849},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4153994619846344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3553374409675598},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.28578370809555054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2280881404876709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1355503499507904}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8888294100761414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6730015277862549},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6286674737930298},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.622571587562561},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6221903562545776},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5671550631523132},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5594435334205627},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5223099589347839},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4929373264312744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48962169885635376},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4579227864742279},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.44686877727508545},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4333629012107849},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4153994619846344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3553374409675598},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28578370809555054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2280881404876709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1355503499507904},{"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},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ipl.2021.106118","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2021.106118","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1575669909","https://openalex.org/W2090960684","https://openalex.org/W2114616381","https://openalex.org/W2120400308","https://openalex.org/W2253794682","https://openalex.org/W2405126695","https://openalex.org/W2803178314","https://openalex.org/W2963606510","https://openalex.org/W2964090009","https://openalex.org/W2964238278","https://openalex.org/W2970673587","https://openalex.org/W2992820943","https://openalex.org/W3135932689","https://openalex.org/W3195771200","https://openalex.org/W4388372706","https://openalex.org/W6691929546","https://openalex.org/W6734042884","https://openalex.org/W6740304409","https://openalex.org/W6749015919","https://openalex.org/W6751583394","https://openalex.org/W6766779235"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W2063671489","https://openalex.org/W1966805076","https://openalex.org/W1502438505","https://openalex.org/W2077783414","https://openalex.org/W1498886170","https://openalex.org/W168093571","https://openalex.org/W1508327628"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}