| The art gallery problem is∃ ℝ-complete M Abrahamsen, A Adamaszek, T Miltzow ACM Journal of the ACM (JACM) 69 (1), 1-70, 2021 | 146 | 2021 |
| 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 | 116 | 2013 |
| 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 | 54 | 2014 |
| 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 | 45 | 2014 |
| 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 | 37 | 2019 |
| 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 | 37 | 2011 |
| 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 | 35 | 2010 |
| Combinatorics of the change-making problem A Adamaszek, M Adamaszek European Journal of Combinatorics 31 (1), 47-63, 2010 | 34 | 2010 |
| 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 | 33 | 2012 |
| Irrational guards are sometimes needed M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1701.05475, 2017 | 31 | 2017 |
| New approximation algorithms for (1, 2)-tsp A Adamaszek, M Mnich, K Paluch 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 25 | 2018 |
| Almost all trees are almost graceful A Adamaszek, P Allen, C Grosu, J Hladký Random Structures & Algorithms 56 (4), 948-987, 2020 | 23* | 2020 |
| 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 | 22 | 2017 |
| Uniqueness of graph square roots of girth six A Adamaszek, M Adamaszek arXiv preprint arXiv:0912.2291, 2009 | 21 | 2009 |
| Reordering buffer management with advice A Adamaszek, MP Renault, A Rosén, R van Stee Journal of Scheduling 20, 423-442, 2017 | 20 | 2017 |
| Approximation and Hardness Results for the Maximum Edge q-coloring Problem A Adamaszek, A Popa Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010 | 18 | 2010 |
| 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 | 18 | 2009 |
| Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese International conference on integer programming and combinatorial …, 2016 | 15 | 2016 |
| Fast fencing M Abrahamsen, A Adamaszek, K Bringmann, V Cohen-Addad, M Mehr, ... Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 14 | 2018 |
| An O(log k)-Competitive Algorithm for Generalized Caching A Adamaszek, A Czumaj, M Englert, H Räcke ACM Transactions on Algorithms (TALG) 15 (1), 1-18, 2018 | 13 | 2018 |
Andreas WieseAdjoint Professordii.uchile.cl의 이메일 확인됨
