BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Switzerland
1 × United Kingdom
Collaborated with:
J.Fakcharoenphol ∅ S.O.Gharan M.Singh D.Nanongkai
Talks about:
algorithm (3) problem (3) connect (3) subgraph (2) approxim (2) minimum (2) approach (1) vertex (1) subset (1) improv (1)

Person: Bundit Laekhanukit

DBLP DBLP: Laekhanukit:Bundit

Contributed to:

ICALP (1) 20122012
ICALP (1) 20112011
ICALP (1) 20102010
STOC 20082008

Wrote 4 papers:

ICALP-v1-2012-LaekhanukitGS #approach #problem
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.
ICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost #set
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (BL), pp. 13–24.
ICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem
Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
STOC-2008-FakcharoenpholL #algorithm #approximate #problem
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.