Adamaszek, Anna (2012) Approximation algorithms for geometric, caching and scheduling problems. PhD thesis, University of Warwick.

Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2012) An O(log k)-competitive algorithm for generalized caching. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1681-1689.

Adamaszek, Anna and Adamaszek, Michał. (2011) Uniqueness of graph square roots of girth six. The Electronic Journal of Combinatorics, Vol.18 (No.1). P139 . ISSN 2150-959X

Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2011) Almost tight bounds for reordering buffer management. In: STOC'11 Symposium on Theory of Computing Conference (Co-located with FCRC 2011), San Jose, CA, USA, 6-8 Jun 2011. Published in: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing pp. 607-616.

Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej. (2010) PTAS for k-tour cover problem on the plane for moderately large values of k. International Journal of Foundations of Computer Science, Volume 21 (Number 6). pp. 893-904. ISSN 0129-0541

Adamaszek, Anna and Adamaszek, Michał. (2010) Combinatorics of the change-making problem. European Journal of Combinatorics, Vol.31 (No.1). pp. 47-63. ISSN 0195-6698

Adamaszek, Anna and Adamaszek, Michał. (2010) Large-girth roots of graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.4). pp. 1501-1514. ISSN 0895-4801

Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2009) PTAS for k-tour cover problem on the plane for moderately large values of k. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, December 16-18, 2009. Published in: Lecture Notes in Computer Science, 5878 pp. 994-1003.

Adamaszek, Michał, Chrząstowski-Wachtel, Piotr and Adamaszek, Anna. (2008) VIPER, a student-friendly visual interpreter of Pascal. Lecture Notes in Computer Science, Vol.5090 . pp. 192-203. ISSN 0302-9743