{"id":"https://openalex.org/W2052100496","doi":"https://doi.org/10.1007/s004530010029","title":"A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs","display_name":"A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs","publication_year":2000,"publication_date":"2000-09-01","ids":{"openalex":"https://openalex.org/W2052100496","doi":"https://doi.org/10.1007/s004530010029","mag":"2052100496"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010029","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010029","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003377833","display_name":"Ulrik Brandes","orcid":"https://orcid.org/0000-0002-1520-0430"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]},{"id":"https://openalex.org/I9649716","display_name":"HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung","ror":"https://ror.org/051qw9f78","country_code":"DE","type":"education","lineage":["https://openalex.org/I9649716"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"U. Brandes","raw_affiliation_strings":["Department of Computer and Information Science, University of Konstanz, Box D 188, 78457 Konstanz, Germany. Ulrik.Brandes@uni-konstanz.de,  Dorothea.Wagner@uni-konstanz.de,  http://www.informatik.uni-konstanz.de/~brandes, http://www.informatik.uni-konstanz.de/~wagner., DE","University of Konstanz, Konstanz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Konstanz, Box D 188, 78457 Konstanz, Germany. Ulrik.Brandes@uni-konstanz.de,  Dorothea.Wagner@uni-konstanz.de,  http://www.informatik.uni-konstanz.de/~brandes, http://www.informatik.uni-konstanz.de/~wagner., DE","institution_ids":["https://openalex.org/I9649716","https://openalex.org/I189712700"]},{"raw_affiliation_string":"University of Konstanz, Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071076758","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0003-4728-7013"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]},{"id":"https://openalex.org/I9649716","display_name":"HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung","ror":"https://ror.org/051qw9f78","country_code":"DE","type":"education","lineage":["https://openalex.org/I9649716"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D. Wagner","raw_affiliation_strings":["Department of Computer and Information Science, University of Konstanz, Box D 188, 78457 Konstanz, Germany. Ulrik.Brandes@uni-konstanz.de,  Dorothea.Wagner@uni-konstanz.de,  http://www.informatik.uni-konstanz.de/~brandes, http://www.informatik.uni-konstanz.de/~wagner., DE","University of Konstanz, Konstanz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Konstanz, Box D 188, 78457 Konstanz, Germany. Ulrik.Brandes@uni-konstanz.de,  Dorothea.Wagner@uni-konstanz.de,  http://www.informatik.uni-konstanz.de/~brandes, http://www.informatik.uni-konstanz.de/~wagner., DE","institution_ids":["https://openalex.org/I9649716","https://openalex.org/I189712700"]},{"raw_affiliation_string":"University of Konstanz, Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003377833"],"corresponding_institution_ids":["https://openalex.org/I189712700","https://openalex.org/I9649716"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.16918987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"1","first_page":"16","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7483459711074829},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7346999049186707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6662383079528809},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5957920551300049},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.540040135383606},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5098716020584106},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.505033552646637},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.47639647126197815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4732047915458679},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4542447030544281},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4268471598625183},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4147729277610779},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3295506238937378},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06372356414794922}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7483459711074829},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7346999049186707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6662383079528809},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5957920551300049},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.540040135383606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5098716020584106},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.505033552646637},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.47639647126197815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4732047915458679},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4542447030544281},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4268471598625183},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4147729277610779},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3295506238937378},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06372356414794922}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s004530010029","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010029","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:CiteSeerX.psu:10.1.1.219.5008","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.5008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.uni-konstanz.de/algo/publications/bw-ltaad-00.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.4291","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4291","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.uni-konstanz.de/Preprints/papers/1997/preprint-029.ps.Z","raw_type":"text"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/5897","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-72154","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica ; 28 (2000), 1. - S. 16-36","raw_type":"doc-type:article"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/6203","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-20217","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1976957234","https://openalex.org/W1987374783","https://openalex.org/W2009669213","https://openalex.org/W2028503265","https://openalex.org/W2034509988","https://openalex.org/W2066881276","https://openalex.org/W2338905098","https://openalex.org/W2395343391","https://openalex.org/W2762935521"],"related_works":["https://openalex.org/W2043128958","https://openalex.org/W2075073335","https://openalex.org/W3196191381","https://openalex.org/W2346528079","https://openalex.org/W2764127424","https://openalex.org/W2370572809","https://openalex.org/W2798936174","https://openalex.org/W4295332012","https://openalex.org/W3124866060","https://openalex.org/W3020958106"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}