Anna Adamaszek
Title
Cited by
Cited by
Year
Approximation schemes for maximum weight independent set of rectangles
A Adamaszek, A Wiese
2013 IEEE 54th annual symposium on foundations of computer science, 400-409, 2013
802013
The art gallery problem is∃ ℝ-complete
M Abrahamsen, A Adamaszek, T Miltzow
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
382018
A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
A Adamaszek, A Wiese
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
332014
A quasi-PTAS for the two-dimensional geometric knapsack problem
A Adamaszek, A Wiese
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
312014
Almost tight bounds for reordering buffer management
A Adamaszek, A Czumaj, M Englert, H Räcke
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
302011
An O(log k)-competitive algorithm for generalized caching
A Adamaszek, A Czumaj, M Englert, H Räcke
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
252012
Uniqueness of graph square roots of girth six
A Adamaszek, M Adamaszek
arXiv preprint arXiv:0912.2291, 2009
202009
Reordering buffer management with advice
A Adamaszek, MP Renault, A Rosén, R van Stee
Journal of Scheduling 20 (5), 423-442, 2017
162017
Combinatorics of the change-making problem
A Adamaszek, M Adamaszek
European Journal of Combinatorics 31 (1), 47-63, 2010
142010
Almost all trees are almost graceful
A Adamaszek, P Allen, C Grosu, J Hladky
arXiv preprint arXiv:1608.01577, 2016
13*2016
PTAS for k-tour cover problem on the plane for moderately large values of k
A Adamaszek, A Czumaj, A Lingas
International Journal of Foundations of Computer Science 21 (06), 893-904, 2010
132010
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
A Adamaszek, A Czumaj, A Lingas
International Symposium on Algorithms and Computation, 994-1003, 2009
132009
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
122017
Approximation and Hardness Results for the Maximum Edge q-coloring Problem
A Adamaszek, A Popa
International Symposium on Algorithms and Computation, 132-143, 2010
122010
Hardness of approximation for strip packing
A Adamaszek, T Kociumaka, M Pilipczuk, M Pilipczuk
ACM Transactions on Computation Theory (TOCT) 9 (3), 1-7, 2017
102017
Submodular unsplittable flow on trees
A Adamaszek, P Chalermsook, A Ene, A Wiese
International Conference on Integer Programming and Combinatorial …, 2016
92016
Algorithmic and hardness results for the colorful components problems
A Adamaszek, A Popa
Algorithmica 73 (2), 371-388, 2015
92015
Approximation schemes for independent set and sparse subsets of polygons
A Adamaszek, S Har-Peled, A Wiese
Journal of the ACM (JACM) 66 (4), 1-40, 2019
82019
Optimal online buffer scheduling for block devices
A Adamaszek, A Czumaj, M Englert, H Räcke
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
82012
How to tame rectangles: solving independent set and coloring of rectangles via shrinking
A Adamaszek, P Chalermsook, A Wiese
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
72015
The system can't perform the operation now. Try again later.
Articles 1–20