| 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 | 96 | 2017 |
| On the parameterized complexity of approximating dominating set CS Karthik, B Laekhanukit, P Manurangsi arXiv preprint arXiv 1711, 2017 | 83 | 2017 |
| 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 | 72 | 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 | 64 | 2013 |
| An O(\log^2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem J Fakcharoenphol, B Laekhanukit SIAM Journal on Computing 41 (5), 1095-1109, 2012 | 54* | 2012 |
| Faster algorithms for semi-matching problems J Fakcharoenphol, B Laekhanukit, D Nanongkai ACM Transactions on Algorithms (TALG) 10 (3), 1-23, 2014 | 38 | 2014 |
| O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm F Grandoni, B Laekhanukit, S Li Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 34 | 2019 |
| Parameters of two-prover-one-round game and the hardness of connectivity problems B Laekhanukit Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 33 | 2014 |
| Approximating spanners and directed steiner forest: Upper and lower bounds E Chlamtáč, M Dinitz, G Kortsarz, B Laekhanukit ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020 | 27 | 2020 |
| Approximating rooted steiner networks J Cheriyan, B Laekhanukit, G Naves, A Vetta ACM Transactions on Algorithms (TALG) 11 (2), 1-22, 2014 | 26 | 2014 |
| Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai WINE, 444-454, 2010 | 24 | 2010 |
| An improved approximation algorithm for minimum-cost subset k-connectivity B Laekhanukit Automata, Languages and Programming, 13-24, 2011 | 20* | 2011 |
| On the complexity of closest pair via polar-pair of point-sets R David, B Laekhanukit SIAM Journal on Discrete Mathematics 33 (1), 509-527, 2019 | 19 | 2019 |
| New tools and connections for exponential-time approximation N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof Algorithmica 81, 3993-4009, 2019 | 18 | 2019 |
| A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem B Laekhanukit, S Oveis Gharan, M Singh Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 14 | 2012 |
| 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 | 12 | 2021 |
| 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 | 12 | 2020 |
| Approximation Algorithms for Minimum-Cost Connected Digraphs J Cheriyan, B Laekhanukit SIAM Journal on Discrete Mathematics 27 (3), 1450-1481, 2013 | 11 | 2013 |
| Survivable network design for group connectivity in low-treewidth graphs P Chalermsook, S Das, G Even, B Laekhanukit, D Vaz arXiv preprint arXiv:1802.10403, 2018 | 10 | 2018 |
| On survivable set connectivity P Chalermsook, F Grandoni, B Laekhanukit Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 10 | 2014 |
Parinya ChalermsookAalto UniversityE-mailová adresa ověřena na: aalto.fi
