Prof. Dr. Tobias Friedrich


Scientific guests from the University of Adelaide

In 2017 there are in total eight weeks of mutual visits between our research group and the Optimisation and Logistics group at the University of Adelaide (four weeks in each direction). The scientific visits are co-funded by the German Research Foundation (DFG) and the Australian Research Council (ARC). In the upcoming two weeks Frank Neumann and Aneta Neumann are visiting us in Potsdam.

This close cooperation has already resulted in several publications this year:

  • ScalingUpLocalSearchForMinimumVertexCoverInLargeGraphsByParallelKernelization.pdf
    Gao, Wanru; Friedrich, Tobias; Kötzing, Timo; Neumann, Frank Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence (AUSAI) 2017
  • Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 2017: 561-586
  • p1407-shi_proc.pdf
    Shi, Feng; Schirneck, Martin; Friedrich, Tobias; Kötzing, Timo; Neumann, Frank Reoptimization Times of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1407-1414
  • 14809-64744-1-SM.pdf
    Friedrich, Tobias; Neumann, Frank What's Hot in Evolutionary Computation. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 5064-5066
  • p45-friedrich_foga17.pdf
    Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, Martin Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Foundations of Genetic Algorithms (FOGA) 2017: 45-54
  • p37-pourhassan_foga17.pdf
    Pourhassan, Mojgan; Friedrich, Tobias; Neumann, Frank On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. Foundations of Genetic Algorithms (FOGA) 2017: 37-44
  • 0001K017.pdf
    Friedrich, Tobias; Kötzing, Timo; Wagner, Markus A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 801-807
  • 2017cec-mvcportfolio.pdf
    Wagner, Markus; Friedrich, Tobias; Lindauer, Marius Improving local search in a minimum vertex cover solver for classes of networks. Congress on Evolutionary Computation (CEC) 2017