default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMojgan Pourhassan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j5]Frank Neumann, Mojgan Pourhassan, Carsten Witt
:
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. Algorithmica 83(10): 3209-3237 (2021)- 2020
- [j4]Mojgan Pourhassan, Vahid Roostapour, Frank Neumann:
Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. Theor. Comput. Sci. 832: 20-41 (2020) - [p1]Frank Neumann, Mojgan Pourhassan, Vahid Roostapour:
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Theory of Evolutionary Computation 2020: 323-357 - [i6]Frank Neumann, Mojgan Pourhassan, Carsten Witt:
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. CoRR abs/2010.10885 (2020)
2010 – 2019
- 2019
- [j3]Mojgan Pourhassan, Frank Neumann:
Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem. Evol. Comput. 27(3): 525-558 (2019) - [j2]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. Evol. Comput. 27(4): 559-575 (2019) - [c9]Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann:
Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees. EMO 2019: 504-515 - [c8]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of baseline evolutionary algorithms for the packing while travelling problem. FOGA 2019: 124-132 - [c7]Frank Neumann, Mojgan Pourhassan, Carsten Witt:
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. GECCO 2019: 1506-1514 - [i5]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem. CoRR abs/1902.04692 (2019) - [i4]Mojgan Pourhassan, Vahid Roostapour, Frank Neumann:
Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem. CoRR abs/1903.02195 (2019) - 2018
- [i3]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs/1806.08547 (2018) - 2017
- [c6]Mojgan Pourhassan, Tobias Friedrich, Frank Neumann:
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA 2017: 37-44 - [c5]Mojgan Pourhassan, Vahid Roostapour, Frank Neumann:
Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem. SSCI 2017: 1-6 - 2016
- [j1]Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan:
A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. Evol. Comput. 24(1): 183-203 (2016) - [c4]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. PPSN 2016: 729-739 - [i2]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. CoRR abs/1604.01495 (2016) - 2015
- [c3]Mojgan Pourhassan, Frank Neumann:
On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem. GECCO 2015: 465-472 - [c2]Mojgan Pourhassan, Wanru Gao, Frank Neumann:
Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms. GECCO 2015: 903-910 - [c1]Wanru Gao, Mojgan Pourhassan, Frank Neumann:
Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem. GECCO (Companion) 2015: 1395-1396 - 2014
- [i1]Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan:
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. CoRR abs/1401.1905 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
