
The Library
Browse by Warwick Author
![]() | Up a level |
Number of items: 12.
2018
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke , Harald (2018) An O(log k)-competitive algorithm for generalized caching. ACM Transactions on Algorithms , 15 (1). pp. 1-18. 6. doi:10.1145/3280826
Adamaszek, Anna, Czumaj, Artur, Lingas, Andrzej and Wojtaszczyk, Jakub Onufry (2018) Approximation Schemes for Capacitated Geometric Network Design. SIAM Journal on Discrete Mathematics, 32 (4). pp. 2720-2746. doi:10.1137/16M1108005
2012
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. ISSN 9781611972108.
2011
Adamaszek, Anna and Adamaszek, Michał (2011) Uniqueness of graph square roots of girth six. The Electronic Journal of Combinatorics, Vol.18 (No.1). P139 .
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. ISSN 9781450306911. doi:10.1145/1993636.1993717
2010
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. doi:10.1142/S0129054110007623
Adamaszek, Anna and Adamaszek, Michał (2010) Large-girth roots of graphs. In: 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Nancy, France, 1-8 Feb 2010. Published in: Leibniz International Proceedings in Informatics (LIPIcs), Volume 5 pp. 35-46. ISBN 9783939897163. ISSN 1868-8969. doi:10.1137/100792949
Adamaszek, Anna and Adamaszek, Michał (2010) Combinatorics of the change-making problem. European Journal of Combinatorics, Vol.31 (No.1). pp. 47-63. doi:10.1016/j.ejc.2009.05.002
Adamaszek, Anna and Adamaszek, Michał (2010) Large-girth roots of graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.4). pp. 1501-1514. doi:10.1137/100792949
2009
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. ISBN 978-3-642-10630-9. ISSN 0302-9743. doi:10.1007/978-3-642-10631-6_100
2008
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. doi:10.1007/978-3-540-69924-8_18
This list was generated on Thu Aug 11 13:13:55 2022 BST.