{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:23Z","timestamp":1781078243313,"version":"3.54.1"},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T00:00:00Z","timestamp":1771718400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115825","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T16:11:35Z","timestamp":1771690295000},"page":"115825","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Hardness of planarity for weak temporal sequences of 2-connected graphs"],"prefix":"10.1016","volume":"1070","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3026-6673","authenticated-orcid":false,"given":"Johannes","family":"Carmesin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5342-0650","authenticated-orcid":false,"given":"Will J.","family":"Turner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115825_bib0001","unstructured":"J. Carmesin, W. J. Turner, A graph minors approach to temporal sequences(2025). https:\/\/arxiv.org\/abs\/2504.00704."},{"key":"10.1016\/j.tcs.2026.115825_bib0002","unstructured":"W. J. Turner, Planarity for trees of graphs is FPT, In preparation."},{"key":"10.1016\/j.tcs.2026.115825_bib0003","unstructured":"W.J. Turner, Planarity for contraction trees of graphs, In preparation."},{"key":"10.1016\/j.tcs.2026.115825_bib0004","series-title":"Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22\u201324, 2006 Revised Papers 32","first-page":"325","article-title":"Simultaneous graph embeddings with fixed edges","author":"Gassner","year":"2006"},{"key":"10.1016\/j.tcs.2026.115825_bib0005","series-title":"Graphs on Surfaces","author":"Mohar","year":"2001"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000848?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000848?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:52:14Z","timestamp":1777553534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":5,"alternative-id":["S0304397526000848"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115825","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hardness of planarity for weak temporal sequences of 2-connected graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115825","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115825"}}