Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
39 Publications
2023 | Conference Paper | LibreCat-ID: 33490
Rieskamp J, Hofeditz L, Mirbabaie M, Stieglitz S. Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research. In: Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS). ; 2023.
LibreCat
| Download (ext.)
2023 | Conference Paper | LibreCat-ID: 48869
Bossek J, Neumann A, Neumann F. On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’23. Association for Computing Machinery; 2023:248–256. doi:10.1145/3583131.3590384
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 48871
Bossek J, Sudholt D. Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science. Published online 2023:113757. doi:10.1016/j.tcs.2023.113757
LibreCat
| DOI
2023 | Report | LibreCat-ID: 52127
Moura L, Nakic A, Östergård P, Wassermann A, Weiß C. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Vol 13, Issue 4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:40-57. doi:10.4230/DagRep.13.4.40
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 48894
Nikfarjam A, Neumann A, Bossek J, Neumann F. Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In: Rudolph G, Kononova AV, Aguirre H, Kerschke P, Ochoa G, Tu\v sar T, eds. Parallel Problem Solving from Nature (PPSN XVII). Lecture Notes in Computer Science. Springer International Publishing; 2022:237–249. doi:10.1007/978-3-031-14714-2_17
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22510
Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. Theoretical Computer Science. 2021;852:41-60. doi:10.1016/j.tcs.2020.10.037
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science. 2021;852:29-40. doi:10.1016/j.tcs.2020.11.009
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 46318
Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. Computers & Operations Research. 2021;136:105489. doi:https://doi.org/10.1016/j.cor.2021.105489
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48853
Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association for Computing Machinery; 2021:556–564. doi:10.1145/3449639.3459364
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48860
Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363
LibreCat
| DOI