Vahid Roostapour

School of Computer Science

Faculty of Engineering, Computer and Mathematical Sciences

Vahid is a PhD student in The University of Adelaide since 2017 under supervision of Professor Neumann. He is doing research on "Bio-Inspired Computations for Problems with Dynamically Changing Constraints". He got his master in 2016 from IASBS as the top student again working on Optimization Problems and how to solve them with Deterministic Algorithms.

Career
Publications
Contact

Language Competencies

Language Competency

English Can read, write, speak, understand spoken and peer review

Language	Competency
English	Can read, write, speak, understand spoken and peer review

Education

Date	Institution name	Country	Title
2017	University of Adelaide	Australia	PhD of Computer Science
2013 - 2016	Institute for Advanced Studies in Basic Sciences	Iran	Master of Computer Science
2008 - 2013	University of Tehran	Iran	Bachelor of Computer Science

Research Interests

Analysis of Algorithms and Complexity Optimisation

Journals

Year	Citation
2020	Pourhassan, M., Roostapour, V., & Neumann, F. (2020). Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. Theoretical Computer Science, 832, 20-41. DOI
2020	Roostapour, V., Neumann, A., & Neumann, F. (2020). Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem.. CoRR, abs/2004.12574.
2020	Pourhassan, M., Roostapour, V., & Neumann, F. (2020). Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem.. Theor. Comput. Sci., 832, 20-41.

Book Chapters

Year	Citation
2020	Roostapour, V., Pourhassan, M., & Neumann, F. (2020). Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.. In B. Doerr, & F. Neumann (Eds.), Theory of Evolutionary Computation: Recent Developments in Discrete Optimization (Vol. abs/1806.08547, pp. 323-358). Cham, Switzerland: Springer. DOI Scopus3

Conference Papers

Year	Citation
2020	Roostapour, V., Bossek, J., & Neumann, F. (2020). Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference (GECCO'20) Vol. abs/2004.10424 (pp. 551-559). New York: Association for Computing Machinery. DOI
2019	Roostapour, V., Neumann, A., Neumann, F., & Friedrich, T. (2019). Pareto optimization for subset selection with dynamic cost constraints. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 33 (pp. 2354-2361). Honolulu, Hawaii: Association for the Advancement of Artificial Intelligence. DOI Scopus5
2019	Roostapour, V., Pourhassan, M., & Neumann, F. (2019). Analysis of baseline evolutionary algorithms for the packing while travelling problem. In FOGA '19: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms Vol. abs/1902.04692 (pp. 124-132). online: Association for Computing Machinery. DOI Scopus1
2019	Gao, W., Pourhassan, M., Roostapour, V., & Neumann, F. (2019). Runtime analysis of evolutionary multi-objective algorithms optimising the degree and diameter of spanning trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11411 LNCS (pp. 504-515). Switzerland: Springer Nature. DOI Scopus2
2018	Roostapour, V., Neumann, A., & Neumann, F. (2018). On the performance of baseline evolutionary algorithms on the dynamic knapsack problem. In A. Auger, C. M. Fonseca, N. Lourenço, P. Machado, L. Paquete, & D. Whitley (Eds.), Parallel Problem Solving from Nature - PPSN XV: 15th International Conference, Coimbra, Portugal, September 8-12, 2018, Proceedings, Part I Vol. 11101 LNCS (pp. 158-169). Cham: Springer. DOI Scopus14 WoS8
2018	Pourhassan, M., Roostapour, V., & Neumann, F. (2018). Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem. In Proceedings of the IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2017) Vol. 2018-January (pp. 1-6). NJ, USA: IEEE. DOI Scopus5
2016	Roostapour, V., Kiarazm, I., & Davoodi, M. (2016). Deterministic algorithm for 1-median 1-center two-objective optimization problem. In M. Hajiaghayi, & M. Mousavi (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9541 (pp. 164-178). Switzerland: Springer Nature. DOI Scopus2

Internet Publications

Year Citation

2019 Roostapour, V., Neumann, A., Neumann, F., & Friedrich, T. (2019). Pareto Optimization for Subset Selection with Dynamic Cost Constraints..

Year	Citation
2019	Roostapour, V., Neumann, A., Neumann, F., & Friedrich, T. (2019). Pareto Optimization for Subset Selection with Dynamic Cost Constraints..

Email: vahid.roostapour@adelaide.edu.au

Vahid Roostapour

Language Competencies

Education

Research Interests

Journals

Book Chapters

Conference Papers

Internet Publications

Connect With Me

External Profiles