Anna Adamaszek

According to our database1, Anna Adamaszek authored at least 41 papers between 2009 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Fast Fencing.
CoRR, 2018

The art gallery problem is ∃ ℝ-complete.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Fast fencing.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Approximating Airports and Railways.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

New Approximation Algorithms for (1, 2)-TSP.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Hardness of Approximation for Strip Packing.
TOCT, 2017

Reordering buffer management with advice.
J. Scheduling, 2017

Approximation Schemes for Independent Set and Sparse Subsets of Polygons.
CoRR, 2017

The Art Gallery Problem is ∃ℝ-complete.
CoRR, 2017

Irrational Guards are Sometimes Needed.
CoRR, 2017

Irrational Guards are Sometimes Needed.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Approximation and hardness results for the maximum edge q-coloring problem.
J. Discrete Algorithms, 2016

Lower Bounds for Locally Highly Connected Graphs.
Graphs and Combinatorics, 2016

Hardness of approximation for strip packing.
CoRR, 2016

Airports and Railways: Facility Location Meets Network Design.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Submodular Unsplittable Flow on Trees.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
Algorithmic and Hardness Results for the Colorful Components Problems.
Algorithmica, 2015

A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking.
Proceedings of the Approximation, 2015

2014
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Algorithmic and Hardness Results for the Colorful Components Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
CoRR, 2013

Approximation Schemes for Maximum Weight Independent Set of Rectangles.
CoRR, 2013

Algorithmic and Hardness Results for the Colorful Components Problems.
CoRR, 2013

Reordering Buffer Management with Advice.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Approximation Schemes for Maximum Weight Independent Set of Rectangles.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Approximation algorithms for geometric, caching and scheduling problems.
PhD thesis, 2012

Optimal online buffer scheduling for block devices.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

An O(log k)-competitive algorithm for generalized caching.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Uniqueness of Graph Square Roots of Girth Six.
Electr. J. Comb., 2011

Almost tight bounds for reordering buffer management.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Approximation Schemes for Capacitated Geometric Network Design.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Large-Girth Roots of Graphs.
SIAM J. Discrete Math., 2010

Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k.
Int. J. Found. Comput. Sci., 2010

Combinatorics of the change-making problem.
Eur. J. Comb., 2010

Large-Girth Roots of Graphs.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Approximation and Hardness Results for the Maximum Edge q-coloring Problem.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Large-girth roots of graphs
CoRR, 2009

PTAS for k-tour cover problem on the plane for moderately large values of k
CoRR, 2009

PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009


  Loading...