Vahid Roostapour

Pareto Optimization for Subset Selection with Dynamic Cost Constraints

Frank Neumann, Tobias Friedrich, Vahid Roostapour, 2018, AAAI.

Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem

Mojgan Pourhassan, Frank Neumann, Vahid Roostapour, 2019, Theor. Comput. Sci..

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments pdf

Mojgan Pourhassan, Frank Neumann, Vahid Roostapour, 2018, Theory of Evolutionary Computation.

Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem

Mojgan Pourhassan, Frank Neumann, Vahid Roostapour, 2017, 2017 IEEE Symposium Series on Computational Intelligence (SSCI).

Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem

Jakob Bossek, Vahid Roostapour, Frank Neumann, 2020, GECCO.

On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem

Frank Neumann, Vahid Roostapour, Aneta Neumann, 2018, PPSN.

Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem

Vahid Roostapour, Mansoor Davoodi Monfared, Iman Kiarazm, 2015, TTCS.

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints

F. Neumann, Aneta Neumann, Vahid Roostapour, 2020, Theor. Comput. Sci..

Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem pdf

Vahid Roostapour, Frank Neumann, Aneta Neumann, 2020, ArXiv.

Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees

Mojgan Pourhassan, Wanru Gao, Frank Neumann, 2019, EMO.