{"id":"https://openalex.org/W4220933049","doi":"https://doi.org/10.1007/s00453-022-00953-9","title":"On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number","display_name":"On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number","publication_year":2022,"publication_date":"2022-03-22","ids":{"openalex":"https://openalex.org/W4220933049","doi":"https://doi.org/10.1007/s00453-022-00953-9"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-00953-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-022-00953-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/50d364c0-4637-4f5c-ba30-65fda08601e3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078079078","display_name":"Jean R. S. Blair","orcid":"https://orcid.org/0000-0001-7176-6730"},"institutions":[{"id":"https://openalex.org/I192545095","display_name":"United States Military Academy","ror":"https://ror.org/01jepya76","country_code":"US","type":"education","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I192545095","https://openalex.org/I4210088792"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean R. S. Blair","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, United States Military Academy, West Point, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, United States Military Academy, West Point, New York, USA","institution_ids":["https://openalex.org/I192545095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022828497","display_name":"Pinar Heggernes","orcid":"https://orcid.org/0000-0001-9460-4355"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Pinar Heggernes","raw_affiliation_strings":["Department of Computer Science, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091558578","display_name":"Paloma T. Lima","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Paloma T. Lima","raw_affiliation_strings":["Department of Computer Science, IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Computer Science, University of California, Santa, Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa, Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091558578"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2874,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55266544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"84","issue":"12","first_page":"3587","last_page":"3602"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T12541","display_name":"Graph Labeling and Dimension Problems","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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7967535257339478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7870701551437378},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7686619758605957},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7243716716766357},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7192386388778687},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6735247373580933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5324351191520691},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5284528732299805},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.48687687516212463},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4296974241733551},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.429298996925354},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2695491909980774},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21777454018592834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1630878448486328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13116133213043213},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12353810667991638},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08661466836929321}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7967535257339478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7870701551437378},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7686619758605957},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7243716716766357},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7192386388778687},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6735247373580933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5324351191520691},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5284528732299805},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.48687687516212463},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4296974241733551},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.429298996925354},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2695491909980774},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21777454018592834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1630878448486328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13116133213043213},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12353810667991638},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08661466836929321},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-022-00953-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-022-00953-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/50d364c0-4637-4f5c-ba30-65fda08601e3","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/50d364c0-4637-4f5c-ba30-65fda08601e3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blair, J, Heggernes, P, Thom\u00e9 de Lima, P & Lokshtanov, D 2022, 'On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number', Algorithmica. https://doi.org/10.1007/s00453-022-00953-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/50d364c0-4637-4f5c-ba30-65fda08601e3","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/50d364c0-4637-4f5c-ba30-65fda08601e3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blair, J, Heggernes, P, Thom\u00e9 de Lima, P & Lokshtanov, D 2022, 'On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number', Algorithmica. https://doi.org/10.1007/s00453-022-00953-9","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W87964322","https://openalex.org/W1537447662","https://openalex.org/W1973595346","https://openalex.org/W1978452004","https://openalex.org/W2022795828","https://openalex.org/W2089465933","https://openalex.org/W2102669784","https://openalex.org/W2143550124","https://openalex.org/W2587214001","https://openalex.org/W2907565004","https://openalex.org/W3107297658"],"related_works":["https://openalex.org/W1555816812","https://openalex.org/W1480846237","https://openalex.org/W239742334","https://openalex.org/W3037533092","https://openalex.org/W4412133525","https://openalex.org/W2088441646","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W4376851474","https://openalex.org/W4406927686"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}