Anna Adamaszek successfully completed her PhD with the Thesis entitled "Approximation Algorithms for Geometric, Caching and Scheduling Problems", under the supervision of Prof Artur Czumaj.

Anna's PhD focuses on the study of approximation algorithms for optimization problems, one of the core areas of modern theoretical computer science. She has obtained research results in two areas: geometric optimisation algorithms and online algorithms. In the first topic, she presented new approximation algorithms for the capacitated location routing problem and the capacitated network design problem in the Euclidean plane. For online algorithms, she made a major progress in the study of two well known caching and scheduling problems: the generalized caching problem and the reordering buffer management problem. Her research has been presented in several most prestigious conferences in the field, including STOC'2011, ICALP'2011, and SODA'2012.

After completing PhD in Warwick, Ania moved to Germany, where she has been awarded a prestigious Lise-Meitner-Award postdoctoral fellowship at the Max-Planck-Institut für Informatik in Saarbrücken.