Bundit Laekhanukit
Orcid: 0000-0002-4476-8914
According to our database1,
Bundit Laekhanukit
authored at least 51 papers
between 2008 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
1
1
2
1
2
5
2
2
2
2
3
2
1
1
3
1
2
1
1
3
1
1
3
2
2
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
ACM Trans. Algorithms, January, 2025
2024
Breaking the Barrier: A Polynomial-Time Polylogarithmic Approximation for Directed Steiner Tree.
CoRR, 2024
2023
Oper. Res. Lett., May, 2023
Simple Combinatorial Construction of the k<sup>o(1)</sup>-Lower Bound for Approximating the Parameterized k-Clique.
CoRR, 2023
2022
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
ACM Trans. Algorithms, 2020
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More.
SIAM J. Comput., 2020
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs.
Proceedings of the Approximation, 2020
2019
SIAM J. Discret. Math., 2019
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm.
SIAM J. Comput., 2019
Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding.
CoRR, 2019
<i>O</i>(log<sup>2</sup> <i>k</i> / log log <i>k</i>)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
O(log<sup>2</sup>k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm.
CoRR, 2018
On subexponential running times for approximating directed Steiner tree and related problems.
CoRR, 2018
Proceedings of the Approximation, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree.
CoRR, 2016
CoRR, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem.
Algorithmica, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
SIAM J. Discret. Math., 2013
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs.
Discret. Optim., 2013
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
An O(log<sup>2k)</sup>-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem.
SIAM J. Comput., 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
An Improved Approximation Algorithm for Minimum-Cost Subset <i>k</i>-Connectivity - (Extended Abstract).
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
2008
An o(log<sup>2</sup> k)-approximation algorithm for the k-vertex connected spanning subgraph problem.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008