{"id":"https://openalex.org/W2395343391","doi":"https://doi.org/10.1090/dimacs/020/06","title":"Efficient algorithms for disjoint paths in planar graphs","display_name":"Efficient algorithms for disjoint paths in planar graphs","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2395343391","doi":"https://doi.org/10.1090/dimacs/020/06","mag":"2395343391"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/020/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/020/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical 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/A5083868628","display_name":"Heike Ripphausen-Lipa","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H Ripphausen-Lipa","raw_affiliation_strings":["Rice University, Houston, TX"],"affiliations":[{"raw_affiliation_string":"Rice University, Houston, TX","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Yale University, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074920330","display_name":"Karsten Weihe","orcid":"https://orcid.org/0000-0003-3039-8454"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K Weihe","raw_affiliation_strings":["Bellcore, Morristown, NJ","Rice University, Houston, TX"],"affiliations":[{"raw_affiliation_string":"Bellcore, Morristown, NJ","institution_ids":[]},{"raw_affiliation_string":"Rice University, Houston, TX","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083868628"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":3.9298,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.93625498,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.6692667007446289},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5927849411964417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5454781651496887},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5408421754837036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.466695100069046},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31655454635620117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2579331696033478},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2552483081817627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1424432098865509},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.051611363887786865}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6692667007446289},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5927849411964417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5454781651496887},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5408421754837036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.466695100069046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31655454635620117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2579331696033478},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2552483081817627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1424432098865509},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.051611363887786865}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/020/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/020/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical 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":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W3216105633","https://openalex.org/W2019085620","https://openalex.org/W2990956612","https://openalex.org/W2584131233"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}