{"id":"https://openalex.org/W1771903244","doi":"https://doi.org/10.1007/s00224-016-9709-x","title":"Optimal Decremental Connectivity in Planar Graphs","display_name":"Optimal Decremental Connectivity in Planar Graphs","publication_year":2016,"publication_date":"2016-09-20","ids":{"openalex":"https://openalex.org/W1771903244","doi":"https://doi.org/10.1007/s00224-016-9709-x","mag":"1771903244"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-016-9709-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-016-9709-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","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/A5044510135","display_name":"Jakub \u0141\u0105cki","orcid":"https://orcid.org/0000-0001-9347-0041"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Jakub \u0141\u0105cki","raw_affiliation_strings":["Sapienza University of Rome, Rome, Italy","Sapienza university of Rome, Rome, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Sapienza university of Rome, Rome, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044510135"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0787,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78681928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"61","issue":"4","first_page":"1037","last_page":"1053"},"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.9983000159263611,"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.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5889821648597717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5866095423698425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5566057562828064},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5253029465675354},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5245580673217773},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.520936131477356},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5172434449195862},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4895061254501343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4891546070575714},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.48002710938453674},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.447859525680542},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4119492471218109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4106851816177368},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4102822542190552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40584951639175415},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1494773030281067},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.061220377683639526}],"concepts":[{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5889821648597717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5866095423698425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5566057562828064},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5253029465675354},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5245580673217773},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.520936131477356},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5172434449195862},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4895061254501343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4891546070575714},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.48002710938453674},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.447859525680542},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4119492471218109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4106851816177368},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4102822542190552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40584951639175415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1494773030281067},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.061220377683639526},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":1,"locations":[{"id":"doi:10.1007/s00224-016-9709-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-016-9709-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1670069741","display_name":null,"funder_award_id":"UMO-2014/13/B/ST6/01811","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G1713183270","display_name":null,"funder_award_id":"FET project MULTIPLEX no. 317532","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1552413686","https://openalex.org/W1963524245","https://openalex.org/W1969221581","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W1991632262","https://openalex.org/W1992869351","https://openalex.org/W2009695707","https://openalex.org/W2010151376","https://openalex.org/W2044332144","https://openalex.org/W2045430818","https://openalex.org/W2049596277","https://openalex.org/W2094632707","https://openalex.org/W2095571038","https://openalex.org/W2103361121","https://openalex.org/W2120424341","https://openalex.org/W2121473031","https://openalex.org/W2166242192","https://openalex.org/W2266371753","https://openalex.org/W2271950721","https://openalex.org/W2395489635","https://openalex.org/W2953105294","https://openalex.org/W4238411931"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4389362338","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W1447961680","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}