{"id":"https://openalex.org/W7130838120","doi":"https://doi.org/10.1016/j.tcs.2026.115825","title":"Hardness of planarity for weak temporal sequences of 2-connected graphs","display_name":"Hardness of planarity for weak temporal sequences of 2-connected graphs","publication_year":2026,"publication_date":"2026-02-21","ids":{"openalex":"https://openalex.org/W7130838120","doi":"https://doi.org/10.1016/j.tcs.2026.115825"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115825","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115825","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.115825","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033997884","display_name":"Johannes Carmesin","orcid":"https://orcid.org/0000-0002-3026-6673"},"institutions":[{"id":"https://openalex.org/I61893789","display_name":"TU Bergakademie Freiberg","ror":"https://ror.org/031vc2293","country_code":"DE","type":"education","lineage":["https://openalex.org/I61893789"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johannes Carmesin","raw_affiliation_strings":["TU Bergakademie Freiberg, Pr\u00fcferstra\u00dfe 1, Freiberg, Sachsen, Deutschland"],"raw_orcid":"https://orcid.org/0000-0002-3026-6673","affiliations":[{"raw_affiliation_string":"TU Bergakademie Freiberg, Pr\u00fcferstra\u00dfe 1, Freiberg, Sachsen, Deutschland","institution_ids":["https://openalex.org/I61893789"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5126552296","display_name":"Will J. Turner","orcid":null},"institutions":[{"id":"https://openalex.org/I61893789","display_name":"TU Bergakademie Freiberg","ror":"https://ror.org/031vc2293","country_code":"DE","type":"education","lineage":["https://openalex.org/I61893789"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Will J. Turner","raw_affiliation_strings":["TU Bergakademie Freiberg, Pr\u00fcferstra\u00dfe 1, Freiberg, Sachsen, Deutschland"],"raw_orcid":"https://orcid.org/0009-0002-5342-0650","affiliations":[{"raw_affiliation_string":"TU Bergakademie Freiberg, Pr\u00fcferstra\u00dfe 1, Freiberg, Sachsen, Deutschland","institution_ids":["https://openalex.org/I61893789"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126552296"],"corresponding_institution_ids":["https://openalex.org/I61893789"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41143736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1070","issue":null,"first_page":"115825","last_page":"115825"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.673799991607666,"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.673799991607666,"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.06650000065565109,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.053599998354911804,"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.7555000185966492},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7232000231742859},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6420999765396118},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4708000123500824},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.42250001430511475}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.82669997215271},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.7555000185966492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7554000020027161},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7232000231742859},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6420999765396118},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4708000123500824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.42250001430511475},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.2558000087738037},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2498999983072281}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2026.115825","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115825","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2026.115825","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115825","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"weak":[1,68],"deletion":[2,69],"sequence":[3,6],"is":[4,32,50,74],"a":[5,35,53],"(":[7],"G":[8,13,30,38,46,56],"1":[9,27,41,49],",":[10,12,42],"\u2026":[11],"n":[14,25],")":[15],"of":[16,37,55,67,71],"graphs":[17,73],"so":[18],"that":[19,61],"for":[20],"each":[21],"i":[22,31,39,47,57],"\u2208":[23],"[":[24],"\u2212":[26],"]":[28],"either":[29],"isomorphic":[33,51],"to":[34,52],"subgraph":[36,54],"+":[40,48],"or":[43],"vice":[44],"versa:":[45],".":[58],"We":[59],"prove":[60],"determining":[62],"the":[63],"simultaneous":[64],"planar":[65],"embeddability":[66],"sequences":[70],"2-connected":[72],"NP-hard.":[75]},"counts_by_year":[],"updated_date":"2026-02-27T06:17:20.405678","created_date":"2026-02-22T00:00:00"}