{"id":"https://openalex.org/W2055564944","doi":"https://doi.org/10.1007/s10107-005-0653-9","title":"On the complexity of the planar directed edge-disjoint paths problem","display_name":"On the complexity of the planar directed edge-disjoint paths problem","publication_year":2005,"publication_date":"2005-10-12","ids":{"openalex":"https://openalex.org/W2055564944","doi":"https://doi.org/10.1007/s10107-005-0653-9","mag":"2055564944"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-005-0653-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-005-0653-9","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5042146726","display_name":"Dirk M\u00fcller","orcid":"https://orcid.org/0000-0002-6106-6607"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dirk M\u00fcller","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113, Bonn, Germany","Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042146726"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3372,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62017531,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"105","issue":"2-3","first_page":"275","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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.9976000189781189,"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.7752605676651001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.718127429485321},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6426729559898376},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5239748358726501},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5113832354545593},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.498852014541626},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.48616835474967957},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42086338996887207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4150523543357849},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3038982152938843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22473496198654175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1675892472267151}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7752605676651001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.718127429485321},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6426729559898376},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5239748358726501},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5113832354545593},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.498852014541626},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.48616835474967957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42086338996887207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4150523543357849},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3038982152938843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22473496198654175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1675892472267151},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-005-0653-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-005-0653-9","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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":10,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1557310162","https://openalex.org/W2003160050","https://openalex.org/W2041884875","https://openalex.org/W2050579693","https://openalex.org/W2066577300","https://openalex.org/W2074687761","https://openalex.org/W2091250471","https://openalex.org/W2988480584","https://openalex.org/W2998757566"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4237277701","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2121424666","https://openalex.org/W1587028174","https://openalex.org/W3216105633","https://openalex.org/W2990956612"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}