Anna Adamaszek

534 total citations
27 papers, 142 citations indexed

About

Anna Adamaszek is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Anna Adamaszek has authored 27 papers receiving a total of 142 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 11 papers in Industrial and Manufacturing Engineering and 10 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Anna Adamaszek's work include Computational Geometry and Mesh Generation (10 papers), Optimization and Search Problems (8 papers) and Complexity and Algorithms in Graphs (8 papers). Anna Adamaszek is often cited by papers focused on Computational Geometry and Mesh Generation (10 papers), Optimization and Search Problems (8 papers) and Complexity and Algorithms in Graphs (8 papers). Anna Adamaszek collaborates with scholars based in Denmark, Germany and United Kingdom. Anna Adamaszek's co-authors include Andreas Wiese, Michał Adamaszek, Tillmann Miltzow, Artur Czumaj, Harald Räcke, Matthias Englert, Andrzej Lingas, Tomasz Kociumaka, Marcin Pilipczuk and Michał Pilipczuk and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Anna Adamaszek

19 papers receiving 135 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Anna Adamaszek Denmark 9 58 51 50 49 18 27 142
Yahav Nussbaum Israel 9 101 1.7× 7 0.1× 55 1.1× 51 1.0× 13 0.7× 13 152
Kent Andersen Belgium 7 94 1.6× 100 2.0× 14 0.3× 34 0.7× 10 158
Karol Suchan Chile 7 103 1.8× 13 0.3× 44 0.9× 4 0.1× 5 0.3× 28 141
Frederic Dorn Norway 9 178 3.1× 9 0.2× 75 1.5× 36 0.7× 7 0.4× 16 207
Gábor Galambos Hungary 8 17 0.3× 160 3.1× 152 3.0× 17 0.3× 3 0.2× 14 211
Donna J. Brown United States 7 37 0.6× 229 4.5× 125 2.5× 97 2.0× 5 0.3× 10 271
Wun-Tat Chan Hong Kong 8 26 0.4× 45 0.9× 123 2.5× 4 0.1× 9 0.5× 16 168
S. Thiel United Kingdom 5 38 0.7× 57 1.1× 90 1.8× 4 0.1× 6 0.3× 7 159
Vinícius F. dos Santos Brazil 7 88 1.5× 12 0.2× 15 0.3× 4 0.1× 6 0.3× 39 148
Jara Uitto Switzerland 7 113 1.9× 4 0.1× 76 1.5× 13 0.3× 21 1.2× 20 151

Countries citing papers authored by Anna Adamaszek

Since Specialization
Citations

This map shows the geographic impact of Anna Adamaszek's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anna Adamaszek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anna Adamaszek more than expected).

Fields of papers citing papers by Anna Adamaszek

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anna Adamaszek. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anna Adamaszek. The network helps show where Anna Adamaszek may publish in the future.

Co-authorship network of co-authors of Anna Adamaszek

This figure shows the co-authorship network connecting the top 25 collaborators of Anna Adamaszek. A scholar is included among the top collaborators of Anna Adamaszek based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anna Adamaszek. Anna Adamaszek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2022). Almost Tight Bounds for Reordering Buffer Management. SIAM Journal on Computing. 51(3). 701–722.
2.
Adamaszek, Anna, et al.. (2020). Almost all trees are almost graceful. Random Structures and Algorithms. 56(4). 948–987.
3.
Adamaszek, Anna, Sariel Har-Peled, & Andreas Wiese. (2019). Approximation Schemes for Independent Set and Sparse Subsets of Polygons. Journal of the ACM. 66(4). 1–40. 3 indexed citations
4.
Adamaszek, Anna, Matthias Mnich, & Katarzyna Paluch. (2018). New Approximation Algorithms for (1,2)-TSP. Research Publications (Maastricht University). 5 indexed citations
5.
Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2018). An O (log k )-Competitive Algorithm for Generalized Caching. ACM Transactions on Algorithms. 15(1). 1–18. 6 indexed citations
6.
Adamaszek, Anna, Antonios Antoniadis, Amit Kumar, & Tobias Mömke. (2018). Approximating Airports and Railways. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
7.
Adamaszek, Anna, et al.. (2018). The art gallery problem is ∃ ℝ-complete. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 65–73. 16 indexed citations
8.
Adamaszek, Anna, Parinya Chalermsook, Alina Ene, & Andreas Wiese. (2018). Submodular unsplittable flow on trees. Mathematical Programming. 172(1-2). 565–589.
9.
Adamaszek, Anna, Tomasz Kociumaka, Marcin Pilipczuk, & Michał Pilipczuk. (2017). Hardness of Approximation for Strip Packing. Research at the University of Copenhagen (University of Copenhagen). 9(3). 1–7. 8 indexed citations
10.
Adamaszek, Anna & Alexandru Popa. (2016). Approximation and hardness results for the maximum edge q-coloring problem. Journal of Discrete Algorithms. 38-41. 1–8.
11.
Adamaszek, Anna, Antonios Antoniadis, & Tobias Mömke. (2016). Airports and Railways: Facility Location Meets Network Design. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
12.
Adamaszek, Anna, et al.. (2016). Reordering buffer management with advice. Journal of Scheduling. 20(5). 423–442. 5 indexed citations
13.
Adamaszek, Anna, Michał Adamaszek, Matthias Mnich, & Jens M. Schmidt. (2016). Lower Bounds for Locally Highly Connected Graphs. Graphs and Combinatorics. 32(5). 1641–1650.
14.
Adamaszek, Anna, Parinya Chalermsook, & Andreas Wiese. (2015). How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
15.
Adamaszek, Anna & Andreas Wiese. (2014). A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. arXiv (Cornell University). 645–656. 8 indexed citations
16.
Adamaszek, Anna & Alexandru Popa. (2014). Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica. 73(2). 371–388. 1 indexed citations
17.
Adamaszek, Anna & Andreas Wiese. (2014). A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. 1491–1505. 8 indexed citations
18.
Adamaszek, Anna & Andreas Wiese. (2013). Approximation Schemes for Maximum Weight Independent Set of Rectangles. 400–409. 23 indexed citations
19.
Adamaszek, Anna, Artur Czumaj, Matthias Englert, & Harald Räcke. (2012). An O(log k)-competitive algorithm for generalized caching. 1681–1689. 7 indexed citations
20.
Adamaszek, Anna & Michał Adamaszek. (2009). Combinatorics of the change-making problem. European Journal of Combinatorics. 31(1). 47–63. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026