Parinya Chalermsook

    • Aalto SCI Computer Science Konemiehentie 2

    20042021

    Research activity per year

    If you made any changes in Pure these will be visible here soon.

    Personal profile

    Artistic and research interests

    Research interests: Parinya studies the interplay between algorithms and optimization. He has worked on computational problems arising from a wide range of domains, such as data structures, algorithmic game theory, networking, and computational geometry. He has been awarded a Simons-Berkeley Research Fellowship and an ERC Starting Grant. 

     

    More info:

    Expertise related to UN Sustainable Devlopment Goals

    In 2015, UN member states agreed to 17 global Sustainable Development Goals (SDGs) to end poverty, protect the planet and ensure prosperity for all. This person’s work contributes towards the following SDG(s):

    • SDG 3 - Good Health and Well-being

    Keywords

    • approximation algorithms
    • combinatorial optimisation
    • discrete mathematics

    Fingerprint

    Dive into the research topics where Parinya Chalermsook is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
    • 1 Similar Profiles

    Network

    Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
    • Coloring and maximum weight independent set of rectangles

      Chalermsook, P. & Walczak, B., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery (ACM), p. 860-868 9 p.

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

      Open Access
      3 Citations (Scopus)
    • On Minimum Generalized Manhattan Connections

      Antoniadis, A., Capretto, M., Chalermsook, P., Damerius, C., Kling, P., Nölke, L., Obscura Acosta, N. & Spoerhase, J., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 85-100 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

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

      Open Access
    • Vertex sparsification for edge connectivity

      Chalermsook, P., Das, S., Kook, Y., Laekhanukit, B., Liu, Y. P., Peng, R., Sellke, M. & Vaz, D., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). ACM, p. 1206-1225 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

      Open Access
      3 Citations (Scopus)
    • From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more

      Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D. & Trevisan, L., 2020, In: SIAM JOURNAL ON COMPUTING. 49, 4, p. 772-810 39 p.

      Research output: Contribution to journalArticleScientificpeer-review

      Open Access
      File
      2 Citations (Scopus)
      104 Downloads (Pure)
    • Multi-transversals for Triangles and the Tuza's Conjecture

      Chalermsook, P., Khuller, S., Sukprasert, P. & Uniyal, S., 2020, PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20). p. 1955-1974 20 p.

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

      Open Access