Anna Adamaszek

Cited by

	All	Since 2018
Citations	674	435
h-index	16	12
i10-index	20	15

201020112012201320142015201620172018201920202021202220234 4 17 21 45 45 44 50 63 66 67 78 86 75

Public access

View all

13 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Mikkel AbrahamsenAssociate Professor of Computer Science, University of CopenhagenVerified email at di.ku.dk
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
Alexandru PopaProfessor, University of BucharestVerified email at fmi.unibuc.ro
Parinya ChalermsookAalto UniversityVerified email at aalto.fi
Rob van SteeDepartment of Mathematics, University of Siegen, GermanyVerified email at uni-siegen.de
Marc P. RenaultUniversity of Wisconsin-MadisonVerified email at wisc.edu
Alina EneBoston UniversityVerified email at bu.edu
Jan HladkyInstitute of Computer Science of the Czech Academy of SciencesVerified email at cs.cas.cz
Matthias MnichTU HamburgVerified email at tuhh.de
Sariel Har-PeledProfessor of Computer Science, UIUCVerified email at uiuc.edu
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Antonios AntoniadisAssistant Professor, DMMP group, University of TwenteVerified email at utwente.nl
Tobias MömkeProfessor, Computer Science, University of AugsburgVerified email at informatik.uni-augsburg.de
Guillaume BlinFull Professor of Computer Science, Université de Bordeaux, FranceVerified email at labri.fr
Jens M. SchmidtTU HamburgVerified email at tuhh.de

Anna Adamaszek

Postdoc, University of Copenhagen

Verified email at di.ku.dk - Homepage

approximation algorithms online algorithms computational geometry graph theory


Title Sort by citations Sort by year Sort by 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	104	2013
The art gallery problem is∃ ℝ-complete M Abrahamsen, A Adamaszek, T Miltzow ACM Journal of the ACM (JACM) 69 (1), 1-70, 2021	100	2021
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	45	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	38	2014
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	35	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	33	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	30	2012
Combinatorics of the change-making problem A Adamaszek, M Adamaszek European Journal of Combinatorics 31 (1), 47-63, 2010	26	2010
Irrational guards are sometimes needed M Abrahamsen, A Adamaszek, T Miltzow arXiv preprint arXiv:1701.05475, 2017	25	2017
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	24	2019
Almost all trees are almost graceful A Adamaszek, P Allen, C Grosu, J Hladký Random Structures & Algorithms 56 (4), 948-987, 2020	20*	2020
Reordering buffer management with advice A Adamaszek, MP Renault, A Rosén, R van Stee Journal of Scheduling 20, 423-442, 2017	20	2017
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	20	2017
Uniqueness of graph square roots of girth six A Adamaszek, M Adamaszek arXiv preprint arXiv:0912.2291, 2009	20	2009
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
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	16	2010
Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese International conference on integer programming and combinatorial …, 2016	15	2016
New approximation algorithms for (1, 2)-tsp A Adamaszek, M Mnich, K Paluch 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018	13	2018
Algorithmic and hardness results for the colorful components problems A Adamaszek, A Popa Algorithmica 73, 371-388, 2015	10	2015
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	10	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors