A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. - Dogan Corus; Per Kristian Lehre; Frank Neumann 001; Mojgan Pourhassan (CoRR, 2014)

Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem. - Wanru Gao; Mojgan Pourhassan; Frank Neumann 001 (GECCO (Companion), 2015)

Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms. - Mojgan Pourhassan; Wanru Gao; Frank Neumann 001 (GECCO, 2015)

On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem. - Mojgan Pourhassan; Frank Neumann 001 (GECCO, 2015)

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. - Mojgan Pourhassan; Feng Shi 003; Frank Neumann 001 (PPSN, 2016)

A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. - Dogan Corus; Per Kristian Lehre; Frank Neumann 001; Mojgan Pourhassan (Evol. Comput., 2016)

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. - Mojgan Pourhassan; Tobias Friedrich 001; Frank Neumann 001 (FOGA, 2017)

Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem. - Mojgan Pourhassan; Vahid Roostapour; Frank Neumann 001 (SSCI, 2017)

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. - Vahid Roostapour; Mojgan Pourhassan; Frank Neumann 001 (CoRR, 2018)

Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees. - Wanru Gao; Mojgan Pourhassan; Vahid Roostapour; Frank Neumann 001 (EMO, 2019)

Analysis of baseline evolutionary algorithms for the packing while travelling problem. - Vahid Roostapour; Mojgan Pourhassan; Frank Neumann 001 (FOGA, 2019)

Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem. - Mojgan Pourhassan; Vahid Roostapour; Frank Neumann 001 (CoRR, 2019)

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem. - Mojgan Pourhassan; Frank Neumann 001 (Evol. Comput., 2019)

Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. - Mojgan Pourhassan; Feng Shi 003; Frank Neumann 001 (Evol. Comput., 2019)

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. - Mojgan Pourhassan; Vahid Roostapour; Frank Neumann 001 (Theor. Comput. Sci., 2020)

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. - Frank Neumann 001; Mojgan Pourhassan; Vahid Roostapour (Theory of Evolutionary Computation, 2020)

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. - Frank Neumann 001; Mojgan Pourhassan; Carsten Witt (Algorithmica, 2021)