default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVahid Roostapour
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Vahid Roostapour
, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302: 103597 (2022)- [j2]Vahid Roostapour, Aneta Neumann, Frank Neumann:
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Theor. Comput. Sci. 924: 129-147 (2022) - 2020
- [j1]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) - [c7]Vahid Roostapour, Jakob Bossek, Frank Neumann:
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. GECCO 2020: 551-559 - [p1]Frank Neumann, Mojgan Pourhassan, Vahid Roostapour:
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Theory of Evolutionary Computation 2020: 323-357 - [i6]Vahid Roostapour, Jakob Bossek, Frank Neumann:
Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. CoRR abs/2004.10424 (2020) - [i5]Vahid Roostapour, Aneta Neumann, Frank Neumann:
Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. CoRR abs/2004.12574 (2020)
2010 – 2019
- 2019
- [c6]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI 2019: 2354-2361 - [c5]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 - [c4]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of baseline evolutionary algorithms for the packing while travelling problem. FOGA 2019: 124-132 - [i4]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem. CoRR abs/1902.04692 (2019) - [i3]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
- [c3]Vahid Roostapour, Aneta Neumann, Frank Neumann:
On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. PPSN (1) 2018: 158-169 - [i2]Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs/1806.08547 (2018) - [i1]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs/1811.07806 (2018) - 2017
- [c2]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 - 2015
- [c1]Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi:
Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem. TTCS 2015: 164-178
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:48 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:
