{"id":"https://openalex.org/W217231717","doi":"https://doi.org/10.1007/s00453-002-0995-0","title":"Efficient Parallel Algorithms for Planar st-Graphs","display_name":"Efficient Parallel Algorithms for Planar st-Graphs","publication_year":2003,"publication_date":"2003-02-07","ids":{"openalex":"https://openalex.org/W217231717","doi":"https://doi.org/10.1007/s00453-002-0995-0","mag":"217231717"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-002-0995-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-002-0995-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-002-0995-0.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-002-0995-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091176597","display_name":"Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Atallah","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN 47907,  mja@cs.purdue.edu, USA","Purdue University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907,  mja@cs.purdue.edu, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105308467","display_name":"Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen","raw_affiliation_strings":["University of Notre Dame"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098636602","display_name":"Daescu","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daescu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083,  daescu@utdallas.edu., USA","Computer Science"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083,  daescu@utdallas.edu., USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091176597"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01812052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"35","issue":"3","first_page":"194","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9957000017166138,"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/planar-graph","display_name":"Planar graph","score":0.7317776083946228},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6454949378967285},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6151217222213745},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5517359972000122},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5365604758262634},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5354058742523193},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.527709424495697},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.5040813684463501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4768717885017395},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.4714796543121338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4700521230697632},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46654272079467773},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4373803734779358},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4332479238510132},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.427681028842926},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4201599359512329},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.41443127393722534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.406954288482666},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.382357656955719},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27319663763046265},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12397107481956482}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7317776083946228},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6454949378967285},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6151217222213745},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5517359972000122},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5365604758262634},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5354058742523193},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.527709424495697},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.5040813684463501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4768717885017395},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.4714796543121338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4700521230697632},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46654272079467773},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4373803734779358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4332479238510132},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.427681028842926},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4201599359512329},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.41443127393722534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.406954288482666},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.382357656955719},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27319663763046265},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12397107481956482},{"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/s00453-002-0995-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-002-0995-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-002-0995-0.pdf","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"}],"best_oa_location":{"id":"doi:10.1007/s00453-002-0995-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-002-0995-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-002-0995-0.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8811735934","display_name":"CAREER: Theoretical and Practical Solutions for             Geometric Path Planning and Related Problems","funder_award_id":"9623585","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"},{"id":"https://openalex.org/F4320311089","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W217231717.pdf","grobid_xml":"https://content.openalex.org/works/W217231717.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1512436171","https://openalex.org/W1972455324","https://openalex.org/W1982180670","https://openalex.org/W1985495277","https://openalex.org/W1997039683","https://openalex.org/W2023670982","https://openalex.org/W2027428596","https://openalex.org/W2031198637","https://openalex.org/W2031911173","https://openalex.org/W2033740214","https://openalex.org/W2038643780","https://openalex.org/W2038796709","https://openalex.org/W2039972044","https://openalex.org/W2047198574","https://openalex.org/W2049413646","https://openalex.org/W2053740287","https://openalex.org/W2056711744","https://openalex.org/W2060759452","https://openalex.org/W2061420453","https://openalex.org/W2063204215","https://openalex.org/W2071634314","https://openalex.org/W2084224084","https://openalex.org/W2084593768","https://openalex.org/W2085467310","https://openalex.org/W2096827683","https://openalex.org/W2105114849","https://openalex.org/W2120490947","https://openalex.org/W2124526408","https://openalex.org/W2125663002","https://openalex.org/W2130566259","https://openalex.org/W2135674162","https://openalex.org/W2165968314","https://openalex.org/W2170132497","https://openalex.org/W2752885492","https://openalex.org/W4242757385","https://openalex.org/W6646927440","https://openalex.org/W6656559629","https://openalex.org/W6672053837","https://openalex.org/W6678496339"],"related_works":["https://openalex.org/W1759199114","https://openalex.org/W3216500139","https://openalex.org/W2995965358","https://openalex.org/W4287758186","https://openalex.org/W3034858646","https://openalex.org/W2009558719","https://openalex.org/W1491152805","https://openalex.org/W2081773392","https://openalex.org/W2039281885","https://openalex.org/W3002061974"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}