The Library

Browse by Warwick Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Official Date | Item Type | Funder | No Grouping
Number of items: 12.

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 ISSN 1549-6325.

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 ISSN 0895-4801.

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.

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. doi:10.1145/1993636.1993717 ISSN 9781450306911.

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 ISSN 0129-0541.

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. doi:10.1137/100792949 ISSN 1868-8969.

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 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. doi:10.1137/100792949 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. ISBN 978-3-642-10630-9. doi:10.1007/978-3-642-10631-6_100 ISSN 0302-9743.

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 ISSN 0302-9743.

This list was generated on Wed Jun 7 10:15:29 2023 BST.