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. (2023). Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research. Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS). Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS).
LibreCat
| Download (ext.)
2023 | Conference Paper | LibreCat-ID: 48869
Bossek, J., Neumann, A., & Neumann, F. (2023). On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 248–256. https://doi.org/10.1145/3583131.3590384
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 48871
Bossek, J., & Sudholt, D. (2023). Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science, 113757. https://doi.org/10.1016/j.tcs.2023.113757
LibreCat
| DOI
2023 | Report | LibreCat-ID: 52127
Moura, L., Nakic, A., Östergård, P., Wassermann, A., & Weiß, C. (2023). Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161) (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/DagRep.13.4.40
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 48894
Nikfarjam, A., Neumann, A., Bossek, J., & Neumann, F. (2022). Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, & T. Tu\v sar (Eds.), Parallel Problem Solving from Nature (PPSN XVII) (pp. 237–249). Springer International Publishing. https://doi.org/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. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 46318
Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A. H., Wang, H., & Emmerich, M. (2021). Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. Computers & Operations Research, 136, 105489. https://doi.org/10.1016/j.cor.2021.105489
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48853
Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. https://doi.org/10.1145/3449639.3459364
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 48860
Bossek, J., & Neumann, F. (2021). Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 198–206. https://doi.org/10.1145/3449639.3459363
LibreCat
| DOI