Skip to main content

Anna Adamaszek

Department of Computer Science and

Centre for Discrete Mathematics and its Applications (DIMAP)

University of Warwick, Coventry CV4 7AL, United Kingdom


I am a PhD student and my supervisor is Prof. Artur Czumaj.

I work mainly in approximation algorithms, online algorithms, graph theory and combinatorics.



Publications

  1. A. Adamaszek, A. Czumaj, M. Englert, H. Räcke, Optimal Online Buffer Scheduling for Block Devices. To appear in Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12)
  2. A. Adamaszek, A. Czumaj, M. Englert, H. Räcke, An O(log k)-Competitive Algorithm for Generalized Caching. In Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA'12), pages 1681-1689, SIAM, Philadelphia, PA, 2012.
  3. A. Adamaszek, A. Czumaj, A. Lingas, J. O. Wojtaszczyk, Approximation Schemes for Capacitated Geometric Network Design, In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11), pages 25-36, LNCS, Springer-Verlag, Berlin, Heidelberg, 2011 (PDF)
  4. A. Adamaszek, A. Czumaj, M. Englert, H. Räcke, Almost Tight Bounds for Reordering Buffer Management, In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC'11), pages 607-616, ACM Press, New York, NY, 2011
  5. A. Adamaszek, M. Adamaszek, Uniqueness of graph square roots of girth six, Electronic Journal of Combinatorics 18 (2011), #P139 (journal version, preprint)
  6. A. Adamaszek, A. Popa, Approximation and hardness results for the maximum edge q-coloring problem, In Part II of Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC'10), pages 132-143, LNCS, Springer-Verlag, Berlin, Heidelberg, 2010 (PDF)
  7. A. Adamaszek, M. Adamaszek, Large-girth roots of graphs, Proc. 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010) (PDF, slides)
  8. A. Adamaszek, M. Adamaszek, Combinatorics of the change-making problem, European Journal of Combinatorics, Vol.31 (1), January 2010, p. 47-63 (PDF)
  9. A. Adamaszek, A. Czumaj, A. Lingas, PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k, In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09), pages 994-1003, LNCS, Springer-Verlag, Berlin, Heidelberg, 2009 (PDF, slides)
  10. M. Adamaszek, P. Chrzastowski-Wachtel, A. Niewiarowska, VIPER, a Student-friendly Interpreter of Pascal , Informatics Education - Supporting Computational Thinking, Proc. ISSEP 2008, LNCS 5090, pp. 192-203 (PDF and VIPER)
  11. A. Niewiarowska, Projective, Affine and Euclidean Theorem about Conics (in Polish), M.Sc. in Mathematics, 2007
  12. A. Niewiarowska, Hardness of Approximation of NP-hard Problems (in Polish), M.Sc. in Computer Science, 2006

Teaching

  • 2008/09: Data Structures and Algorithms (CS243)
  • 2008/09: Algorithm Design (CS244) 
  • 2009/10: Complexity of Algorithms (CS301)
  • 2009/10, 2010/11, 2011/12: Algorithmic Game Theory (CS409)
  • 2010/11: Discrete Mathematics and its Applications 1 (CS136)

Anna Adamaszek

A dot M dot Adamaszek at warwick dot ac dot uk