Jonathan Gadea Harder

Research Interests

• graph theory
• graph algorithms
• evolutionary algorithms
• combinatorial optimization

Teaching

As Advisor

• Bachelor's thesis of Jacob Schäfer ('23)

As Teaching Assistant

• Mathematik 2 ('23)

As Tutor

• Graphenalgorithmen('21/22)

Publications

2024

•  

  Harder, Jonathan Gadea; Kötzing, Timo; Li, Xiaoyue; Radhakrishnan, Aishwarya; Ruff, JanoschRun Time Bounds for Integer-Valued OneMax FunctionsGenetic and Evolutionary Computation Conference (GECCO ’24) 2024

  [ ][ DOI ][ Download ]

2023

•  

  Gadea Harder, Jonathan; Krogmann, Simon; Lenzner, Pascal; Skopalik, AlexanderStrategic Resource Selection with Homophilic AgentsInternational Joint Conference on Artificial Intelligence (IJCAI) 2023: 2701–2709

  [ ][ ][ URL ][ DOI ][ Download ]

2021

•  

  Berger, Julian; Böther, Maximilian; Doskoč, Vanja; Gadea Harder, Jonathan; Klodt, Nicolas; Kötzing, Timo; Lötzsch, Winfried; Peters, Jannik; Schiller, Leon; Seifert, Lars; Wells, Armin; Wietheger, SimonLearning Languages with Decidable HypothesesComputability in Europe (CiE) 2021: 25–37

  [ ][ ][ URL ][ DOI ][ Download ]