{"id":"https://openalex.org/W4285243628","doi":"https://doi.org/10.1007/978-3-031-06678-8_7","title":"Faster Algorithm for\u00a0Finding Maximum 1-Restricted Simple 2-Matchings","display_name":"Faster Algorithm for\u00a0Finding Maximum 1-Restricted Simple 2-Matchings","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285243628","doi":"https://doi.org/10.1007/978-3-031-06678-8_7"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-06678-8_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06678-8_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5082077643","display_name":"Stepan Artamonov","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Stepan Artamonov","raw_affiliation_strings":["Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037511746","display_name":"Maxim A. Babenko","orcid":null},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I58957048","display_name":"Yandex (Russia)","ror":"https://ror.org/04dbch786","country_code":"RU","type":"company","lineage":["https://openalex.org/I58957048"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Maxim A. Babenko","raw_affiliation_strings":["National Research University Higher School of Economics (HSE), Yandex LLC, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"National Research University Higher School of Economics (HSE), Yandex LLC, Moscow, Russia","institution_ids":["https://openalex.org/I118501908","https://openalex.org/I58957048"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037511746"],"corresponding_institution_ids":["https://openalex.org/I118501908","https://openalex.org/I58957048"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3276,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.80475873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"86","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9937000274658203,"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.9926999807357788,"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.8348706960678101},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7730766534805298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6514602899551392},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6438610553741455},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6344236731529236},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6270145177841187},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.57729572057724},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5437307953834534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4617709219455719},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.46095895767211914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4565122127532959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44164973497390747},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4250434637069702},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15695565938949585}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8348706960678101},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7730766534805298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6514602899551392},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6438610553741455},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6344236731529236},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6270145177841187},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.57729572057724},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5437307953834534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4617709219455719},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.46095895767211914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4565122127532959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44164973497390747},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4250434637069702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15695565938949585},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-06678-8_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06678-8_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1501191738","https://openalex.org/W2130257319","https://openalex.org/W2157529519"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W132109778","https://openalex.org/W1989984537","https://openalex.org/W2499670206","https://openalex.org/W2953390393","https://openalex.org/W3103034549","https://openalex.org/W4299980042","https://openalex.org/W122598894","https://openalex.org/W2797827892","https://openalex.org/W2951748403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}