Combinatorics of Graph Packing and Online Binary Search Trees

  • Chalermsook, Parinya (Principal investigator)
  • Jiamjitrak, Wanchote (Project Member)
  • Sukprasert, Pattara (Project Member)
  • Obscura Acosta, Nidia (Project Member)
  • Uniyal, Sumedha (Project Member)

Project Details

StatusFinished
Effective start/end date01/09/2017 → 31/08/2020

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
View full fingerprint
  • 2 Conference article in proceedings
  • 1 Article

  • Local Optimization Algorithms for Maximum Planar Subgraph

    Călinescu, G. & Uniyal, S., Sept 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-18 18 p. 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 308).

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

    Open Access
    File
    57 Downloads (Pure)

  • Simplicity in Eulerian circuits : Uniqueness and safety

    Obscura Acosta, N. & Tomescu, A. I., Jan 2024, In: Information Processing Letters. 183, p. 1-5 5 p., 106421.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    2 Citations (Scopus)
    127 Downloads (Pure)

  • Coloring and maximum weight independent set of rectangles

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

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

    Open Access
    32 Citations (Scopus)