{"id":"https://openalex.org/W1535994381","doi":"https://doi.org/10.1007/bfb0015441","title":"A linear time algorithm for finding maximal planar subgraphs","display_name":"A linear time algorithm for finding maximal planar subgraphs","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1535994381","doi":"https://doi.org/10.1007/bfb0015441","mag":"1535994381"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0015441","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0015441","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in 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/A5119558606","display_name":"Wen\u2212Lian Hsu","orcid":"https://orcid.org/0000-0001-7061-3513"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Wen-Lian Hsu","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC","Institute of Information Science, Academia Sinica, Taipei, Taiwan ROC"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan ROC","institution_ids":["https://openalex.org/I4210098366"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5119558606"],"corresponding_institution_ids":["https://openalex.org/I4210098366"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.15851108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"352","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.9681496620178223},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6431406140327454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5896134376525879},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.575690746307373},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5719146132469177},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5718156099319458},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.4722541868686676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4465838074684143},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4413506090641022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4365730285644531},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4112311601638794},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3364371061325073}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9681496620178223},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6431406140327454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5896134376525879},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.575690746307373},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5719146132469177},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5718156099319458},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.4722541868686676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4465838074684143},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4413506090641022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4365730285644531},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4112311601638794},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3364371061325073},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0015441","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0015441","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.2832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.2832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://www.iis.sinica.edu.tw/pub/going/paper/maximal.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.8170","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.8170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iis.sinica.edu.tw/IASL/webpdf/paper-2005-A_Linear_Time_Algorithm_for_Finding_a_Maximal_Planar_Subgraph_Based_on_PC-Trees.pdf","raw_type":"text"}],"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/W152087360","https://openalex.org/W204417607","https://openalex.org/W1566493102","https://openalex.org/W1908738628","https://openalex.org/W1987374783","https://openalex.org/W2002723731","https://openalex.org/W2013148843","https://openalex.org/W2024491681","https://openalex.org/W2035471954","https://openalex.org/W2301910997"],"related_works":["https://openalex.org/W2057903654","https://openalex.org/W2095981233","https://openalex.org/W2084592635","https://openalex.org/W1581580640","https://openalex.org/W1510038041","https://openalex.org/W1528674710","https://openalex.org/W2082494488","https://openalex.org/W2054349495","https://openalex.org/W2998116189","https://openalex.org/W2081358954"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}