Vahid Roostapour

Mr Vahid Roostapour

Higher Degree by Research Candidate

PhD Student

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.

    Expand

  • Journals
    Year Citation
    2019 Pourhassan, M., Roostapour, V., & Neumann, F. (2019). Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. Theoretical Computer Science.
    DOI
    — Roostapour, V., Pourhassan, M., & Neumann, F. (n.d.). Analysis of Baseline Evolutionary Algorithms for the Packing While
    Travelling Problem.
    DOI

  • Book Chapters
    Year Citation
    2018 Roostapour, V., Pourhassan, M., & Neumann, F. (2018). Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.. In Unknown Book (Vol. abs/1806.08547).

  • Conference Papers
    Year Citation
    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).
    DOI
    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
    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 Scopus2
    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). Tehran, Iran: Springer.
    DOI Scopus2

  • Internet Publications
    Year Citation
    — Roostapour, V., Neumann, A., Neumann, F., & Friedrich, T. (n.d.). Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
  • Position: PhD Student
  • Phone: 83134729
  • Email: vahid.roostapour@adelaide.edu.au
  • Campus: North Terrace
  • Building: Ingkarni Wardli, floor 4
  • Room: 4 52
  • Org Unit: School of Computer Science
Connect With Me
External Profiles