A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. - Parinya Chalermsook; Jittat Fakcharoenphol; Danupon Nanongkai (SODA, 2004)

Simple Distributed Algorithms for Approximating Minimum Steiner Trees. - Parinya Chalermsook; Jittat Fakcharoenphol (COCOON, 2005)

Maximum independent set of rectangles. - Parinya Chalermsook; Julia Chuzhoy (SODA, 2009)

Stackelberg Pricing is Hard to Approximate within 2-ε - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (CoRR, 2009)

Resource Minimization for Fire Containment. - Parinya Chalermsook; Julia Chuzhoy (SODA, 2010)

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. - Patrick Briest; Parinya Chalermsook; Sanjeev Khanna; Bundit Laekhanukit; Danupon Nanongkai (WINE, 2010)

Coloring and Maximum Independent Set of Rectangles. - Parinya Chalermsook (APPROX-RANDOM, 2011)

Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. - Parinya Chalermsook; Julia Chuzhoy; Sampath Kannan; Sanjeev Khanna (APPROX-RANDOM, 2012)

Approximation algorithms and hardness of integral concurrent flow. - Parinya Chalermsook; Julia Chuzhoy; Alina Ene; Shi Li 001 (STOC, 2012)

Multi-Attribute Profit-Maximizing Pricing (Extended Abstract) - Parinya Chalermsook; Khaled M. Elbassioni; Danupon Nanongkai; He Sun 001 (CoRR, 2012)

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (FOCS, 2013)

Clustering With Center Constraints. - Parinya Chalermsook; Suresh Venkatasubramanian (FSTTCS, 2013)

Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (SODA, 2013)

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. - Parinya Chalermsook; Shiva Kintali; Richard J. Lipton; Danupon Nanongkai (Chic. J. Theor. Comput. Sci., 2013)

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. - Parinya Chalermsook; Sandy Heydrich; Eugenia Holm; Andreas Karrenbauer (ESA, 2014)

Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (FOCS, 2014)

Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (LATIN, 2014)

New Approximability Results for the Robust k-Median Problem. - Sayan Bhattacharya; Parinya Chalermsook; Kurt Mehlhorn; Adrian Neumann (SWAT, 2014)

On Guillotine Cutting Sequences. - Fidaa Abed; Parinya Chalermsook; José Correa 001; Andreas Karrenbauer; Pablo Pérez-Lantero; José A. Soto; Andreas Wiese (APPROX-RANDOM, 2015)

How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. - Anna Adamaszek; Parinya Chalermsook; Andreas Wiese (APPROX-RANDOM, 2015)

Self-Adjusting Binary Search Trees: What Makes Them Tick? - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ESA, 2015)

Pattern-Avoiding Access in Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (FOCS, 2015)

Social Network Monetization via Sponsored Viral Marketing. - Parinya Chalermsook; Atish Das Sarma; Ashwin Lall; Danupon Nanongkai (SIGMETRICS, 2015)

On Survivable Set Connectivity. - Parinya Chalermsook; Fabrizio Grandoni 001; Bundit Laekhanukit (SODA, 2015)

Greedy Is an Almost Optimal Deque. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (WADS, 2015)

A Global Geometric View of Splaying. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2015)

Two Lower Bounds for Shortest Double-Base Number System. - Parinya Chalermsook; Hiroshi Imai; Vorapong Suppakitpaisarn (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

New Integrality Gap Results for the Firefighters Problem on Trees. - Parinya Chalermsook; Daniel Vaz 001 (WAOA, 2016)

The landscape of bounds for binary search trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2016)

A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. - Parinya Chalermsook; Daniel Vaz 001 (Electron. Notes Discret. Math., 2016)

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. - Parinya Chalermsook; Marek Cygan; Guy Kortsarz; Bundit Laekhanukit; Pasin Manurangsi; Danupon Nanongkai; Luca Trevisan 001 (FOCS, 2017)

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (SODA, 2017)

Finding Triangles for Maximum Planar Subgraphs. - Parinya Chalermsook; Andreas Schmid 003 (WALCOM, 2017)

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Guy Even; Bundit Laekhanukit; Daniel Vaz 001 (APPROX-RANDOM, 2018)

Multi-Finger Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ISAAC, 2018)

Submodular unsplittable flow on trees. - Anna Adamaszek; Parinya Chalermsook; Alina Ene; Andreas Wiese (Math. Program., 2018)

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. - Parinya Chalermsook; Andreas Schmid 003; Sumedha Uniyal (STACS, 2019)

New Tools and Connections for Exponential-Time Approximation. - Nikhil Bansal 001; Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai; Jesper Nederlof (Algorithmica, 2019)

Mimicking Networks Parameterized by Connectivity. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (CoRR, 2019)

New Binary Search Tree Bounds via Geometric Inversions. - Parinya Chalermsook; Wanchote Po Jiamjitrak (ESA, 2020)

Multi-transversals for Triangles and the Tuza's Conjecture. - Parinya Chalermsook; Samir Khuller; Pattara Sukprasert; Sumedha Uniyal (SODA, 2020)

On Finding Balanced Bicliques via Matchings. - Parinya Chalermsook; Wanchote Po Jiamjitrak; Ly Orgo (WG, 2020)

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. - Parinya Chalermsook; Marek Cygan; Guy Kortsarz; Bundit Laekhanukit; Pasin Manurangsi; Danupon Nanongkai; Luca Trevisan 001 (SIAM J. Comput., 2020)

Vertex Sparsification for Edge Connectivity. - Parinya Chalermsook; Syamantak Das; Yunbum Kook; Bundit Laekhanukit; Yang P. Liu; Richard Peng; Mark Sellke; Daniel Vaz 001 (SODA, 2021)

Coloring and Maximum Weight Independent Set of Rectangles. - Parinya Chalermsook; Bartosz Walczak (SODA, 2021)

On Minimum Generalized Manhattan Connections. - Antonios Antoniadis 001; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase (WADS, 2021)

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. - Parinya Chalermsook; Chien-Chung Huang 001; Danupon Nanongkai; Thatchaphol Saranurak; Pattara Sukprasert; Sorrachai Yingchareonthawornchai (ICALP, 2022)

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. - Parinya Chalermsook; Fedor V. Fomin; Thekla Hamm; Tuukka Korhonen; Jesper Nederlof; Ly Orgo (ESA, 2023)

Parameterized Approximation Schemes for Clustering with General Norm Objectives. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (FOCS, 2023)

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Nidia Obscura Acosta; Akash Pareek; Sorrachai Yingchareonthawornchai (SODA, 2023)

Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. - Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Joachim Spoerhase (WAOA, 2023)

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). - Karthik C. S. 001; Parinya Chalermsook; Joachim Spoerhase; Meirav Zehavi; Martin G. Herold (Dagstuhl Reports, 2023)

Pinning Down the Strong Wilber-1 Bound for Binary Search Trees. - Parinya Chalermsook; Julia Chuzhoy; Thatchaphol Saranurak (Theory Comput., 2023)

Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (ICALP, 2024)

The Group Access Bounds for Binary Search Trees. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Akash Pareek; Sorrachai Yingchareonthawornchai (ICALP, 2024)

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. - Parinya Chalermsook; Seth Pettie; Sorrachai Yingchareonthawornchai (SODA, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

Approximate Cut & Packing Ratios for Multi-commodity Arborescences. - Parinya Chalermsook; Chien-Chung Huang (IPCO, 2025)

An Improved Guillotine Cut for Squares. - Parinya Chalermsook; Axel Kugelmann; Ly Orgo; Sumedha Uniyal; Minoo Zarsav (WADS, 2025)

Shortcuts and Transitive-Closure Spanners Approximation. - Parinya Chalermsook; Yonggang Jiang; Sagnik Mukhopadhyay; Danupon Nanongkai (CoRR, 2025)