{"id":"https://openalex.org/W3036445721","doi":"https://doi.org/10.1007/978-3-030-50026-9_7","title":"Faster 2-Disjoint-Shortest-Paths Algorithm","display_name":"Faster 2-Disjoint-Shortest-Paths Algorithm","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3036445721","doi":"https://doi.org/10.1007/978-3-030-50026-9_7","mag":"3036445721"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-50026-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-50026-9_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/A5008860190","display_name":"Maxim Akhmedov","orcid":"https://orcid.org/0000-0002-7947-1416"},"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"]},{"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 Akhmedov","raw_affiliation_strings":["Department of Mathematical Logic and Algorithms, Moscow State University, Moscow, Russia","Yandex LLC, Moscow, Russia"],"raw_orcid":"https://orcid.org/0000-0002-7947-1416","affiliations":[{"raw_affiliation_string":"Department of Mathematical Logic and Algorithms, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]},{"raw_affiliation_string":"Yandex LLC, Moscow, Russia","institution_ids":["https://openalex.org/I58957048"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008860190"],"corresponding_institution_ids":["https://openalex.org/I19880235","https://openalex.org/I58957048"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.603,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66988728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9973000288009644,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7558808326721191},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6974495053291321},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5959702730178833},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5201675891876221},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.49728110432624817},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4404796063899994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43306151032447815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4311046600341797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40329602360725403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39298775792121887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3591299057006836}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7558808326721191},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6974495053291321},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5959702730178833},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5201675891876221},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.49728110432624817},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4404796063899994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43306151032447815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4311046600341797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40329602360725403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39298775792121887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3591299057006836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-50026-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-50026-9_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":11,"referenced_works":["https://openalex.org/W65356316","https://openalex.org/W1996419691","https://openalex.org/W2016088388","https://openalex.org/W2038073775","https://openalex.org/W2060632898","https://openalex.org/W2151715608","https://openalex.org/W2569646339","https://openalex.org/W2787728049","https://openalex.org/W2809520557","https://openalex.org/W2962994666","https://openalex.org/W2963286134"],"related_works":["https://openalex.org/W4245395944","https://openalex.org/W2143551613","https://openalex.org/W1979740464","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2143345456","https://openalex.org/W2138823233","https://openalex.org/W2132777284","https://openalex.org/W1999473833","https://openalex.org/W2361081252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}