Dr Sofiat Olaosebikan

  • Lecturer in Algorithms and Complexity (Computing Science)

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.

As much as I enjoy using my computing and mathematics skills to solve real-world problems, I am even more passionate about using my skills to help those that do not have the same opportunity I had. In 2018, I started the CSA Africa initiative to empower young Africa in STEM with computer programming skills. In recognition of the significance of this initiative, I was named as one of the University of Glasgow Future World Changers.

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 am currently working with researchers in the School of Engineering at the University of Glasgow, on the design of efficient algorithms for future wireless communications. This collaboration is exploring resource allocation problem in cell-free massive MIMO (the enabling technology for 6G).

Publications

List by: Type | Date

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

2022

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, (Accepted for Publication)

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)

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

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 Tue Jun 28 14:03:52 2022 BST.
Number of items: 6.

Articles

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)

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

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, (Accepted for Publication)

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 Tue Jun 28 14:03:52 2022 BST.

Grants

Since 2018, CSA Africa has received funding of up to £70,000 from UofG’s School of Computing Science, UofG’s Chancellor’s Fund, UofG’s GCRF Small Grants Fund, and the Scottish Informatics and Computer Science Alliance.

Supervision

  • Ayegba, Peace
    Efficient algorithms for resource allocation in wireless communication

Teaching

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

Additional information

Find out more on my personal website.