{"id":"https://openalex.org/W2570240585","doi":"https://doi.org/10.1007/978-3-540-70575-8_40","title":"The Two-Edge Connectivity Survivable Network Problem in Planar Graphs","display_name":"The Two-Edge Connectivity Survivable Network Problem in Planar Graphs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2570240585","doi":"https://doi.org/10.1007/978-3-540-70575-8_40","mag":"2570240585"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-70575-8_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70575-8_40","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/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Computer Science Department, Brown University, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brown University, USA","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108529502"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.8398,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.93189582,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"485","last_page":"501"},"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.9980999827384949,"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.9980999827384949,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9957000017166138,"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.994700014591217,"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.6771554946899414},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6072083115577698},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5496259927749634},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.47273173928260803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46826082468032837},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.459606409072876},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4540454149246216},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44874969124794006},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44472044706344604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4065925180912018},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36405789852142334},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3425513803958893},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.26496660709381104}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6771554946899414},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6072083115577698},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5496259927749634},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.47273173928260803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46826082468032837},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.459606409072876},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4540454149246216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44874969124794006},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44472044706344604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4065925180912018},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36405789852142334},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3425513803958893},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26496660709381104}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-70575-8_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70575-8_40","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.155.5400","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.5400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~pnk/publications/2ec-icalp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W625072069","https://openalex.org/W1529513351","https://openalex.org/W1572973141","https://openalex.org/W1590399153","https://openalex.org/W1985672402","https://openalex.org/W1989224473","https://openalex.org/W1995473411","https://openalex.org/W2038686820","https://openalex.org/W2042660957","https://openalex.org/W2051699458","https://openalex.org/W2065166038","https://openalex.org/W2092113566","https://openalex.org/W2131926707","https://openalex.org/W2145145566","https://openalex.org/W2150855695","https://openalex.org/W2156760067","https://openalex.org/W2172955861","https://openalex.org/W2502117809","https://openalex.org/W2762935521","https://openalex.org/W4234462414","https://openalex.org/W6619720112"],"related_works":["https://openalex.org/W3160792420","https://openalex.org/W4287181997","https://openalex.org/W2045730620","https://openalex.org/W2886071965","https://openalex.org/W2395770054","https://openalex.org/W2949729914","https://openalex.org/W4297803065","https://openalex.org/W2168266982","https://openalex.org/W2963028755","https://openalex.org/W4226287252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}