 | 2012 |
| 13 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
An O(log k)-competitive algorithm for generalized caching.
SODA 2012: 1681-1689 |
| 12 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
Optimal online buffer scheduling for block devices.
STOC 2012: 589-598 |
| 2011 |
| 11 |  | Anna Adamaszek,
Artur Czumaj,
Andrzej Lingas,
Jakub Onufry Wojtaszczyk:
Approximation Schemes for Capacitated Geometric Network Design.
ICALP (1) 2011: 25-36 |
| 10 |  | Anna Adamaszek,
Artur Czumaj,
Matthias Englert,
Harald Räcke:
Almost tight bounds for reordering buffer management.
STOC 2011: 607-616 |
| 9 |  | Anna Adamaszek,
Michal Adamaszek:
Uniqueness of Graph Square Roots of Girth Six.
Electr. J. Comb. 18(1): (2011) |
| 2010 |
| 8 |  | Anna Adamaszek,
Alexandru Popa:
Approximation and Hardness Results for the Maximum Edge q-coloring Problem.
ISAAC (2) 2010: 132-143 |
| 7 |  | Anna Adamaszek,
Michal Adamaszek:
Large-Girth Roots of Graphs.
STACS 2010: 35-46 |
| 6 |  | Anna Adamaszek,
Michal Adamaszek:
Combinatorics of the change-making problem.
Eur. J. Comb. 31(1): 47-63 (2010) |
| 5 |  | 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): 893-904 (2010) |
| 4 |  | Anna Adamaszek,
Michal Adamaszek:
Large-Girth Roots of Graphs.
SIAM J. Discrete Math. 24(4): 1501-1514 (2010) |
| 2009 |
| 3 |  | Anna Adamaszek,
Artur Czumaj,
Andrzej Lingas:
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k.
ISAAC 2009: 994-1003 |
| 2 |  | 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) |
| 1 |  | Anna Adamaszek,
Michal Adamaszek:
Large-girth roots of graphs
CoRR abs/0909.4011: (2009) |