Anna Adamaszek

ORCID

Publication Activity (10 Years)

Years Active: 2009-2022
Publications (10 Years): 23

Top Venues

University of Warwick, Coventry, UK (PHD)

Education History

University of Warwick, Coventry, UK

PHD

Publications

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69 (1) (2022)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51 (3) (2022)
Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
Almost all trees are almost graceful. Random Struct. Algorithms 56 (4) (2020)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15 (1) (2019)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66 (4) (2019)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast Fencing. CoRR (2018)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172 (1-2) (2018)
Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
Approximating Airports and Railways. STACS (2018)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast fencing. STOC (2018)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32 (4) (2018)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The art gallery problem is ∃ ℝ-complete. STOC (2018)
Anna Adamaszek, Matthias Mnich, Katarzyna Paluch
New Approximation Algorithms for (1, 2)-TSP. ICALP (2018)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR (2017)
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
Reordering buffer management with advice. J. Sched. 20 (5) (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. CoRR (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. SoCG (2017)
Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory 9 (3) (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. CoRR (2017)
Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32 (5) (2016)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular Unsplittable Flow on Trees. IPCO (2016)
Anna Adamaszek, Alexandru Popa
Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms (2016)
Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
Hardness of approximation for strip packing. CoRR (2016)
Anna Adamaszek, Antonios Antoniadis, Tobias Mömke
Airports and Railways: Facility Location Meets Network Design. STACS (2016)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica 73 (2) (2015)
Anna Adamaszek, Andreas Wiese
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. SODA (2015)
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM (2015)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. LATIN (2014)
Anna Adamaszek, Andreas Wiese
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. SODA (2014)
Anna Adamaszek, Guillaume Blin, Alexandru Popa
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. IWOCA (2014)
Anna Adamaszek, Andreas Wiese
Approximation Schemes for Maximum Weight Independent Set of Rectangles. FOCS (2013)
Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
Reordering Buffer Management with Advice. WAOA (2013)
Anna Adamaszek, Andreas Wiese
Approximation Schemes for Maximum Weight Independent Set of Rectangles. CoRR (2013)
Anna Adamaszek, Andreas Wiese
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. CoRR (2013)
Anna Adamaszek, Alexandru Popa
Algorithmic and Hardness Results for the Colorful Components Problems. CoRR (2013)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Optimal online buffer scheduling for block devices. STOC (2012)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-competitive algorithm for generalized caching. SODA (2012)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) (2011)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost tight bounds for reordering buffer management. STOC (2011)
Anna Adamaszek, Michal Adamaszek
Uniqueness of Graph Square Roots of Girth Six. Electron. J. Comb. 18 (1) (2011)
Anna Adamaszek, Alexandru Popa
-coloring Problem. ISAAC (2) (2010)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21 (6) (2010)
Anna Adamaszek, Michal Adamaszek
Combinatorics of the change-making problem. Eur. J. Comb. 31 (1) (2010)
Anna Adamaszek, Michal Adamaszek
Large-Girth Roots of Graphs. STACS (2010)
Anna Adamaszek, Michal Adamaszek
Large-Girth Roots of Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas
PTAS for k-tour cover problem on the plane for moderately large values of k CoRR (2009)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas
. ISAAC (2009)
Anna Adamaszek, Michal Adamaszek
Large-girth roots of graphs CoRR (2009)

Anna Adamaszek.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anna Adamaszek