Sledovat
Parinya Chalermsook
Parinya Chalermsook
E-mailová adresa ověřena na: aalto.fi - Domovská stránka
Název
Citace
Citace
Rok
Maximum independent set of rectangles
P Chalermsook, J Chuzhoy
Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009
1062009
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
SIAM Journal on Computing 49 (4), 772-810, 2020
98*2020
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
682013
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
622013
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
512012
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
Resource minimization for fire containment
P Chalermsook, J Chuzhoy
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
312010
Simple distributed algorithms for approximating minimum steiner trees
P Chalermsook, J Fakcharoenphol
International Computing and Combinatorics Conference, 380-389, 2005
302005
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
292014
Coloring and maximum independent set of rectangles
P Chalermsook
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
252011
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
242015
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
232010
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
222015
Submodular unsplittable flow on trees
A Adamaszek, P Chalermsook, A Ene, A Wiese
Mathematical Programming 172 (1), 565-589, 2018
202018
Coloring and maximum weight independent set of rectangles
P Chalermsook, B Walczak
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
182021
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81 (10), 3993-4009, 2019
182019
On guillotine cutting sequences
F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ...
18th International Workshop on Approximation Algorithms for Combinatorial …, 2015
162015
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
Vertex sparsification for edge connectivity
P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
11*2021
The landscape of bounds for binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1603.04892, 2016
112016
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20