Dr Isolde Adler

Dr Isolde Adler


Before joining the University of Leeds in 2016 she was a Junior Professor at Goethe University Frankfurt (2009-2016), a postdoctoral researcher at the University of Bergen in Norway (2008/09) and at Humboldt University of Berlin (2006-2008), and a visiting professor at Humboldt University of Berlin (2008). She obtained her PhD from Albert Ludwig University of Freiburg in 2006.

Dr Adler is a lead collaborator in "Fast and Accurate! Foundations and Guarantees for Algorithms and AI (White Rose FGAA)", a White Rose Collaboration to provide new algorithms for big data sets and networks that are extremely fast and come with accuracy and performance guarantees.


  • Programme Manager for Computer Science with Mathematics

Research interests

Both Graph Theory and Logic in Computer Science form the basis of her research interests. She is fascinated by the interplay between the combinatorial structure of graphs and discrete models on the one hand, and their algorithmic properties on the other hand. Furthermore, she likes the challenge of problems that are computationally hard but nevertheless have to be solved in practice. While based in Theory, she also enjoys bridging the gap to practical applications in different fields.

Her research revolves around

The Structure of Graphs and Hypergraphs

Logic and Model Theory

Algorithms and (Parameterised) Complexity

Algorithmic Meta-Theorems

Database Theory

Model Checking

Combinatorial Games

Property Testing

Professional memberships

  • Programme Committee Member of ICDT 2019, ISAAC 2017, PACE 2016, STACS 2016, WG 2016, SOFSEM 2012, CSL 2010
  • Member of the Steering Committee of ReLaX (Indo-French Research Lab in Computer Science)

Research groups and institutes

  • Algorithms and Complexity
<h4>Postgraduate research opportunities</h4> <p>We welcome enquiries from motivated and qualified applicants from all around the world who are interested in PhD study. Our <a href="https://phd.leeds.ac.uk">research opportunities</a> allow you to search for projects and scholarships.</p>