Anna Adamaszek

Tillmann Miltzow

J. ACM, 2022

2020

Almost all trees are almost graceful.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

2019

An O(log k)-Competitive Algorithm for Generalized Caching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Approximation Schemes for Independent Set and Sparse Subsets of Polygons.

[BibT_eX]

[DOI]

Sariel Har-Peled

J. ACM, 2019

2018

Approximation Schemes for Capacitated Geometric Network Design.

[BibT_eX]

[DOI]

Artur Czumaj

Andrzej Lingas

Jakub Onufry Wojtaszczyk

SIAM J. Discret. Math., 2018

Submodular unsplittable flow on trees.

[BibT_eX]

[DOI]

Math. Program., 2018

Fast fencing.

[BibT_eX]

[DOI]

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

Approximating Airports and Railways.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

New Approximation Algorithms for (1, 2)-TSP.

[BibT_eX]

[DOI]

Matthias Mnich

Katarzyna Paluch

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Hardness of Approximation for Strip Packing.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2017

Reordering buffer management with advice.

[BibT_eX]

[DOI]

J. Sched., 2017

Irrational Guards are Sometimes Needed.

[BibT_eX]

[DOI]

Mikkel Abrahamsen

Tillmann Miltzow

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Approximation and hardness results for the maximum edge q-coloring problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Lower Bounds for Locally Highly Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Airports and Railways: Facility Location Meets Network Design.

[BibT_eX]

[DOI]

Antonios Antoniadis

Tobias Mömke

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Algorithmic and Hardness Results for the Colorful Components Problems.

[BibT_eX]

[DOI]

Algorithmica, 2015

A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Parinya Chalermsook

Proceedings of the Approximation, 2015

2014

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

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.

[BibT_eX]

[DOI]

Guillaume Blin

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Approximation Schemes for Maximum Weight Independent Set of Rectangles.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Approximation algorithms for geometric, caching and scheduling problems.

[BibT_eX]

[DOI]

PhD thesis, 2012

Optimal online buffer scheduling for block devices.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Uniqueness of Graph Square Roots of Girth Six.

[BibT_eX]

[DOI]

Michal Adamaszek

Electron. J. Comb., 2011

2010

Large-Girth Roots of Graphs.

[BibT_eX]

[DOI]

Michal Adamaszek

SIAM J. Discret. Math., 2010

Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k.

[BibT_eX]

[DOI]

Artur Czumaj

Andrzej Lingas

Int. J. Found. Comput. Sci., 2010

Combinatorics of the change-making problem.

[BibT_eX]

[DOI]

Michal Adamaszek

Eur. J. Comb., 2010

Approximation and Hardness Results for the Maximum Edge q-coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k.

[BibT_eX]

[DOI]