{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:34Z","timestamp":1781031454814,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"DFG","award":["546892829"],"award-info":[{"award-number":["546892829"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800848","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1388-1396","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Minors Approach to Temporal Sequences"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3026-6673","authenticated-orcid":false,"given":"Johannes","family":"Carmesin","sequence":"first","affiliation":[{"name":"TU Bergakademie Freiberg, Freiberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5342-0650","authenticated-orcid":false,"given":"Will J.","family":"Turner","sequence":"additional","affiliation":[{"name":"TU Bergakademie Freiberg, Freiberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Saeed Akhoondian Amiri Ken-ichi Kawarabayashi Stephan Kreutzer and Paul Wollan. 2016. The Erd\u0151s-P\u00f3sa property for directed graphs. arXiv preprint arXiv:1603.02504 ( 2016 )."},{"key":"e_1_3_2_1_2_1","unstructured":"Johannes Carmesin. 2023. Embedding simply connected 2-complexes in 3-space. arXiv preprint arXiv:2309.15504 ( 2023 )."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00115"},{"key":"e_1_3_2_1_4_1","volume-title":"Turner","author":"Carmesin Johannes","year":"2025","unstructured":"Johannes Carmesin and Will J. Turner. 2025. A Graph Minors Approach to Temporal Sequences. arXiv: 2504.00704 [math.CO] https:\/\/arxiv.org\/abs\/2504. 00704"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Johannes Carmesin and Will J Turner. 2026. Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs. Theoretical Computer Science ( 2026 ) 115825.","DOI":"10.1016\/j.tcs.2026.115825"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Lorenzo Dall'Amico Alain Barrat and Ciro Cattuto. 2024. An embedding-based distance for temporal graphs. Nature Communications 15 1 ( 2024 ) 9954.","DOI":"10.1038\/s41467-024-54280-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3389\/fncom"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-42071-0_6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11917496_29"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Jim Geelen Bert Gerards and Geof Whittle. 2014. Solving Rota's Conjecture. Notices of the American Mathematical Society 61 7 ( 2014 ) 736-743. https:\/\/www. ams.org\/notices\/201407\/rnoti-p736.pdf","DOI":"10.1090\/noti1139"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1506407112"},{"key":"e_1_3_2_1_12_1","unstructured":"Sayan Gupta and Srikanta Bedathur. 2022. A Survey on Temporal Graph Representation Learning and Generative Modeling. arXiv preprint arXiv:2208.12126 ( 2022 ). arXiv: 2208.12126 [cs.LG]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"e_1_3_2_1_14_1","volume-title":"Pietro Hiram Guzzi, and Riccardo Dondi","author":"Hosseinzadeh Mohammad Mehdi","year":"2022","unstructured":"Mohammad Mehdi Hosseinzadeh, Mario Cannataro, Pietro Hiram Guzzi, and Riccardo Dondi. 2022. Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Network Modeling Analysis in Health Informatics and Bioinformatics 12, 1 ( 2022 ), 10."},{"key":"e_1_3_2_1_15_1","volume-title":"Temporal graph benchmark for machine learning on temporal graphs. Advances in Neural Information Processing Systems 36 ( 2023 )","author":"Huang Shenyang","year":"2056","unstructured":"Shenyang Huang, Farimah Poursafaei, Jacob Danovitch, Matthias Fey, Weihua Hu, Emanuele Rossi, Jure Leskovec, Michael Bronstein, Guillaume Rabusseau, and Reihaneh Rabbany. 2023. Temporal graph benchmark for machine learning on temporal graphs. Advances in Neural Information Processing Systems 36 ( 2023 ), 2056-2073."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.06.003"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. 655-664","author":"Stephan Kreutzer Kawarabayashi","year":"2015","unstructured":"Ken-ichi Kawarabayashi and Stephan Kreutzer. 2015. The directed grid theorem. In Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. 655-664."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Othon Michail. 2016. An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics 12 4 ( 2016 ) 239-280.","DOI":"10.1080\/15427951.2016.1177801"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.56021\/9780801866890"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5_13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Olaf Sporns. 2018. Graph theory methods: applications in brain networks. Dialogues in clinical neuroscience 20 2 ( 2018 ) 111-121.","DOI":"10.31887\/DCNS.2018.20.2\/osporns"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36461-7_7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"William Hedley Thompson Per Brantefors and Peter Fransson. 2017. From static to temporal network theory: Applications to functional brain connectivity. Network Neuroscience 1 2 ( 2017 ) 69-99.","DOI":"10.1162\/NETN_a_00011"},{"key":"e_1_3_2_1_25_1","unstructured":"Will J. Turner. 2026 +. Planarity for contraction trees of graphs. In preparation ( 2026 +)."},{"key":"e_1_3_2_1_26_1","unstructured":"Will J. Turner. 2026 +. Planarity for trees of graphs is FPT. In preparation ( 2026 +)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(61)50045-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371127"},{"key":"e_1_3_2_1_29_1","unstructured":"Received 3 November 2025; accepted 1 February 2026"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:03:46Z","timestamp":1781028226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":29,"alternative-id":["10.1145\/3798129.3800848","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800848","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}