{"id":"https://openalex.org/W7160907688","doi":"https://doi.org/10.1016/j.disopt.2026.100955","title":"Vertex packing linear programs and critical independent sets","display_name":"Vertex packing linear programs and critical independent sets","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7160907688","doi":"https://doi.org/10.1016/j.disopt.2026.100955"},"language":"en","primary_location":{"id":"doi:10.1016/j.disopt.2026.100955","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.disopt.2026.100955","pdf_url":null,"source":{"id":"https://openalex.org/S203549655","display_name":"Discrete Optimization","issn_l":"1572-5286","issn":["1572-5286","1873-636X"],"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":"Discrete Optimization","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/A5135964569","display_name":"C.E. Larson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C.E. Larson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5135964569"],"corresponding_institution_ids":[],"apc_list":{"value":2560,"currency":"USD","value_usd":2560},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94523077,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"61","issue":null,"first_page":"100955","last_page":"100955"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.24480000138282776,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.24480000138282776,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.11919999867677689,"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.06419999897480011,"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/vertex","display_name":"Vertex (graph theory)","score":0.5680000185966492},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.49399998784065247},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3968000113964081},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.38989999890327454},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.3125}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6894999742507935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6200000047683716},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5680000185966492},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.49399998784065247},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36230000853538513},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.3125},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2712000012397766},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2653000056743622}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.disopt.2026.100955","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.disopt.2026.100955","pdf_url":null,"source":{"id":"https://openalex.org/S203549655","display_name":"Discrete Optimization","issn_l":"1572-5286","issn":["1572-5286","1873-636X"],"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":"Discrete Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1908129778","https://openalex.org/W1964492612","https://openalex.org/W1970607766","https://openalex.org/W1992428442","https://openalex.org/W2005982472","https://openalex.org/W2013415302","https://openalex.org/W2054991375","https://openalex.org/W2067215932","https://openalex.org/W2082992040","https://openalex.org/W2103112216","https://openalex.org/W2577602414","https://openalex.org/W4233756358"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-05-13T06:11:35.469786","created_date":"2026-05-13T00:00:00"}