Rieskamp, Jonas, et al. “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), 2023.
LibreCat: /record/33490

Bossek, Jakob, et al. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.”10.1145/3583131.3590384__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2023, pp. 248–256, doi:10.1145/3583131.3590384.
LibreCat: /record/48869
DOI: 10.1145/3583131.3590384

Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?”10.1016/j.tcs.2023.113757__Theoretical Computer Science, 2023, p. 113757, doi:10.1016/j.tcs.2023.113757.
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Moura, Lucia, et al. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57, doi:10.4230/DagRep.13.4.40.
LibreCat: /record/52127
DOI: 10.4230/DagRep.13.4.40

Nikfarjam, Adel, et al. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.”10.1007/978-3-031-14714-2_17__Parallel Problem Solving from Nature (PPSN XVII), edited by Günter Rudolph et al., Springer International Publishing, 2022, pp. 237–249, doi:10.1007/978-3-031-14714-2_17.
LibreCat: /record/48894
DOI: 10.1007/978-3-031-14714-2_17

Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.”10.1016/j.tcs.2020.10.037__Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1016/j.tcs.2020.11.009__Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.”https://doi.org/10.1016/j.cor.2021.105489__Computers &; Operations Research, vol. 136, 2021, p. 105489, doi:https://doi.org/10.1016/j.cor.2021.105489.
LibreCat: /record/46318
DOI: https://doi.org/10.1016/j.cor.2021.105489

Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”10.1145/3449639.3459364__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 556–564, doi:10.1145/3449639.3459364.
LibreCat: /record/48853
DOI: 10.1145/3449639.3459364

Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.”10.1145/3449639.3459363__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 198–206, doi:10.1145/3449639.3459363.
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363

Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.
LibreCat: /record/48862

Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences for More than Just Two Algorithms.”10.1145/3449726.3463165__Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, 2021, pp. 1423–1432, doi:10.1145/3449726.3463165.
LibreCat: /record/48876
DOI: 10.1145/3449726.3463165

Nikfarjam, Adel, et al. “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.”10.1145/3449639.3459384__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 600–608, doi:10.1145/3449639.3459384.
LibreCat: /record/48893
DOI: 10.1145/3449639.3459384

Neumann, Aneta, et al. “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.”10.1145/3449639.3459385__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 261–269, doi:10.1145/3449639.3459385.
LibreCat: /record/48891
DOI: 10.1145/3449639.3459385

Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.
LibreCat: /record/48892

Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”10.1007/s00453-021-00838-3__Algorithmica, vol. 83, no. 10, 2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3.
LibreCat: /record/48854
DOI: 10.1007/s00453-021-00838-3

Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.”10.1145/3377930.3390174__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1277–1285, doi:10.1145/3377930.3390174.
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.”10.1145/3377930.3390243__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243.
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.”10.1145/3377930.3390146__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146.
LibreCat: /record/48845
DOI: 10.1145/3377930.3390146

Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”10.1007/978-3-030-58112-1_24__Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020, pp. 346–359, doi:10.1007/978-3-030-58112-1_24.
LibreCat: /record/48852
DOI: 10.1007/978-3-030-58112-1_24

Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.”10.1145/3377930.3389844__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 681–689, doi:10.1145/3377930.3389844.
LibreCat: /record/48879
DOI: 10.1145/3377930.3389844

Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.”10.1145/3377930.3390168__Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.
LibreCat: /record/48895
DOI: 10.1145/3377930.3390168

Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.”10.1109/CSCloud/EdgeCom.2019.000-9__2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”10.4230/LIPICS.ICALP.2019.150__Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.”10.1145/3321707.3321792__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792

Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”10.1109/TCC.2015.2487964__Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1, doi:10.1109/TCC.2015.2487964.
LibreCat: /record/17657
DOI: 10.1109/TCC.2015.2487964

Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic.” Australasian Conference on Information Systems, 2015, pp. 1–13.
LibreCat: /record/5678

Bossek, Jakob, et al. “Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement.”10.1145/2739480.2754673__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2015, pp. 1319–1326, doi:10.1145/2739480.2754673.
LibreCat: /record/48838
DOI: 10.1145/2739480.2754673

Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.”10.1145/2739480.2754705__Proceedings of the Genetic and Evolutionary Computation Conference , Association for Computing Machinery, 2015, pp. 425–432, doi:10.1145/2739480.2754705.
LibreCat: /record/48887
DOI: 10.1145/2739480.2754705

Sprock, Christian, and Walter Sextro. “Time-Efficient Dynamic Analysis of Structures Exhibiting Nonlinear Peak Bending.”10.1109/I2MTC.2014.6860760__Instrumentation and Measurement Technology Conference (MTC) Proceedings, 2014 IEEE International, 2014, pp. 320–24, doi:10.1109/I2MTC.2014.6860760.
LibreCat: /record/9889
DOI: 10.1109/I2MTC.2014.6860760

Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”10.1109/TNET.2012.2227792__Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71, doi:10.1109/TNET.2012.2227792.
LibreCat: /record/17663
DOI: 10.1109/TNET.2012.2227792

Nallaperuma, Samadhi, et al. “A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem.”10.1145/2460239.2460253__Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, Association for Computing Machinery, 2013, pp. 147–160, doi:10.1145/2460239.2460253.
LibreCat: /record/46388
DOI: 10.1145/2460239.2460253

Klobedanz, Kay, et al. “A Reconfiguration Approach for Faul-Tolerant FlexRay Networks.”10.1109/DATE.2011.5763022__Proceedings of DATE’11, IEEE, 2011, doi:10.1109/DATE.2011.5763022.
LibreCat: /record/37006
DOI: 10.1109/DATE.2011.5763022

Finkbeiner, Josef, et al. “Applying Heuristic Methods for Job Scheduling in Storage Markets.” 18th European Conference on Information Systems (ECIS 2010), 2010.
LibreCat: /record/5685

Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware Evolution.”10.1109/ahs.2007.73__Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007), IEEE, 2007, pp. 447–54, doi:10.1109/ahs.2007.73.
LibreCat: /record/6508
DOI: 10.1109/ahs.2007.73

Warsitz, Ernst, and Reinhold Haeb-Umbach. “Acoustic Filter-and-Sum Beamforming by Adaptive Principal Component Analysis.”10.1109/ICASSP.2005.1416129__IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005), vol. 4, 2005, p. iv/797-iv/800 Vol. 4, doi:10.1109/ICASSP.2005.1416129.
LibreCat: /record/11930
DOI: 10.1109/ICASSP.2005.1416129

Klüners, Jürgen. “Algorithms for Function Fields.” Experiment. Math. , vol. 11, no. 2, Elsevier BV, 2002, pp. 171–81.
LibreCat: /record/35954

Lieb, M., and Reinhold Haeb-Umbach. “LDA Derived Cepstral Trajectory Filters in Adverse Environmental Conditions.”10.1109/ICASSP.2000.859157__IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000), vol. 2, 2000, pp. - vol.2, doi:10.1109/ICASSP.2000.859157.
LibreCat: /record/11869
DOI: 10.1109/ICASSP.2000.859157