Department of Computer Science

Read more
1661 - 1670 out of 1,702Page size: 10
Sort by: 1st author
  1. Published

    Labeling schemes for bounded degree graphs

    Adjiashvili, D. & Rotbart, N. G., 2014, Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Springer, p. 375-386 12 p. (Lecture notes in computer science, Vol. 8573).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  2. Published

    Lower bounds for locally highly connected graphs

    Adamaszek, A. M., Adamaszek, M. J., Mnich, M. & Schmidt, J. M., Sep 2016, In: Graphs and Combinatorics. 32, 5, p. 1641-1650 10 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  3. Published

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

    Adamaszek, A. M. & Popa, A., 2016, In: Journal of Discrete Algorithms. 38-41, p. 1-8 8 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  4. Published

    Reordering buffer management with advice

    Adamaszek, A. M., Renault, M. P., Rosén, A. & van Stee, R., Oct 2017, In: Journal of Scheduling. 20, 5, p. 423-442 20 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  5. Published

    How to tame rectangles: solving independent set and coloring of rectangles via shrinking

    Adamaszek, A. M., Chalermsook, P. & Wiese, A., 2015, In: Leibniz International Proceedings in Informatics. 40, p. 43-60 18 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  6. Published

    Airports and railways: facility location meets network design

    Adamaszek, A. M., Antoniadis, A. & Mömke, T., 2016, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Ollinger, N. & Vollmer, H. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 14 p. 6. (Leibniz International Proceedings in Informatics, Vol. 47).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  7. Published

    Hardness of approximation for strip packing

    Adamaszek, A. M., Kociumaka, T., Pilipczuk, M. & Pilipczuk, M., Sep 2017, In: ACM Transactions on Computation Theory. 9, 3, 7 p., 14.

    Research output: Contribution to journal › Journal article › Research › peer-review

  8. Published

    Submodular unsplittable flow on trees

    Adamaszek, A. M., Chalermsook, P., Ene, A. & Wiese, A., 2016, Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Louveaux, Q. & Skutella, M. (eds.). Springer, p. 337-349 13 p. (Lecture notes in computer science, Vol. 9682).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  9. Published

    Approximation schemes for independent set and sparse subsets of polygons

    Adamaszek, A., Har-Peled, S. & Wiese, A., 2019, In: Journal of the ACM. 66, 4, 40 p., 29.

    Research output: Contribution to journal › Journal article › Research › peer-review

  10. Published

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

    Adamaszek, A., Czumaj, A., Englert, M. & Räcke, H., 16 Nov 2018, In: ACM Transactions on Algorithms. 15, 1, p. 1-18 6.

    Research output: Contribution to journal › Journal article › Research › peer-review

Previous 1...163 164 165 166 167 168 169 170 171 Next