Anna Adamaszek

Available identifiers

zbMath Open adamaszek.annaMaRDI QIDQ343696

List of research outcomes

Publication	Date of Publication	Type
Almost Tight Bounds for Reordering Buffer Management	2022-06-08	Paper
The Art Gallery Problem is ∃ℝ-complete	2022-03-31	Paper
New approximation algorithms for \((1,2)\)-TSP	2021-07-28	Paper
Approximating airports and railways	2020-08-05	Paper
Approximation schemes for independent set and sparse subsets of polygons	2020-02-11	Paper
Hardness of approximation for strip packing	2019-12-06	Paper
The art gallery problem is \(\exists \mathbb{R}\)-complete	2019-08-22	Paper
Fast fencing	2019-08-22	Paper
A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices	2019-06-20	Paper
An \(O(\log k)\)-competitive algorithm for generalized caching	2019-05-10	Paper
An \(O(\log k)\)-competitive algorithm for generalized caching	2019-03-28	Paper
Approximation schemes for capacitated geometric network design	2018-11-28	Paper
Submodular unsplittable flow on trees	2018-10-26	Paper
Irrational guards are sometimes needed	2018-08-13	Paper
Reordering buffer management with advice	2018-04-04	Paper
Airports and railways: facility location meets network design	2018-01-24	Paper
A quasi-PTAS for the two-dimensional geometric knapsack problem	2017-10-05	Paper
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking	2017-08-31	Paper
Approximation and hardness results for the maximum edge \(q\)-coloring problem	2016-12-09	Paper
Lower bounds for locally highly connected graphs	2016-11-29	Paper
Submodular unsplittable flow on trees	2016-08-10	Paper
Algorithmic and hardness results for the colorful components problems	2015-10-19	Paper
Approximation and hardness results for the maximum edges in transitive closure problem	2015-09-15	Paper
Reordering buffer management with advice	2014-09-02	Paper
Almost tight bounds for reordering buffer management	2014-06-05	Paper
Optimal online buffer scheduling for block devices	2014-05-13	Paper
Algorithmic and hardness results for the colorful components problems	2014-03-31	Paper
Large-girth roots of graphs	2012-01-23	Paper
Large-girth roots of graphs	2011-07-18	Paper
Uniqueness of graph square roots of girth six	2011-07-15	Paper
Approximation schemes for capacitated geometric network design	2011-07-06	Paper
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\)	2011-01-19	Paper
Approximation and Hardness Results for the Maximum Edge q-coloring Problem	2010-12-09	Paper
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\)	2009-12-17	Paper
Combinatorics of the change-making problem	2009-12-01	Paper

Research outcomes over time

This page was built for person: Anna Adamaszek