Parinya Chalermsook

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