2026-07-22T01:58:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25029 2026-02-09T07:53:51Z ddc:004 open_access

Winning the GD Challenge for the 4th Time: Our Approach (Graph Drawing Contest Abstract) Bianchetti, Julien Moalic, Laurent Graph Drawing Contest simulated annealing k-planarity We present the approach we designed to tackle and win the 2025 Graph Drawing Challenge on minimizing the k-planarity of graphs. Our method employs a multi-stage heuristic centered around two Simulated Annealing (SA) algorithms: the first aims to reduce the total number of crossings, while the second improves the k-value. To obtain a good initial solution, we first applied tools from the OGDF library, which helped reduce crossings. The challenge consisted of nine instances to optimize. Our approach achieved the best results on eight out of nine instances - sharing the top score twice with other teams and ranking first alone in six cases. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julien Bianchetti and Laurent Moalic 2025 Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GD.2025.43 urn:nbn:de:0030-drops-250293 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.43 eng https://creativecommons.org/licenses/by/4.0/legalcode