Staff – University of Copenhagen

Forward this page to a friend Resize Print Bookmark and Share

Department of Computer Science DIKU > Staff

Anna Maria Adamaszek

Anna Maria Adamaszek

Postdoc

  • Department of Computer Science

    Universitetsparken 5, 2100 København Ø, Building: 1-2-33 og 1-2-37

Member of:


    1. 2017
    2. Published

      Hardness of approximation for strip packing. / Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin; Pilipczuk, Michał.

      In: ACM Transactions on Computation Theory, Vol. 9, No. 3, 14, 09.2017.

      Research output: Research - peer-reviewJournal article

    3. Published

      Reordering buffer management with advice. / Adamaszek, Anna Maria; Renault, Marc P.; Rosén, Adi; van Stee, Rob.

      In: Journal of Scheduling, Vol. 20, No. 5, 10.2017, p. 423-442.

      Research output: Research - peer-reviewJournal article

    4. 2016
    5. Published

      Airports and railways : facility location meets network design. / Adamaszek, Anna Maria; Antoniadis, Antonios; Mömke, Tobias.

      33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). ed. / Nicolas Ollinger; Heribert Vollmer. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. 6.

      Research output: Research - peer-reviewArticle in proceedings

    6. Published

      Approximation and hardness results for the maximum edge q-coloring problem. / Adamaszek, Anna Maria; Popa, Alexandru.

      In: Journal of Discrete Algorithms, Vol. 38-41, 2016, p. 1-8.

      Research output: Research - peer-reviewJournal article

    7. Published

      Lower bounds for locally highly connected graphs. / Adamaszek, Anna Maria; Adamaszek, Michal Jan; Mnich, Matthias; Schmidt, Jens M.

      In: Graphs and Combinatorics, Vol. 32, No. 5, 09.2016, p. 1641-1650.

      Research output: Research - peer-reviewJournal article

    8. Published

      Submodular unsplittable flow on trees. / Adamaszek, Anna Maria; Chalermsook, Parinya; Ene, Alina; Wiese, Andreas.

      Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. ed. / Quentin Louveaux; Martin Skutella. Springer, 2016. p. 337-349.

      Research output: Research - peer-reviewArticle in proceedings

    9. 2015
    10. A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. / Adamaszek, Anna Maria; Wiese, Andreas.

      Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. 2015. p. 1491-1505.

      Research output: Research - peer-reviewBook chapter

    11. Algorithmic and hardness results for the colorful components problems. / Adamaszek, Anna Maria; Popa, Alexandru.

      In: Algorithmica, Vol. 73, No. 2, 2015, p. 371-388.

      Research output: Research - peer-reviewJournal article

    12. Published

      How to tame rectangles : solving independent set and coloring of rectangles via shrinking. / Adamaszek, Anna Maria; Chalermsook, Parinya; Wiese, Andreas.

      In: Leibniz International Proceedings in Informatics, Vol. 40, 2015, p. 43-60.

      Research output: Research - peer-reviewJournal article

    13. 2014
    14. A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. / Adamaszek, Anna Maria; Wiese, Andreas.

      Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. 2014. p. 645-656.

      Research output: Research - peer-reviewBook chapter

    Previous 1 2 3 Next

    ID: 131853025