{"id":"https://openalex.org/W2021673830","doi":"https://doi.org/10.1016/s0166-218x(01)00294-3","title":"Length-bounded disjoint paths in planar graphs","display_name":"Length-bounded disjoint paths in planar graphs","publication_year":2002,"publication_date":"2002-07-28","ids":{"openalex":"https://openalex.org/W2021673830","doi":"https://doi.org/10.1016/s0166-218x(01)00294-3","mag":"2021673830"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(01)00294-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00294-3","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5090249969","display_name":"Hein van der Holst","orcid":null},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"H. van der Holst","raw_affiliation_strings":["Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, Arnimallee 2-6, D-14195 Berlin, Germany","Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, Arnimallee 2-6, D-14195 Berlin, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, Arnimallee 2-6, D-14195 Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]},{"raw_affiliation_string":"Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, Arnimallee 2-6, D-14195 Berlin, Germany#TAB#","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068320063","display_name":"Jos\u00e9 Coelho de Pina","orcid":"https://orcid.org/0000-0003-0008-7954"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"J.C. de Pina","raw_affiliation_strings":["Instituto de Matem\u00e1tica e Estat\u0131\u0301stica, Universidade de S\u00e3o Paulo, Rua do Mat\u00e3o 1010, 05508-900 S\u00e3o Paulo, Brazil","Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, Rua do Mat\u00e3o 1010, 05508\u2010900 S\u00e3o Paulo, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Matem\u00e1tica e Estat\u0131\u0301stica, Universidade de S\u00e3o Paulo, Rua do Mat\u00e3o 1010, 05508-900 S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]},{"raw_affiliation_string":"Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, Rua do Mat\u00e3o 1010, 05508\u2010900 S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090249969"],"corresponding_institution_ids":["https://openalex.org/I75951250"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.12729871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"120","issue":"1-3","first_page":"251","last_page":"261"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"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/combinatorics","display_name":"Combinatorics","score":0.8622377514839172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.836798906326294},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6538470983505249},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6450703144073486},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6309219002723694},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.539909839630127},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4553365111351013},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4458054304122925},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4432043135166168},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4375028908252716},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4250485897064209},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4208196997642517},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4159776568412781},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.22879093885421753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05353200435638428}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8622377514839172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.836798906326294},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6538470983505249},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6450703144073486},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6309219002723694},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.539909839630127},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4553365111351013},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4458054304122925},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4432043135166168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4375028908252716},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4250485897064209},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4208196997642517},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4159776568412781},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.22879093885421753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05353200435638428},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0166-218x(01)00294-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00294-3","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/545837b6-022a-4410-8405-66084d7ce3d6","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/545837b6-022a-4410-8405-66084d7ce3d6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Holst, van der, H & Pina, de, J C 2002, 'Length-bounded disjoint paths in planar graphs', Discrete Applied Mathematics, vol. 120, no. 1-3, pp. 251-261. https://doi.org/10.1016/S0166-218X(01)00294-3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.6850","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6850","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ime.usp.br/~cris/gcomb/pronex/ps-dvi-files/coelho/bottle.ps.gz","raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/545837b6-022a-4410-8405-66084d7ce3d6","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/545837b6-022a-4410-8405-66084d7ce3d6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Applied Mathematics, 120(1-3), 251 - 261. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1662788173","https://openalex.org/W1963547452","https://openalex.org/W1967565181","https://openalex.org/W2000733920","https://openalex.org/W2011039300","https://openalex.org/W2019637647","https://openalex.org/W2036265926","https://openalex.org/W2053913299","https://openalex.org/W2066356146","https://openalex.org/W2103658959","https://openalex.org/W2401610261","https://openalex.org/W2752885492","https://openalex.org/W3121717391","https://openalex.org/W4233558979","https://openalex.org/W4285719527","https://openalex.org/W6637073331","https://openalex.org/W6644040475"],"related_works":["https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W4377232111","https://openalex.org/W113232329","https://openalex.org/W3121940326","https://openalex.org/W115237389","https://openalex.org/W2965301163","https://openalex.org/W1912579385","https://openalex.org/W2942931089","https://openalex.org/W2361081252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}