Mojgan Pourhassan

21 papers A 6C 1Journal 11Unranked 2

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. Algorithmica Frank Neumann, Mojgan Pourhassan, Carsten Witt
2020	—	`ch.`	Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Theory of Evolutionary Computation Frank Neumann, Mojgan Pourhassan, Vahid Roostapour
2020	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. CoRR Frank Neumann, Mojgan Pourhassan, Carsten Witt
2020	J	`jnl`	Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. Theor. Comput. Sci. Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2019	J	`jnl`	Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem. CoRR Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2019	A	`conf`	Analysis of baseline evolutionary algorithms for the packing while travelling problem. FOGA Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2019	A	`conf`	Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. GECCO Frank Neumann, Mojgan Pourhassan, Carsten Witt
2019	J	`jnl`	Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. Evol. Comput. Mojgan Pourhassan, Feng Shi, Frank Neumann
2019	C	`conf`	Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees. EMO Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2019	J	`jnl`	Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem. CoRR Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2019	J	`jnl`	Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem. Evol. Comput. Mojgan Pourhassan, Frank Neumann
2018	J	`jnl`	Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2017	—	`conf`	Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem. SSCI Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2017	A	`conf`	On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA Mojgan Pourhassan, Tobias Friedrich, Frank Neumann
2016	J	`jnl`	A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. Evol. Comput. Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan
2016	A	`conf`	Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. PPSN Mojgan Pourhassan, Feng Shi, Frank Neumann
2016	J	`jnl`	Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. CoRR Mojgan Pourhassan, Feng Shi, Frank Neumann
2015	A	`conf`	Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms. GECCO Mojgan Pourhassan, Wanru Gao, Frank Neumann
2015	A	`conf`	On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem. GECCO Mojgan Pourhassan, Frank Neumann
2015	—	`conf`	Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem. GECCO (Companion) Wanru Gao, Mojgan Pourhassan, Frank Neumann
2014	J	`jnl`	A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. CoRR Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan