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 ∃ ℝ-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
https://portal.mardi4nfdi.de/entity/Q5743509	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