Bundit Laekhanukit

Available identifiers

zbMath Open laekhanukit.bunditMaRDI QIDQ487014

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6058195	2023-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q6084395	2023-10-31	Paper
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs	2023-07-03	Paper
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm	2023-04-28	Paper
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique	2023-04-15	Paper
On approximating degree-bounded network design problems	2022-05-03	Paper
Survivable Network Design Revisited: Group-Connectivity	2022-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q5009500	2021-08-04	Paper
Approximating Spanners and Directed Steiner Forest	2021-05-03	Paper
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More	2020-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q5115796	2020-08-18	Paper
On the Parameterized Complexity of Approximating Dominating Set	2020-02-11	Paper
O (log 2 k / log log k )-approximation algorithm for directed Steiner tree	2020-01-30	Paper
New tools and connections for exponential-time approximation	2019-09-10	Paper
On the parameterized complexity of approximating dominating set	2019-08-22	Paper
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems	2019-06-20	Paper
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743494	2019-05-10	Paper
On the Complexity of Closest Pair via Polar-Pair of Point-Sets	2019-03-20	Paper
Approximating Rooted Steiner Networks	2018-10-30	Paper
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds	2018-07-16	Paper
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4598214	2017-12-19	Paper
On Survivable Set Connectivity	2017-10-05	Paper
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree	2017-08-17	Paper
Faster Algorithms for Semi-Matching Problems	2016-04-11	Paper
An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem	2015-09-02	Paper
Routing regardless of network stability	2015-01-19	Paper
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation	2014-03-31	Paper
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs	2014-01-21	Paper
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem	2013-08-12	Paper
A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs	2013-03-13	Paper
An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem	2013-02-04	Paper
Routing regardless of network stability	2012-09-25	Paper
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity	2011-07-06	Paper
Faster Algorithms for Semi-matching Problems (Extended Abstract)	2010-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q3549695	2009-01-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Bundit Laekhanukit