Ask Questions Directly on WhatsApp here.

WhatsApp Broadcast Group
Scholarships in 2027 (Bachelor, Master, PhD) for International Students

PhD Studentship in Algorithms and Complexity 2026 at University of Leeds

Are you passionate about theoretical computer science and solving complex algorithmic challenges? Here’s your chance to dive into one of the most intellectually stimulating PhD opportunities in the UK!

The School of Computer Science at the University of Leeds invites applications for a fully funded 3.5-year PhD Studentship in Algorithms and Complexity under the supervision of Dr. Fahad Panolan — a scholar recognized for his cutting-edge research in parameterized complexity and approximation.


About the Project

The Algorithms Group at Leeds is offering a prestigious opportunity to explore Parameterized Complexity and Approximation, a dynamic and expanding field of theoretical computer science. This PhD project focuses on developing efficient parameterized approximation algorithms and preprocessing (kernelization) methods for NP-hard graph problems — foundational work that has real-world applications across optimization, network analysis, and artificial intelligence.

If you have a strong mathematical background and a passion for algorithmic research, this is your chance to contribute to groundbreaking advancements in computational theory.


Funding and Benefits

The award includes:

  • Full academic fee coverage for 3.5 years
  • Annual tax-free maintenance grant at the standard UKRI rate of £20,780
  • Continued maintenance allowance for up to six months in the writing-up phase
  • An inclusive academic environment committed to equality, excellence, and innovation

Please note that travel, research, or conference expenses are not covered by this studentship. A small overtime fee (£340 for 2025/26) applies for the final writing-up year.


Who Can Apply?

Applicants must hold at least a First Class or Upper Second Class British Bachelor’s Honours degree (or equivalent) in Computer Science or Mathematics. Ideal candidates will demonstrate:

  • Strong mathematical and analytical skills
  • A solid understanding of discrete algorithms
  • A keen interest in complexity theory and problem-solving

Although the studentship is open only to UK nationals, the University of Leeds encourages applications from diverse backgrounds, including underrepresented groups in computing and STEM.


English Language Requirements

For those whose first language is not English, the minimum requirement is an IELTS score of 6.5 overall, with 6.5 in writing and 6.0 in all other components. Equivalent qualifications are accepted, but the test must be valid within two years of the course start date.


How to Apply?

Applications must be submitted through the University of Leeds Online Application Portal.
In your application:

  • Select PhD in Computer Science under “Planned Course of Study.”
  • In the Research Information section, specify “PhD Studentship in Algorithms and Complexity (PGR-P-2280)” and Dr. Fahad Panolan as your proposed supervisor.
  • In the Finance section, mention the School of Computer Science Scholarship 2025/26 as your funding source.

Documents required by 30 January 2026:

Early applications are strongly encouraged, as the position may close sooner if a suitable candidate is appointed. Applicants are also advised to contact Dr. Panolan informally before submitting their formal application.


Application Dates to Remember

Application Deadline: Friday, 30 January 2026
Project Start Date: Wednesday, 1 October 2025.

Yousaf Saeed

Yousaf Saeed is the founder of daadscholarship.com and an international education journalist covering scholarships, fellowships and global study opportunities. A recipient of three fully funded international scholarships, he combines firsthand application experience with official-source research to explain funding, eligibility and application procedures. His growing community includes over 200,000 WhatsApp channel subscribers, 120,000+ Facebook followers and 60,000+ LinkedIn followers.

Related Articles

Back to top button