Interest

ทฤษฎีด้านวิทยาการคอมพิวเตอร์

Administrative Profile


    Resource

    • จำนวนหน่วยปฏิบัติการที่เข้าร่วม 0 หน่วย
    • จำนวนเครื่องมือวิจัย 0 ชิ้น

    งานวิจัยในรอบ 5 ปี

    Project

    งานวิจัยที่อยู่ระหว่างการดำเนินการ
    • ทุนใน 0 โครงการ
    • ทุนนอก 0 โครงการ
    งานวิจัยที่เสร็จสิ้นแล้ว
    • ทุนใน 0 โครงการ
    • ทุนนอก 0 โครงการ

    แนวโน้มผลงานทั้งหมดเทียบกับแนวโน้มผลงานในรอบ 5 ปี

    Output

    • บทความ 4 เรื่อง (ตีพิมพ์ในวารสารวิชาการ 2 เรื่อง, นำเสนอในการประชุม/สัมมนา 2 เรื่อง)

    แนวโน้มการนำผลงานไปใช้ประโยชน์ในด้านต่างๆ

    Outcome

    • การนำผลงานไปใช้ประโยชน์ 0 เรื่อง (เชิงวิชาการ 0 เรื่อง, เชิงนโยบาย/บริหาร 0 เรื่อง, เชิงสาธารณะ 0 เรื่อง, เชิงพาณิชย์ 0 เรื่อง)

    รางวัลที่ได้รับ

    Award

    • รางวัลที่ได้รับ 0 เรื่อง (ประกาศเกียรติคุณ/รางวัลนักวิจัย 0 เรื่อง, รางวัลผลงานวิจัย/สิ่งประดิษฐ์ 0 เรื่อง, รางวัลผลงานนำเสนอในการประชุมวิชาการ 0 เรื่อง)

    นักวิจัยที่มีผลงานงานร่วมกันมากที่สุด 4 คนแรก


    Scopus h-index

    #Document titleAuthorsYearSourceCited by
    1From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and moreChalermsook P., Cygan M., Kortsarz G., Laekhanukit B., Laekhanukit B., Manurangsi P., Nanongkai D., Trevisan L.2020SIAM Journal on Computing
    49(4),pp. 772-810
    3
    2Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnessesChalermsook P., Laekhanukit B., Nanongkai D.2013Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
    ,pp. 370-379
    41
    3Polylogarithmic approximation algorithm for k-connected directed steiner tree on quasi-bipartite graphsChan C.H., Laekhanukit B., Wei H.T., Zhang Y.2020Leibniz International Proceedings in Informatics, LIPIcs
    176
    1
    4Vertex sparsification for edge connectivityChalermsook P., Das S., Kook Y., Laekhanukit B., Liu Y.P., Peng R., Sellke M., Vaz D.2021Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    ,pp. 1206-1225
    5
    5Approximating rooted steiner networksCheriyan J., Laekhanukit B., Naves G., Vetta A.2012Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    ,pp. 1499-1511
    6
    6Parameters of two-prover-one-round game and the hardness of connectivity problemsLaekhanukit B.2014Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    ,pp. 1626-1643
    20
    7Routing regardless of network stabilityLaekhanukit B., Vetta A., Wilfong G.2012Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    7501 LNCS,pp. 719-730
    0
    8Graph products revisited: Tight approximation hardness of induced matching, poset dimension and moreChalermsook P., Laekhanukit B., Nanongkai D.2013Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    ,pp. 1557-1576
    35
    9On approximating degree-bounded network design problemsGuo X., Kortsarz G., Laekhanukit B., Li S., Vaz D., Xian J.2020Leibniz International Proceedings in Informatics, LIPIcs
    176
    0
    10From Gap-ETH to FPT-inapproximability: Clique, dominating set, and moreChalermsook P., Cygan M., Kortsarz G., Laekhanukit B., Laekhanukit B., Manurangsi P., Nanongkai D., Trevisan L.2017Annual Symposium on Foundations of Computer Science - Proceedings
    2017-October,pp. 743-754
    49
    11Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sortingYingchareonthawornchai S., Roy P.C., Laekhanukit B., Torng E., Deb K.2020GECCO 2020 Companion - Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion
    ,pp. 185-186
    1
    12New Tools and Connections for Exponential-Time ApproximationBansal N., Chalermsook P., Laekhanukit B., Nanongkai D., Nederlof J.2019Algorithmica
    81(10),pp. 3993-4009
    6
    13Surviving in directed graphs: A quasi-polynomial-time polylogarithmic approximation for two-connected directed steiner treeGrandoni F., Laekhanukit B.2017Proceedings of the Annual ACM Symposium on Theory of Computing
    Part F128415,pp. 420-428
    4
    14A bad example for the iterative rounding method for mincost k-connected spanning subgraphsAazami A., Cheriyan J., Laekhanukit B.2013Discrete Optimization
    10(1),pp. 25-41
    7
    15On the parameterized complexity of approximating dominating setKarthik C., Laekhanukit B., Manurangsi P.2019Journal of the ACM
    66(5)
    15
    16On Approximating Degree-Bounded Network Design ProblemsGuo X., Kortsarz G., Laekhanukit B., Li S., Vaz D., Xian J.2022Algorithmica
    0
    17Survivable network design for group connectivity in low-treewidth graphsChalermsook P., Das S., Even G., Laekhanukit B., Laekhanukit B., Vaz D.2018Leibniz International Proceedings in Informatics, LIPIcs
    116
    1
    18A rounding by sampling approach to the minimum size k-arc connected subgraph problemLaekhanukit B., Oveis Gharan S., Singh M., Singh M.2012Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    7391 LNCS(PART 1),pp. 606-616
    6
    19Improved hardness of approximation for Stackelberg shortest-path pricingBriest P., Chalermsook P., Khanna S., Laekhanukit B., Nanongkai D.2010Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    6484 LNCS,pp. 444-454
    13
    20Approximating rooted Steiner networksCheriyan J., Laekhanukit B., Naves G., Naves G., Vetta A.2014ACM Transactions on Algorithms
    11(2)
    6
    21Approximating directed Steiner problems via tree embeddingLaekhanukit B.2016Leibniz International Proceedings in Informatics, LIPIcs
    55
    4
    22An improved approximation algorithm for minimum-cost subset k-connectivityLaekhanukit B.2011Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    6755 LNCS(PART 1),pp. 13-24
    8
    23On the complexity of closest pair via polar-pair of point-setsDavid R., Karthik C., Laekhanukit B.2019SIAM Journal on Discrete Mathematics
    33(1),pp. 509-527
    9
    24On survivable set connectivityChalermsook P., Grandoni F., Laekhanukit B.2015Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    2015-January(January),pp. 25-36
    5
    25O(log2 k/ log log k)-approximation algorithm for directed steiner tree: A tight quasi-polynomial-time algorithmGrandoni F., Laekhanukit B., Li S.2019Proceedings of the Annual ACM Symposium on Theory of Computing
    ,pp. 253-264
    14
    26Faster algorithms for semi-matching problemsFakcharoenphol J., Laekhanukit B., Nanongkai D.2014ACM Transactions on Algorithms
    10(3)
    14
    27Approximating Spanners and Directed Steiner ForestChlamtáč E., Dinitz M., Kortsarz G., Laekhanukit B.2020ACM Transactions on Algorithms
    16(3)
    1
    28On the complexity of closest pair via polar-pair of point-setsDavid R., Karthik C., Laekhanukit B., Laekhanukit B.2018Leibniz International Proceedings in Informatics, LIPIcs
    99,pp. 281-2815
    2
    29Approximation algorithms for minimum-cost k-(S, T ) connected digraphsCheriyan J., Laekhanukit B.2013SIAM Journal on Discrete Mathematics
    27(3),pp. 1450-1481
    4
    30An O(log 2 k)-Approximation algorithm for the k-vertex connected spanning Subgraph problemFakcharoenphol J., Laekhanukit B.2012SIAM Journal on Computing
    41(5),pp. 1095-1109
    15
    31On the parameterized complexity of approximating dominating setKarthik C., Laekhanukit B., Laekhanukit B., Manurangsi P.2018Proceedings of the Annual ACM Symposium on Theory of Computing
    ,pp. 815-826
    18
    32Non-redistributive second welfare theoremsLaekhanukit B., Naves G., Vetta A.2012Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    7695 LNCS,pp. 227-243
    0
    33Faster algorithms for semi-matching problemsFakcharoenphol J., Laekhanukit B., Nanongkai D.2010Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    6198 LNCS(PART 1),pp. 176-187
    11
    34Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphsChalermsook P., Das S., Laekhanukit B., Vaz D., Vaz D.2017Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    0,pp. 737-751
    4
    35Pre-reduction graph products: Hardnesses of properly learning DFAs and approximating EDP on DAGsChalermsook P., Laekhanukit B., Laekhanukit B., Nanongkai D.2014Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
    ,pp. 444-453
    4
    36An O(log2 k)-Approximation algorithm for the k-Vertex connected spanning subgraph problemFakcharoenphol J., Laekhanukit B.2008Proceedings of the Annual ACM Symposium on Theory of Computing
    ,pp. 153-158
    25
    37Routing regardless of network stabilityLaekhanukit B., Vetta A., Wilfong G.2014Algorithmica
    70(3),pp. 561-593
    0
    38An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph ProblemLaekhanukit B.2015Algorithmica
    72(3),pp. 714-733
    7
    39Coloring graph powers: Graph product bounds and hardness of approximationChalermsook P., Laekhanukit B., Nanongkai D.2014Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    8392 LNCS,pp. 409-420
    5