{"id":"https://openalex.org/W1550834367","doi":"https://doi.org/10.1007/3-540-55719-9_86","title":"Fast incremental planarity testing","display_name":"Fast incremental planarity testing","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1550834367","doi":"https://doi.org/10.1007/3-540-55719-9_86","mag":"1550834367"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-55719-9_86","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-55719-9_86","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/A5034718361","display_name":"Jeffery Westbrook","orcid":null},"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":true,"raw_author_name":"Jeffery Westbrook","raw_affiliation_strings":["Department of Computer Science, Yale University, New Haven","Department of Computer Science, Yale University, New Haven,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven,","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034718361"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":8.658,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97664313,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"342","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/planarity-testing","display_name":"Planarity testing","score":0.9407765865325928},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.7241311073303223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6804847717285156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6360138654708862},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5170403122901917},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.49182605743408203},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.47371381521224976},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4384238123893738},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4170493483543396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35418960452079773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33019232749938965},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16353437304496765},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06978890299797058}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9407765865325928},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.7241311073303223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6804847717285156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6360138654708862},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5170403122901917},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.49182605743408203},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.47371381521224976},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4384238123893738},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4170493483543396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35418960452079773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33019232749938965},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16353437304496765},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06978890299797058},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-55719-9_86","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-55719-9_86","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.9410","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.yale.edu/WWW/HTML/YALE/CS/HyPlans/westbrook/planarity-testing.ps.Z","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":19,"referenced_works":["https://openalex.org/W1597528919","https://openalex.org/W1978136862","https://openalex.org/W1978438623","https://openalex.org/W1986022261","https://openalex.org/W1987374783","https://openalex.org/W1994556169","https://openalex.org/W2002723731","https://openalex.org/W2011999472","https://openalex.org/W2020473451","https://openalex.org/W2024491681","https://openalex.org/W2026511056","https://openalex.org/W2028503265","https://openalex.org/W2054420170","https://openalex.org/W2077229436","https://openalex.org/W2089620427","https://openalex.org/W2144285030","https://openalex.org/W2169100094","https://openalex.org/W2799004609","https://openalex.org/W6629172744"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2003754801","https://openalex.org/W2138200290","https://openalex.org/W2777026024","https://openalex.org/W1973784010","https://openalex.org/W1594629953","https://openalex.org/W1550834367","https://openalex.org/W2766893803","https://openalex.org/W2039208882","https://openalex.org/W2950317522"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}