Parinya Chalermsook
Parinya Chalermsook
Verified email at aalto.fi - Homepage
TitleCited byYear
Maximum independent set of rectangles
P Chalermsook, J Chuzhoy
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
872009
Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more
P Chalermsook, B Laekhanukit, D Nanongkai
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
462013
Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses
P Chalermsook, B Laekhanukit, D Nanongkai
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 370-379, 2013
442013
Improved hardness results for profit maximization pricing problems with unlimited supply
P Chalermsook, J Chuzhoy, S Kannan, S Khanna
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
402012
From gap-eth to fpt-inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
392017
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
P Chalermsook, J Fakcharoenphol, D Nanongkai
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
302004
Simple distributed algorithms for approximating minimum steiner trees
P Chalermsook, J Fakcharoenphol
International Computing and Combinatorics Conference, 380-389, 2005
212005
Improved hardness of approximation for Stackelberg shortest-path pricing
P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai
International Workshop on Internet and Network Economics, 444-454, 2010
202010
Resource minimization for fire containment
P Chalermsook, J Chuzhoy
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
182010
Pattern-avoiding access in binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015
162015
Nearly tight approximability results for minimum biclique cover and partition
P Chalermsook, S Heydrich, E Holm, A Karrenbauer
European Symposium on Algorithms, 235-246, 2014
152014
Coloring and maximum independent set of rectangles
P Chalermsook
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
142011
Social network monetization via sponsored viral marketing
P Chalermsook, A Das Sarma, A Lall, D Nanongkai
ACM SIGMETRICS Performance Evaluation Review 43 (1), 259-270, 2015
122015
Self-adjusting binary search trees: What makes them tick?
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms-ESA 2015, 300-312, 2015
11*2015
The landscape of bounds for binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1603.04892, 2016
82016
Submodular unsplittable flow on trees
A Adamaszek, P Chalermsook, A Ene, A Wiese
Mathematical Programming 172 (1-2), 565-589, 2018
72018
Graph pricing problem on bounded treewidth, bounded genus and k-partite graphs
P Chalermsook, S Kintali, R Lipton, D Nanongkai
arXiv preprint arXiv:1203.1940, 2012
72012
How to tame rectangles: solving independent set and coloring of rectangles via shrinking
A Adamaszek, P Chalermsook, A Wiese
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
62015
On survivable set connectivity
P Chalermsook, F Grandoni, B Laekhanukit
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
62014
Pre-reduction graph products: Hardnesses of properly learning dfas and approximating edp on dags
P Chalermsook, B Laekhanukit, D Nanongkai
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 444-453, 2014
62014
The system can't perform the operation now. Try again later.
Articles 1–20