Bundit Laekhanukit

Featured in:

Articles

[2304.07516] Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique

Apr 15, 2023 | arxiv.org | Yi Feng |Bundit Laekhanukit |Yanlin Liu

Want to support truly open science and create access to research, regardless of disability? Sign up for the arXiv Accessibility Forum in September and Learn more.

Contact details

Emails

[email protected]

Socials & Sites

Try JournoFinder For Free

Search and contact over 1M+ journalist profiles, browse 100M+ articles, and unlock powerful PR tools.

Start Your 7-Day Free Trial →