{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:47:04Z","timestamp":1770068824228,"version":"3.49.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"DFG project \u201cComputational Geometry: Solving Hard Optimization Problems\u201d","award":["FE407\/21-1"],"award-info":[{"award-number":["FE407\/21-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>\n            We give an overview of the 2022 Computational Geometry Challenge targeting the problem\n            <jats:sc>Minimum Partition into Plane Subsets<\/jats:sc>\n            , which consists of partitioning a given set of line segments into a minimum number of non-crossing subsets.\n          <\/jats:p>","DOI":"10.1145\/3604907","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T12:36:05Z","timestamp":1689251765000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6677-5090","authenticated-orcid":false,"given":"Phillip","family":"Keldenich","sequence":"additional","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1573-3496","authenticated-orcid":false,"given":"Dominik","family":"Krupke","sequence":"additional","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5928-1494","authenticated-orcid":false,"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[{"name":"Department for Simulation and Graphics, OvGU Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-030-68766-3_37","volume-title":"International Symposium on Graph Drawing and Network Visualization (GD\u201920)","author":"Aichholzer Oswin","year":"2020","unstructured":"Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, and Alexandra Weinberger. 2020. Plane spanning trees in edge-colored simple drawings of \\(K_{n}\\) . In International Symposium on Graph Drawing and Network Visualization (GD\u201920). 482\u2013489."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.014"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_1_5_2","article-title":"Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring","volume":"28","author":"Crombez Lo\u00efc","year":"2023","unstructured":"Lo\u00efc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Mom\u00e8ge, Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng. 2023. Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring. J. Experim. Algor. 28 (2023).","journal-title":"J. Experim. Algor."},{"key":"e_1_3_1_6_2","first-page":"71:1\u201371:8","volume-title":"Symposium on Computational Geometry (SoCG\u201922)","author":"Crombez Lo\u00efc","year":"2022","unstructured":"Lo\u00efc Crombez, Guilherme D. da Fonseca, Yan Gerard, and Aldo Gonzalez-Lorenzo. 2022. Shadoks approach to minimum partition into plane subgraphs. In Symposium on Computational Geometry (SoCG\u201922). 71:1\u201371:8."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2021.63"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668917"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dib.2020.105984"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00064"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"e_1_3_1_12_2","first-page":"73:1\u201373:7","volume-title":"Symposium on Computational Geometry (SoCG\u201922)","author":"Fontan Florian","year":"2022","unstructured":"Florian Fontan, Pascal Lafourcade, Luc Libralesso, and Benjamin Mom\u00e8ge. 2022. Local search with weighting schemes for the CG:SHOP 2022 competition. In Symposium on Computational Geometry (SoCG\u201922). 73:1\u201373:7."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21716"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2012.03.002"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109986"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1100.0436"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-030-19212-9_25","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Hebrard Emmanuel","year":"2019","unstructured":"Emmanuel Hebrard and George Katsirelos. 2019. A hybrid approach for exact coloring of massive graphs. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Louis-Martin Rousseau and Kostas Stergiou (Eds.). 374\u2013390."},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00439-8"},{"key":"e_1_3_1_21_2","volume-title":"Graph Coloring Problems","author":"Jensen Tommy R.","year":"2011","unstructured":"Tommy R. Jensen and Bjarne Toft. 2011. Graph Coloring Problems. John Wiley & Sons."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"e_1_3_1_24_2","volume-title":"A Guide to Graph Colouring: Algorithms and Applications (1st ed.)","author":"Lewis R. M. R.","year":"2015","unstructured":"R. M. R. Lewis. 2015. A Guide to Graph Colouring: Algorithms and Applications (1st ed.). Springer."},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/73"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.01.008"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00696.x"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.4.344"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/1141023.1705235"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9354-9"},{"key":"e_1_3_1_33_2","article-title":"Edge partitions of complete geometric graphs (part 1)","author":"Obenaus Johannes","year":"2021","unstructured":"Johannes Obenaus and Joachim Orthaber. 2021. Edge partitions of complete geometric graphs (part 1). arXiv preprint arXiv:2108.05159 (2021).","journal-title":"arXiv preprint arXiv:2108.05159"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.01.015"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.3.226"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.008"},{"key":"e_1_3_1_37_2","first-page":"74:1\u201374:8","volume-title":"Symposium on Computational Geometry (SoCG\u201922)","author":"Schidler Andr\u00e9","year":"2022","unstructured":"Andr\u00e9 Schidler. 2022. SAT-based local search for plane subgraph partitions. In Symposium on Computational Geometry (SoCG\u201922). 74:1\u201374:8."},{"key":"e_1_3_1_38_2","article-title":"SAT-based local search for plane subgraph partitions","volume":"28","author":"Schidler Andr\u00e9","year":"2023","unstructured":"Andr\u00e9 Schidler and Stefan Szeider. 2023. SAT-based local search for plane subgraph partitions. J. Experim. Algor. 28 (2023).","journal-title":"J. Experim. Algor."},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1090\/dimacs\/026\/17","article-title":"An improved algorithm for exact graph","volume":"26","author":"Sewell E. C.","year":"1996","unstructured":"E. C. Sewell. 1996. An improved algorithm for exact graph. Cliques, Color. Satisfiab.: Second DIMACS Implement. Chall. 26 (1996), 359.","journal-title":"Cliques, Color. Satisfiab.: Second DIMACS Implement. Chall."},{"key":"e_1_3_1_40_2","first-page":"72:1\u201372:6","volume-title":"Symposium on Computational Geometry (SoCG\u201922)","author":"Spalding-Jamieson Jack","year":"2022","unstructured":"Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng. 2022. Conflict-based local search for minimum partition into plane subgraphs. In Symposium on Computational Geometry (SoCG\u201922). 72:1\u201372:6."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.12.001"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0050060"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:05Z","timestamp":1750178765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":42,"alternative-id":["10.1145\/3604907"],"URL":"https:\/\/doi.org\/10.1145\/3604907","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]}}}