Parinya Chalermsook

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 51

Top Topics

Binary Search Trees

Bounded Treewidth

Independent Set

Top Venues

Publications

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
The Group Access Bounds for Binary Search Trees. ICALP (2024)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20 (1) (2024)
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. SODA (2024)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP (2024)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR (2023)
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations. CoRR (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA (2023)
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. WAOA (2023)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
The Group Access Bounds for Binary Search Trees. CoRR (2023)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. SODA (2023)
Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin Herold
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports 13 (7) (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS (2023)
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. CoRR (2023)
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR (2022)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR (2022)
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP (2022)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. WADS (2021)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR (2021)
Parinya Chalermsook, Bartosz Walczak
Coloring and Maximum Weight Independent Set of Rectangles. SODA (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal
Multi-transversals for Triangles and the Tuza's Conjecture. SODA (2020)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49 (4) (2020)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. CoRR (2020)
Parinya Chalermsook, Bartosz Walczak
Coloring and Maximum Weight Independent Set of Rectangles. CoRR (2020)
Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal
Multi-transversals for Triangles and the Tuza's Conjecture. CoRR (2020)
Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo
On Finding Balanced Bicliques via Matchings. WG (2020)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM (2020)
Parinya Chalermsook, Wanchote Po Jiamjitrak
New Binary Search Tree Bounds via Geometric Inversions. ESA (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR (2019)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Mimicking Networks Parameterized by Connectivity. CoRR (2019)
Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. STACS (2019)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81 (10) (2019)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-Finger Binary Search Trees. ISAAC (2018)
Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. CoRR (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM (2018)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172 (1-2) (2018)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Multi-finger binary search trees. CoRR (2018)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS (2017)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA (2017)
Parinya Chalermsook, Andreas Schmid
Finding Triangles for Maximum Planar Subgraphs. WALCOM (2017)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR (2017)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-time Approximation. CoRR (2017)
Parinya Chalermsook, Daniel Vaz
New Integrality Gap Results for the Firefighters Problem on Trees. WAOA (2016)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular Unsplittable Flow on Trees. IPCO (2016)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
The landscape of bounds for binary search trees. CoRR (2016)
Parinya Chalermsook, Daniel Vaz
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electron. Notes Discret. Math. 55 (2016)
Parinya Chalermsook, Daniel Vaz
New Integrality Gap Results for the Firefighters Problem on Trees. CoRR (2016)
Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn
Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-avoiding access in binary search trees. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
A Global Geometric View of Splaying. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. CoRR (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Greedy Is an Almost Optimal Deque. WADS (2015)
Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese
On Guillotine Cutting Sequences. APPROX-RANDOM (2015)
Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit
On Survivable Set Connectivity. SODA (2015)
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM (2015)
Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA (2015)
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
Pattern-Avoiding Access in Binary Search Trees. FOCS (2015)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. FOCS (2014)
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
New Approximability Results for the Robust k-Median Problem. SWAT (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. CoRR (2014)
Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ESA (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. CoRR (2013)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA (2013)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS (2013)
Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
New Approximability Results for the Robust k-Median Problem. CoRR (2013)
Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. 2013 (2013)
Parinya Chalermsook, Suresh Venkatasubramanian
Clustering With Center Constraints. FSTTCS (2013)
Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM (2012)
Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract) CoRR (2012)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More CoRR (2012)
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li
Approximation algorithms and hardness of integral concurrent flow. STOC (2012)
Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs CoRR (2012)
Parinya Chalermsook
Coloring and Maximum Independent Set of Rectangles. APPROX-RANDOM (2011)
Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE (2010)
Parinya Chalermsook, Julia Chuzhoy
Resource Minimization for Fire Containment. SODA (2010)
Parinya Chalermsook, Julia Chuzhoy
Maximum independent set of rectangles. SODA (2009)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Stackelberg Pricing is Hard to Approximate within 2-ε CoRR (2009)
Parinya Chalermsook, Jittat Fakcharoenphol
Simple Distributed Algorithms for Approximating Minimum Steiner Trees. COCOON (2005)
Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA (2004)