{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:03:03Z","timestamp":1780056183324,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654105","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"1533-1541","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2594-3828","authenticated-orcid":false,"given":"Jakob","family":"Baumann","sequence":"first","affiliation":[{"name":"University of Passau, Passau, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[{"name":"University of Passau, Passau, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6020-1646","authenticated-orcid":false,"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"University of Passau, Passau, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"Battista Giuseppe Di","unstructured":"Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G Tollis. 1998. Graph drawing: algorithms for the visualization of graphs. Prentice Hall PTR."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/945394.945396"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.818192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-023-01146-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631286"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization. Springer.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.12.008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1093-2"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 9th Australian Computer Science Conference. 334","author":"Eades Peter","year":"1986","unstructured":"Peter Eades, Brendan D McKay, and Nicholas C Wormald. 1986. On an edge crossing problem. In Proc. 9th Australian Computer Science Conference. 334."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187020"},{"key":"e_1_3_2_1_12_1","volume-title":"International Workshop on Combinatorial Algorithms. Springer, 337--348","author":"Fernau Henning","year":"2010","unstructured":"Henning Fernau, Fedor V Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, and Saket Saurabh. 2010. Ranking and drawing in subexponential time. In International Workshop on Combinatorial Algorithms. Springer, 337--348."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3594805.3607125"},{"key":"e_1_3_2_1_14_1","unstructured":"Michael R Garey and David S Johnson. 1979. Computers and intractability: a guide to the theory of NP-hardness."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-018-0429-2"},{"key":"e_1_3_2_1_16_1","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","unstructured":"Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Michael J\u00fcnger and Petra Mutzel. 2002. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. In Graph Algorithms and Applications I. World Scientific 3--27.","DOI":"10.1142\/9789812777638_0001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9872-x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2010.01.031"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207169408804322"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Xavier Mu\u00f1oz W. Unger and Imrich Vrt'o. 2002. One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. In Graph Drawing Petra Mutzel Michael J\u00fcnger and Sebastian Leipert (Eds.). Springer Berlin Heidelberg 115--123.","DOI":"10.1007\/3-540-45848-4_10"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00199"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.009"},{"key":"e_1_3_2_1_24_1","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45034-3_76"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3296645"},{"key":"e_1_3_2_1_27_1","volume-title":"Handbook of Randomized Algorithms","author":"Ranade Abhiram","unstructured":"Abhiram Ranade. 2001. The Delay Sequence Argument. In Handbook of Randomized Algorithms. Kluwer Academic Publishers, Chapter 1."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"e_1_3_2_1_30_1","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Theile Madeleine","unstructured":"Madeleine Theile. 2009. Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm. In Evolutionary Computation in Combinatorial Optimization, Carlos Cotta and Peter Cowling (Eds.). Springer, 145--155."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/127601.127626"},{"key":"e_1_3_2_1_32_1","volume-title":"1989 IEEE Workshop on Visual Languages. IEEE Computer Society, 13--14","author":"Xuemin Lin","year":"1989","unstructured":"Lin Xuemin. 1989. How to draw a directed graph. In 1989 IEEE Workshop on Visual Languages. IEEE Computer Society, 13--14."}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:51Z","timestamp":1750291011000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":32,"alternative-id":["10.1145\/3638529.3654105","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654105","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}