Parinya Chalermsook
Parinya Chalermsook
Adresse e-mail validée de aalto.fi - Page d'accueil
Titre
Citée par
Citée par
Année
Maximum independent set of rectangles
P Chalermsook, J Chuzhoy
Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009
982009
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
702017
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
582013
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
552013
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
472012
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.
P Chalermsook, J Fakcharoenphol, D Nanongkai
SODA 4, 828-829, 2004
332004
Simple distributed algorithms for approximating minimum steiner trees
P Chalermsook, J Fakcharoenphol
International Computing and Combinatorics Conference, 380-389, 2005
272005
Resource minimization for fire containment
P Chalermsook, J Chuzhoy
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
232010
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
222015
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
222010
Coloring and maximum independent set of rectangles
P Chalermsook
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
212011
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
192014
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
182015
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
12*2015
Submodular unsplittable flow on trees
A Adamaszek, P Chalermsook, A Ene, A Wiese
Mathematical Programming 172 (1), 565-589, 2018
112018
The landscape of bounds for binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1603.04892, 2016
102016
On survivable set connectivity
P Chalermsook, F Grandoni, B Laekhanukit
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
82014
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81 (10), 3993-4009, 2019
72019
New integrality gap results for the firefighters problem on trees
P Chalermsook, D Vaz
International Workshop on Approximation and Online Algorithms, 65-77, 2016
72016
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
72015
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20