Vahid Roostapour

17 papers A* 1A 2C 1Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2022 J jnl
Pareto optimization for subset selection with dynamic cost constraints.
Artif. Intell.
Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2022 J jnl
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.
Theor. Comput. Sci.
Vahid Roostapour, Aneta Neumann, Frank Neumann
2020 — ch.
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.
Theory of Evolutionary Computation
Frank Neumann, Mojgan Pourhassan, Vahid Roostapour
2020 J jnl
Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem.
CoRR
Vahid Roostapour, Aneta Neumann, Frank Neumann
2020 J jnl
Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.
CoRR
Vahid Roostapour, Jakob Bossek, Frank Neumann
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
2020 A conf
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem.
GECCO
Vahid Roostapour, Jakob Bossek, 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
Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
AAAI
Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
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
2018 J jnl
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.
CoRR
Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2018 — conf
On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem.
PPSN (1)
Vahid Roostapour, Aneta Neumann, Frank Neumann
2018 J jnl
Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
CoRR
Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2017 — conf
Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem.
SSCI
Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2015 — conf
Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem.
TTCS
Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski