default search action
Anna Adamaszek
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j16]Mikkel Abrahamsen
, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69(1): 4:1-4:70 (2022) - [j15]Anna Adamaszek
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51(3): 701-722 (2022) - 2020
- [j14]Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
Almost all trees are almost graceful. Random Struct. Algorithms 56(4): 948-987 (2020)
2010 – 2019
- 2019
- [j13]Anna Adamaszek, Sariel Har-Peled
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019) - [j12]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15(1): 6:1-6:18 (2019) - 2018
- [j11]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172(1-2): 565-589 (2018) - [j10]Anna Adamaszek
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32(4): 2720-2746 (2018) - [c21]Anna Adamaszek, Matthias Mnich
New Approximation Algorithms for (1, 2)-TSP. ICALP 2018: 9:1-9:14 - [c20]Anna Adamaszek, Antonios Antoniadis, Amit Kumar
Approximating Airports and Railways. STACS 2018: 5:1-5:13 - [c19]Mikkel Abrahamsen
The art gallery problem is ∃ ℝ-complete. STOC 2018: 65-73 - [c18]Mikkel Abrahamsen
Fast fencing. STOC 2018: 564-573 - [i10]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast Fencing. CoRR abs/1804.00101 (2018) - 2017
- [j9]Anna Adamaszek
Reordering buffer management with advice. J. Sched. 20(5): 423-442 (2017) - [j8]Anna Adamaszek
Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory 9(3): 14:1-14:7 (2017) - [c17]Mikkel Abrahamsen
Irrational Guards are Sometimes Needed. SoCG 2017: 3:1-3:15 - [i9]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. CoRR abs/1701.05475 (2017) - [i8]Anna Adamaszek, Sariel Har-Peled
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR abs/1703.04758 (2017) - [i7]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. CoRR abs/1704.06969 (2017) - 2016
- [j7]Anna Adamaszek
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32(5): 1641-1650 (2016) - [j6]Anna Adamaszek
Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms 38-41: 1-8 (2016) - [c16]Anna Adamaszek
Submodular Unsplittable Flow on Trees. IPCO 2016: 337-349 - [c15]Anna Adamaszek
Airports and Railways: Facility Location Meets Network Design. STACS 2016: 6:1-6:14 - [i6]Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of approximation for strip packing. CoRR abs/1610.07766 (2016) - 2015
- [j5]Anna Adamaszek
Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica 73(2): 371-388 (2015) - [c14]Anna Adamaszek
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM 2015: 43-60 - [c13]Anna Adamaszek
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. SODA 2015: 1491-1505 - 2014
- [c12]Anna Adamaszek
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. IWOCA 2014: 13-23 - [c11]Anna Adamaszek
Algorithmic and Hardness Results for the Colorful Components Problems. LATIN 2014: 683-694 - [c10]Anna Adamaszek
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. SODA 2014: 645-656 - 2013
- [c9]Anna Adamaszek
Approximation Schemes for Maximum Weight Independent Set of Rectangles. FOCS 2013: 400-409 - [c8]Anna Adamaszek
Reordering Buffer Management with Advice. WAOA 2013: 132-143 - [i5]Anna Adamaszek, Andreas Wiese:
Approximation Schemes for Maximum Weight Independent Set of Rectangles. CoRR abs/1307.1774 (2013) - [i4]Anna Adamaszek, Andreas Wiese:
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. CoRR abs/1307.4257 (2013) - [i3]Anna Adamaszek, Alexandru Popa:
Algorithmic and Hardness Results for the Colorful Components Problems. CoRR abs/1311.1298 (2013) - 2012
- [b1]Anna Adamaszek:
Approximation algorithms for geometric, caching and scheduling problems. University of Warwick, Coventry, UK, 2012 - [c7]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689 - [c6]Anna Adamaszek
Optimal online buffer scheduling for block devices. STOC 2012: 589-598 - 2011
- [j4]Anna Adamaszek, Michal Adamaszek:
Uniqueness of Graph Square Roots of Girth Six. Electron. J. Comb. 18(1) (2011) - [c5]Anna Adamaszek
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36 - [c4]Anna Adamaszek
Almost tight bounds for reordering buffer management. STOC 2011: 607-616 - 2010
- [j3]Anna Adamaszek
Combinatorics of the change-making problem. Eur. J. Comb. 31(1): 47-63 (2010) - [j2]Anna Adamaszek
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21(6): 893-904 (2010) - [j1]Anna Adamaszek
Large-Girth Roots of Graphs. SIAM J. Discret. Math. 24(4): 1501-1514 (2010) - [c3]Anna Adamaszek
Approximation and Hardness Results for the Maximum Edge q-coloring Problem. ISAAC (2) 2010: 132-143 - [c2]Anna Adamaszek
Large-Girth Roots of Graphs. STACS 2010: 35-46
2000 – 2009
- 2009
- [c1]Anna Adamaszek
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ISAAC 2009: 994-1003 - [i2]Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
PTAS for k-tour cover problem on the plane for moderately large values of k. CoRR abs/0904.2576 (2009) - [i1]Anna Adamaszek, Michal Adamaszek:
Large-girth roots of graphs. CoRR abs/0909.4011 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: