{"id":"https://openalex.org/W2111716715","doi":"https://doi.org/10.1145/1921659.1921665","title":"Shortest vertex-disjoint two-face paths in planar graphs","display_name":"Shortest vertex-disjoint two-face paths in planar graphs","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2111716715","doi":"https://doi.org/10.1145/1921659.1921665","mag":"2111716715"},"language":"en","primary_location":{"id":"doi:10.1145/1921659.1921665","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921665","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0802.2845","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059014964","display_name":"\u00c9ric Colin de Verdi\u00e8re","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"\u00c9ric Colin De Verdi\u00e8re","raw_affiliation_strings":["\u00c9cole Normale Sup\u00e9rieure and CNRS, Paris, France"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Sup\u00e9rieure and CNRS, Paris, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028190074","display_name":"Alexander Schrijver","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Schrijver","raw_affiliation_strings":["Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059014964"],"corresponding_institution_ids":["https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":1.2925,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.80865462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"2","first_page":"1","last_page":"12"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8911503553390503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6781119108200073},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6509923934936523},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6184982657432556},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5800173282623291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42846786975860596},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41687363386154175},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.41611966490745544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15696462988853455}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8911503553390503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6781119108200073},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6509923934936523},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6184982657432556},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5800173282623291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42846786975860596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41687363386154175},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.41611966490745544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15696462988853455},{"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":8,"locations":[{"id":"doi:10.1145/1921659.1921665","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921665","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/609798d9-e2de-4ab8-9a14-8014e754be36","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/shortest-vertexdisjoint-twoface-paths-in-planar-graphs(609798d9-e2de-4ab8-9a14-8014e754be36).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Colin de Verdi\u00e8re, E & Schrijver, A 2011, 'Shortest vertex-disjoint two-face paths in planar graphs', ACM Transactions on Algorithms (TALG), vol. 7, no. 2. https://doi.org/10.1145/1921659.1921665","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:0802.2845","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.2845","pdf_url":"https://arxiv.org/pdf/0802.2845","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:18781","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/18781","pdf_url":"https://ir.cwi.nl/pub/18781/p1-Verdiere-1.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms vol. 7 no. 2","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:cwi:oai:cwi.nl:13307","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/13307","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":"","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.1904","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.1904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2008/1347/pdf/22011.deVerdiereEric.Paper.1347.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00221493v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00221493","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STACS 2008, Feb 2008, Bordeaux, France. pp.181-192","raw_type":"Conference papers"},{"id":"pmh:oai:dare.uva.nl:publications/609798d9-e2de-4ab8-9a14-8014e754be36","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/shortest-vertexdisjoint-twoface-paths-in-planar-graphs(609798d9-e2de-4ab8-9a14-8014e754be36).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Colin de Verdi\u00e8re, E & Schrijver, A 2011, 'Shortest vertex-disjoint two-face paths in planar graphs', ACM Transactions on Algorithms (TALG), vol. 7, no. 2. https://doi.org/10.1145/1921659.1921665","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0802.2845","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.2845","pdf_url":"https://arxiv.org/pdf/0802.2845","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2005079828","https://openalex.org/W2008597108","https://openalex.org/W2021673830","https://openalex.org/W2050579693","https://openalex.org/W2068595367","https://openalex.org/W2076434053","https://openalex.org/W2084224084","https://openalex.org/W2137173571","https://openalex.org/W2168951837","https://openalex.org/W2169528473","https://openalex.org/W2268207117","https://openalex.org/W2340149117","https://openalex.org/W2762935521","https://openalex.org/W2988480584","https://openalex.org/W7052488743"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W3216105633","https://openalex.org/W2019085620","https://openalex.org/W2990956612","https://openalex.org/W2584131233","https://openalex.org/W1606013690","https://openalex.org/W4293743430","https://openalex.org/W3006156235"],"abstract_inverted_index":{"Let":[0,17],"G":[1,26,71],"be":[2,21,33,44],"a":[3,14],"directed":[4],"planar":[5],"graph":[6],"of":[7,25],"complexity":[8],"n":[9,82],",":[10,66,72],"each":[11],"arc":[12],"having":[13],"nonnegative":[15],"length.":[16],"s":[18,28,31,37,64],"and":[19],"t":[20,39,42,48,67],"two":[22],"distinct":[23],"faces":[24],"let":[27,38],"1":[29,40],",\u2026,":[30,41],"k":[32,43,56],"vertices":[34,45],"incident":[35,46],"with":[36,47,73],".":[49],"We":[50],"give":[51],"an":[52],"algorithm":[53],"to":[54],"compute":[55],"pairwise":[57],"vertex-disjoint":[58],"paths":[59],"connecting":[60],"the":[61],"pairs":[62],"(":[63,79],"i":[65,68],")":[69,83],"in":[70,77],"minimal":[74],"total":[75],"length,":[76],"O":[78],"kn":[80],"log":[81],"time.":[84]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-06T07:47:59.780226","created_date":"2025-10-10T00:00:00"}