| 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 | 129* | 2020 |
| Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 118 | 2009 |
| 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 | 73 | 2013 |
| 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 | 66 | 2013 |
| Improved hardness results for profit maximization pricing problems with unlimited supply P Chalermsook, J Chuzhoy, S Kannan, S Khanna International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 54 | 2012 |
| Coloring and maximum weight independent set of rectangles P Chalermsook, B Walczak Proceedings of the 2021 ACM-SIAM symposium on discrete algorithms (SODA …, 2021 | 39 | 2021 |
| 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 | 38 | 2015 |
| 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 | 38 | 2014 |
| A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. P Chalermsook, J Fakcharoenphol, D Nanongkai SODA 4, 828-829, 2004 | 35 | 2004 |
| Simple distributed algorithms for approximating minimum steiner trees P Chalermsook, J Fakcharoenphol Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005 | 30 | 2005 |
| Resource minimization for fire containment P Chalermsook, J Chuzhoy Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 29 | 2010 |
| Improved hardness of approximation for Stackelberg shortest-path pricing P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010 | 28 | 2010 |
| 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 | 27* | 2021 |
| Coloring and maximum independent set of rectangles P Chalermsook International Workshop on Approximation Algorithms for Combinatorial …, 2011 | 27 | 2011 |
| 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 | 24 | 2015 |
| New tools and connections for exponential-time approximation N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof Algorithmica 81, 3993-4009, 2019 | 23 | 2019 |
| Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese Mathematical Programming 172 (1), 565-589, 2018 | 20 | 2018 |
| Greedy is an almost optimal deque P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015 | 18 | 2015 |
| On guillotine cutting sequences F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ... | 17 | 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 | 16 | 2016 |
Danupon NanongkaiDirector, Max Planck Institute for Informatics在 mpi-inf.mpg.de 的电子邮件经过验证
