{"id":"https://openalex.org/W2002101153","doi":"https://doi.org/10.1007/s00224-005-1256-9","title":"Solving the 2-Disjoint Paths Problem in Nearly Linear Time","display_name":"Solving the 2-Disjoint Paths Problem in Nearly Linear Time","publication_year":2005,"publication_date":"2005-11-08","ids":{"openalex":"https://openalex.org/W2002101153","doi":"https://doi.org/10.1007/s00224-005-1256-9","mag":"2002101153"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-005-1256-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-005-1256-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"Theory of Computing Systems","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/A5077112807","display_name":"Torsten Tholey","orcid":null},"institutions":[{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]},{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Torsten Tholey","raw_affiliation_strings":["Institut fur Informatik, Universitat Augsburg, D-86135 Augsburg, Germany","Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D\u201386135\u00a0Augsburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fur Informatik, Universitat Augsburg, D-86135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D\u201386135\u00a0Augsburg","institution_ids":["https://openalex.org/I119916105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077112807"],"corresponding_institution_ids":["https://openalex.org/I119916105","https://openalex.org/I179225836"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":0.9605,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.75886353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"39","issue":"1","first_page":"51","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9952999949455261,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/ackermann-function","display_name":"Ackermann function","score":0.8542532920837402},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8308743834495544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8032132387161255},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6094946265220642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5222376585006714},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4812174141407013},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4560125470161438},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4434782564640045},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37201404571533203},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.3136252462863922}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.8542532920837402},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8308743834495544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8032132387161255},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6094946265220642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222376585006714},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4812174141407013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4560125470161438},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4434782564640045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37201404571533203},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3136252462863922},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-005-1256-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-005-1256-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"Theory of Computing Systems","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":28,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W976211528","https://openalex.org/W1481806052","https://openalex.org/W1484490151","https://openalex.org/W1542390108","https://openalex.org/W1548164611","https://openalex.org/W1559624579","https://openalex.org/W1872961854","https://openalex.org/W1967565181","https://openalex.org/W1972515959","https://openalex.org/W1976285925","https://openalex.org/W1983754496","https://openalex.org/W1985521572","https://openalex.org/W1987374783","https://openalex.org/W1990201767","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2010031222","https://openalex.org/W2010142885","https://openalex.org/W2011245187","https://openalex.org/W2024366499","https://openalex.org/W2044146725","https://openalex.org/W2059563583","https://openalex.org/W2060632898","https://openalex.org/W2060765530","https://openalex.org/W2155061423","https://openalex.org/W2161714963","https://openalex.org/W2569646339"],"related_works":["https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W4388435768","https://openalex.org/W2756792282","https://openalex.org/W2756744637","https://openalex.org/W3216309640","https://openalex.org/W2759493398","https://openalex.org/W2584763881","https://openalex.org/W1543260365","https://openalex.org/W1447961680"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}