Professorship Chalermsook P.

Organisational unit: Research group

Research outputs

  1. 2019
  2. Published

    An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph

    Cairo, M., Medvedev, P., Acosta, N. O., Rizzi, R. & Tomescu, A. I., 1 Jul 2019, In : ACM Transactions on Algorithms. 15, 4, p. 1-17 48.

    Research output: Contribution to journalArticleScientificpeer-review

  3. Published

    A tight approximation for submodular maximization with mixed packing and covering constraints

    Mizrachi, E., Schwartz, R., Spoerhase, J. & Uniyal, S., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 85. (Leibniz international proceedings in informatics; vol. 132).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  4. Published

    A deterministic PTAS for the algebraic rank of bounded degree polynomials

    Bhargava, V., Bläser, M., Jindal, G. & Pandey, A., 1 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 647-661 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  5. Published

    On the complexity of symmetric polynomials

    Bläser, M. & Jindal, G., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-14 47. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  6. Accepted/In press

    A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

    Chalermsook, P., Schmid, A. & Uniyal, S., 2019, (Accepted/In press) In : CoRR. abs/1804.03485

    Research output: Contribution to journalConference articleScientificpeer-review

  7. 2018
  8. Published

    Submodular unsplittable flow on trees

    Adamaszek, A., Chalermsook, P., Ene, A. & Wiese, A., Nov 2018, In : Mathematical Programming. 172, 1-2, p. 565–589

    Research output: Contribution to journalArticleScientificpeer-review

  9. Published

    Approximation schemes for geometric coverage problems

    Chaplick, S., De, M., Ravsky, A. & Spoerhase, J., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-15 17

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  10. Published

    Survivable network design for group connectivity in low-treewidth graphs

    Chalermsook, P., Das, S., Even, G., Laekhanukit, B. & Vaz, D., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics; vol. 116).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  11. Published

    Approximating node-weighted k-MST on planar graphs

    Byrka, J., Lewandowski, M. & Spoerhase, J., 1 Jan 2018, Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Revised Selected Papers. Epstein, L. & Erlebach, T. (eds.). Springer Verlag, p. 87-101 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11312 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  12. Published

    Improved learning of k-parities

    Bhattacharyya, A., Gadekar, A. & Rajgopal, N., 1 Jan 2018, Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer Verlag, p. 542-553 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10976 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  13. Published

    Multi-finger binary search trees

    Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K. & Saranurak, T., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-26 (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  14. Published

    New Tools and Connections for Exponential-Time Approximation

    Bansal, N., Chalermsook, P., Laekhanukit, B., Nanongkai, D. & Nederlof, J., 2018, In : Algorithmica.

    Research output: Contribution to journalArticleScientificpeer-review

  15. Published

    Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

    Chan, T. M., Dijk, T. C. V., Fleszar, K., Spoerhase, J. & Wolff, A., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). p. 1-13 62. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  16. 2017
  17. Published

    Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphs

    Chalermsook, P., Das, S., Laekhanukit, B. & Vaz, D., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. p. 737-751 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  18. Published

    Finding triangles for maximum planar subgraphs

    Chalermsook, P. & Schmid, A., 2017, WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings. p. 373-384 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  19. Published

    From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

    Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D. & Trevisan, L., 2017, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. p. 743-754 12 p. (Annual Symposium on Foundations of Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  20. Published

    New integrality gap results for the firefighters problem on trees

    Chalermsook, P. & Vaz, D., 2017, Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Springer-Verlag, Vol. 10138 LNCS. p. 65-77 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10138 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

ID: 4777371