Dr Sofiat Olaosebikan

  • Lecturer in Algorithms and Complexity (School of Computing Science)

email: Sofiat.Olaosebikan@glasgow.ac.uk

Room 407A, Sir Alwyn Williams Building, School of Computing Science, University of Glasgow, Glasgow, G12 8RZ

Import to contacts

ORCID iDhttps://orcid.org/0000-0002-8003-7887

Biography

I joined the academic staff as a lecturer in August 2020. I completed my PhD (awarded July 2020) in Computing Science from the University of Glasgow, under the supervision of Prof David Manlove. My work leveraged graph-theoretic tools and optimisation techniques to aid the design of efficient algorithms for matching problems. My thesis is entitled The Student-Project Allocation Problem: Structure and Algorithms. 

Prior to this, I obtained an MSc in Mathematical Sciences from the African Institute for Mathematical Sciences (AIMS) in 2015, and a BSc in Mathematics from the University of Ibadan in 2012. My journey from being a major in mathematics to becoming a researcher in computing science is fuelled by my passion for problem solving and programming.

My ongoing work focusses on the design of efficient algorithms for open problems in matching theory. I have published my research findings in peer-reviewed scientific journals, and I have presented my work at several international conferences. In 2023, I was endorsed as an Exceptional Promise under the UK Global Talent by the Royal Academy of Engineering. 

On the outreach side, I am founder and lead of Computer Science Academy Africa (CSA Africa) - an initiative aimed at empowering young Africans with computing skills. So far, my team and I have received funding of over £120,000, which has enabled us train over 500 participants via our Python programming workshops in Nigeria (2018 and 2022), Rwanda (2019), and online (2021). In recognition of the transformational change engineered by this initiative, I was named as a University of Glasgow Future World Changer in 2018. In addition, I was selected as one of the Highly Commended Finalist, Top 50 Women in Engineering 2022: Inventors and Innovators - awarded by the Womens' Engineering Society.

Research interests

I am motivated by research problems arising from practical applications. Within the School, I am a member of the Formal Analysis, Theory and Algorithms (FATA) research group. My interests include:

  • algorithms design using graph theory;
  • stable matchings;
  • combinatorial optimisation;
  • computational complexity;
  • algorithm engineering;
  • experimentation.

In addition to my research on matching problems, I have worked with researchers in the School of Engineering at the University of Glasgow, on the design of efficient algorithms for future wireless communications. Moreover, I am also currently working on bridging the gap between reinforcement learning and matching theory.

Publications

List by: Type | Date

Jump to: 2022 | 2020 | 2018
Number of items: 7.

2022

Al Ayidh, A., Sambo, Y. , Olaosebikan, S. , Ansari, S. and Imran, M. A. (2022) Antenna selection based on matching theory for uplink cell-free millimetre wave massive multiple input multiple output systems. Telecom, 3(3), pp. 448-466. (doi: 10.3390/telecom3030024)

Tshukudu, E., Olaosebikan, S. , Omeke, K., Pancheva, A., McQuistin, S. , Jilantikiri, L. J. and Al-anqoudi, M. (2022) Broadening Participation in Computing: Experiences of an online programming workshop for African Students. In: 27th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2022), Dublin, Ireland, 8-13 July 2022, pp. 393-399. ISBN 9781450392013 (doi: 10.1145/3502718.3524773)

Olaosebikan, S. and Manlove, D. (2022) Super-stability in the student-project allocation problem with ties. Journal of Combinatorial Optimization, 43(5), pp. 1203-1239. (doi: 10.1007/s10878-020-00632-x)

Manlove, D. , Milne, D. and Olaosebikan, S. (2022) Student-project allocation with preferences over projects: algorithmic and experimental results. Discrete Applied Mathematics, 308, pp. 220-234. (doi: 10.1016/j.dam.2020.08.015)

2020

Olaosebikan, S. and Manlove, D. (2020) An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties. In: 6th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Sangareddy, India, 13-15 Feb 2020, pp. 384-399. ISBN 9783030392185 (doi: 10.1007/978-3-030-39219-2_31)

2018

Manlove, D. , Milne, D. and Olaosebikan, S. (2018) An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects. In: International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco, 11-13 Apr 2018, pp. 313-325. ISBN 9783319961507 (doi: 10.1007/978-3-319-96151-4_27)

Olaosebikan, S. and Manlove, D. (2018) Super-stability in the Student-Project Allocation Problem with Ties. In: 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018), Atlanta, GA, USA, 15-17 Dec 2018, pp. 357-371. ISBN 9783030046507 (doi: 10.1007/978-3-030-04651-4_24)

This list was generated on Thu May 23 03:27:27 2024 BST.
Number of items: 7.

Articles

Al Ayidh, A., Sambo, Y. , Olaosebikan, S. , Ansari, S. and Imran, M. A. (2022) Antenna selection based on matching theory for uplink cell-free millimetre wave massive multiple input multiple output systems. Telecom, 3(3), pp. 448-466. (doi: 10.3390/telecom3030024)

Olaosebikan, S. and Manlove, D. (2022) Super-stability in the student-project allocation problem with ties. Journal of Combinatorial Optimization, 43(5), pp. 1203-1239. (doi: 10.1007/s10878-020-00632-x)

Manlove, D. , Milne, D. and Olaosebikan, S. (2022) Student-project allocation with preferences over projects: algorithmic and experimental results. Discrete Applied Mathematics, 308, pp. 220-234. (doi: 10.1016/j.dam.2020.08.015)

Conference Proceedings

Tshukudu, E., Olaosebikan, S. , Omeke, K., Pancheva, A., McQuistin, S. , Jilantikiri, L. J. and Al-anqoudi, M. (2022) Broadening Participation in Computing: Experiences of an online programming workshop for African Students. In: 27th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2022), Dublin, Ireland, 8-13 July 2022, pp. 393-399. ISBN 9781450392013 (doi: 10.1145/3502718.3524773)

Olaosebikan, S. and Manlove, D. (2020) An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties. In: 6th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Sangareddy, India, 13-15 Feb 2020, pp. 384-399. ISBN 9783030392185 (doi: 10.1007/978-3-030-39219-2_31)

Manlove, D. , Milne, D. and Olaosebikan, S. (2018) An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects. In: International Symposium on Combinatorial Optimization (ISCO 2018), Marrakesh, Morocco, 11-13 Apr 2018, pp. 313-325. ISBN 9783319961507 (doi: 10.1007/978-3-319-96151-4_27)

Olaosebikan, S. and Manlove, D. (2018) Super-stability in the Student-Project Allocation Problem with Ties. In: 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018), Atlanta, GA, USA, 15-17 Dec 2018, pp. 357-371. ISBN 9783030046507 (doi: 10.1007/978-3-030-04651-4_24)

This list was generated on Thu May 23 03:27:27 2024 BST.

Grants

Since 2018, CSA Africa has received funding of up to £120,000 from the following internal pockets

  • Global Challenges Research Fund (~£35,000)
  • Glasgow Knowledge Exchange Fund and EPSRC Impact Acceleration Account (£21,000)
  • UofG's International Partnership and Development Fund (£12,920)
  • UofG's Chancellors Fund (£12,500)
  • UofG's School of Computing Science (£40,000)
  • The Scottish Informatics and Computer Science Alliance (£1,000)
  • as well as external partners (Moragn Stanley, TriLite, RS Components, and ACM-Women).

I was lead applicant and a key contributor on all grant applications.

Supervision

I am open to taking on new PhD students. Please feel free to reach out to me, if you are interested in my research and in studying at the University of Glasgow. In your email please make sure to clearly tell me your motivation for wanting to do a PhD, why with me, and how does our research interests align. Also, include your

  • CV,
  • university transcripts, and
  • any dissertations or papers you may have written (it is okay if you do not have any publications at this stage).

Funding is available, but competitive. Some internal funding opportunities:

 

Below is a list of my current PhD students:

Teaching

COMPUTING SCIENCE 1P (COMPSCI1001, since 2020/21)

Additional information

Find out more on my personal website.