Parinya Chalermsook
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
43
Venues
16
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
43 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | COCOON | Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique. | Parinya Chalermsook, Wanchote Jiamjitrak, Ly Orgo, Minoo Zarsav |
| 2026 | ICALP | Hardness and Approximation for Coloring Digraphs. | Parinya Chalermsook, Harmender Gahlawat, Felix Klingelhfer, Alantha Newman, Chaoliang Tang |
| 2026 | SODA | Shortcuts and Transitive-Closure Spanners Approximation. | Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2026 | STOC | Fine-Grained Complexity of Continuous Euclidean k-Center. | Lotte Blank, Karl Bringmann, Parinya Chalermsook, Karthik C. S., Benedikt Kolbe, Hung Le, Geert van Wordragen |
| 2025 | GD | On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers. | Parinya Chalermsook, Ly Orgo, Minoo Zarsav |
| 2025 | IPCO | Approximate Cut & Packing Ratios for Multi-commodity Arborescences. | Parinya Chalermsook, Chien-Chung Huang |
| 2025 | WADS | An Improved Guillotine Cut for Squares. | Parinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal, Minoo Zarsav |
| 2024 | ICALP | Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2024 | ICALP | The Group Access Bounds for Binary Search Trees. | Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai |
| 2024 | SODA | Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. | Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai |
| 2023 | ESA | Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. | Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo |
| 2023 | FOCS | Parameterized Approximation Schemes for Clustering with General Norm Objectives. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2023 | SODA | Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. | Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai |
| 2023 | WAOA | Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. | Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase |
| 2022 | ICALP | Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. | Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai |
| 2021 | SODA | Vertex Sparsification for Edge Connectivity. | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
| 2021 | SODA | Coloring and Maximum Weight Independent Set of Rectangles. | Parinya Chalermsook, Bartosz Walczak |
| 2021 | WADS | On Minimum Generalized Manhattan Connections. | Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nlke, Nidia Obscura Acosta, Joachim Spoerhase |
| 2020 | ESA | New Binary Search Tree Bounds via Geometric Inversions. | Parinya Chalermsook, Wanchote Po Jiamjitrak |
| 2020 | SODA | Multi-transversals for Triangles and the Tuza's Conjecture. | Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal |
| 2020 | WG | On Finding Balanced Bicliques via Matchings. | Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo |
| 2019 | STACS | A Tight Extremal Bound on the Lovsz Cactus Number in Planar Graphs. | Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal |
| 2018 | ISAAC | Multi-Finger Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2017 | FOCS | 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 |
| 2017 | SODA | Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. | Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz |
| 2017 | WALCOM | Finding Triangles for Maximum Planar Subgraphs. | Parinya Chalermsook, Andreas Schmid |
| 2016 | IPCO | Submodular Unsplittable Flow on Trees. | Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese |
| 2016 | WAOA | New Integrality Gap Results for the Firefighters Problem on Trees. | Parinya Chalermsook, Daniel Vaz |
| 2015 | ESA | Self-Adjusting Binary Search Trees: What Makes Them Tick? | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | FOCS | Pattern-Avoiding Access in Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | SODA | On Survivable Set Connectivity. | Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit |
| 2015 | SIGMETRICS | Social Network Monetization via Sponsored Viral Marketing. | Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai |
| 2015 | WADS | Greedy Is an Almost Optimal Deque. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2014 | ESA | Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. | Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer |
| 2014 | FOCS | Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2014 | LATIN | Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | FOCS | Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | SODA | Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2012 | STOC | Approximation algorithms and hardness of integral concurrent flow. | Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li |
| 2010 | SODA | Resource Minimization for Fire Containment. | Parinya Chalermsook, Julia Chuzhoy |
| 2009 | SODA | Maximum independent set of rectangles. | Parinya Chalermsook, Julia Chuzhoy |
| 2005 | COCOON | Simple Distributed Algorithms for Approximating Minimum Steiner Trees. | Parinya Chalermsook, Jittat Fakcharoenphol |
| 2004 | SODA | A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. | Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai |