Mojgan Pourhassan

According to our database, Mojgan Pourhassan authored at least 17 papers between 2014 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint.

Frank Neumann, Mojgan Pourhassan, Carsten Witt

Algorithmica, 2021

2020

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.

Frank Neumann, Mojgan Pourhassan, Vahid Roostapour

Proceedings of the Theory of Evolutionary Computation, 2020

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem.

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Theor. Comput. Sci., 2020

2019

Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.

Mojgan Pourhassan, Feng Shi, Frank Neumann

Evol. Comput., 2019

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.

Mojgan Pourhassan, Frank Neumann

Evol. Comput., 2019

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

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

CoRR, 2019

Analysis of baseline evolutionary algorithms for the packing while travelling problem.

Vahid Roostapour, Mojgan Pourhassan, Frank Neumann

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

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

Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Proceedings of the Evolutionary Multi-Criterion Optimization, 2019

2018

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.

Vahid Roostapour, Mojgan Pourhassan, Frank Neumann

CoRR, 2018

2017

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

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms.

Mojgan Pourhassan, Tobias Friedrich, Frank Neumann

Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

2016

A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.

Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan

Evol. Comput., 2016

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem.

Mojgan Pourhassan, Feng Shi, Frank Neumann

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

2015

On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem.

Mojgan Pourhassan, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms.

Mojgan Pourhassan, Wanru Gao, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem.

Wanru Gao, Mojgan Pourhassan, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.

Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan

CoRR, 2014