Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem. - Vahid Roostapour; Iman Kiarazm; Mansoor Davoodi (TTCS, 2015)

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

On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2018)

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)

Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. - Vahid Roostapour; Jakob Bossek; Frank Neumann 001 (GECCO, 2020)

Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (CoRR, 2020)

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)

Pareto optimization for subset selection with dynamic cost constraints. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (Artif. Intell., 2022)

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (Theor. Comput. Sci., 2022)