Mojgan Pourhassan
Mojgan Pourhassan
Lecturer of Computer Science, The University of Adelaide
Verified email at adelaide.edu.au
Title
Cited by
Cited by
Year
Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms
M Pourhassan, W Gao, F Neumann
Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015
212015
Parameterized analysis of multi-objective evolutionary algorithms and the weighted vertex cover problem
M Pourhassan, F Shi, F Neumann
International Conference on Parallel Problem Solving from Nature, 729-739, 2016
142016
A parameterised complexity analysis of bi-level optimisation with evolutionary algorithms
D Corus, PK Lehre, F Neumann, M Pourhassan
Evolutionary computation 24 (1), 183-203, 2016
132016
On the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problem
M Pourhassan, F Neumann
Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015
82015
Improved runtime analysis of RLS and (1+ 1) EA for the dynamic vertex cover problem
M Pourhassan, V Roostapour, F Neumann
Computational Intelligence (SSCI), 2017 IEEE Symposium Series on, 1-6, 2017
52017
On the use of the dual formulation for minimum weighted vertex cover in evolutionary algorithms
M Pourhassan, T Friedrich, F Neumann
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic …, 2017
52017
Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
M Pourhassan, F Neumann
Evolutionary computation, 1-35, 2018
42018
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
V Roostapour, M Pourhassan, F Neumann
arXiv preprint arXiv:1806.08547, 2018
42018
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
F Neumann, M Pourhassan, C Witt
Proceedings of the Genetic and Evolutionary Computation Conference, 1506-1514, 2019
32019
Runtime analysis of RLS and (1+ 1) EA for the dynamic weighted vertex cover problem
M Pourhassan, V Roostapour, F Neumann
Theoretical Computer Science, 2019
32019
Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem
V Roostapour, M Pourhassan, F Neumann
arXiv preprint arXiv:1902.04692, 2019
22019
Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem
W Gao, M Pourhassan, F Neumann
Proceedings of the Companion Publication of the 2015 Annual Conference on …, 2015
22015
Runtime Analysis of Evolutionary Multi-Objective Algorithms Optimizing the Degree and Diameter of Spanning Trees
W Gao, M Pourhassan, V Roostapour, F Neumann
2*
Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems
M Pourhassan
12017
The system can't perform the operation now. Try again later.
Articles 1–14