{"id":"https://openalex.org/W2144795927","doi":"https://doi.org/10.1016/0020-0190(93)90117-r","title":"Finding a maximum matching in a circular-arc graph","display_name":"Finding a maximum matching in a circular-arc graph","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2144795927","doi":"https://doi.org/10.1016/0020-0190(93)90117-r","mag":"2144795927"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(93)90117-r","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(93)90117-r","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/A5103229709","display_name":"Y. Daniel Liang","orcid":"https://orcid.org/0009-0007-0331-9622"},"institutions":[{"id":"https://openalex.org/I162817326","display_name":"Indiana University \u2013 Purdue University Fort Wayne","ror":"https://ror.org/01jxzq227","country_code":"US","type":"education","lineage":["https://openalex.org/I162817326"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y.Daniel Liang","raw_affiliation_strings":["Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA","institution_ids":["https://openalex.org/I162817326"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063302999","display_name":"Chongkye Rhee","orcid":null},"institutions":[{"id":"https://openalex.org/I110325482","display_name":"Eastern Kentucky University","ror":"https://ror.org/012xks909","country_code":"US","type":"education","lineage":["https://openalex.org/I110325482"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chongkye Rhee","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA","Department of Mathematics, Statistics and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA","institution_ids":["https://openalex.org/I110325482"]},{"raw_affiliation_string":"Department of Mathematics, Statistics and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA","institution_ids":["https://openalex.org/I110325482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063302999","https://openalex.org/A5103229709"],"corresponding_institution_ids":["https://openalex.org/I110325482","https://openalex.org/I162817326"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5231,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.68959655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"45","issue":"4","first_page":"185","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9951000213623047,"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.9951000213623047,"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.989799976348877,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6130655407905579},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6044340133666992},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.581303060054779},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.540067195892334},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5096690654754639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.486085444688797},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.47048380970954895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4126521944999695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4086032807826996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3525354266166687},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.20885193347930908},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.104047030210495},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07360014319419861}],"concepts":[{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6130655407905579},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6044340133666992},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.581303060054779},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.540067195892334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5096690654754639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.486085444688797},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.47048380970954895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4126521944999695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4086032807826996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3525354266166687},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.20885193347930908},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.104047030210495},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07360014319419861}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(93)90117-r","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(93)90117-r","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W33801284","https://openalex.org/W205453288","https://openalex.org/W1863569021","https://openalex.org/W2003813631","https://openalex.org/W2048652909","https://openalex.org/W2059608229","https://openalex.org/W2088199596","https://openalex.org/W2157529519","https://openalex.org/W4233756358","https://openalex.org/W6601419542","https://openalex.org/W6639307266","https://openalex.org/W6672629172"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2371352078","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W4382724515","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2349908314","https://openalex.org/W2366714142"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}