default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBingkai Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Shuangle Li, Bingkai Lin, Yuwei Liu:
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. ICALP 2024: 107:1-107:20- [c13]Venkatesan Guruswami
, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. STOC 2024: 24-35 - [i17]Shuangle Li, Bingkai Lin, Yuwei Liu:
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH. CoRR abs/2402.09825 (2024) - [i16]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. CoRR abs/2404.08870 (2024) - [i15]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c12]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
Improved Hardness of Approximating k-Clique under ETH. FOCS 2023: 285-306 - [c11]Huairui Chu, Bingkai Lin:
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. ISAAC 2023: 19:1-19:20 - [c10]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
Constant Approximating Parameterized k-SETCOVER is W[2]-hard. SODA 2023: 3305-3316 - [i14]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
Improved Hardness of Approximating k-Clique under ETH. CoRR abs/2304.02943 (2023) - [i13]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under ETH. CoRR abs/2311.16587 (2023) - [i12]Bingkai Lin, Huairui Chu:
FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. CoRR abs/2312.11944 (2023) - [i11]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under ETH. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c9]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
On Lower Bounds of Approximating Parameterized k-Clique. ICALP 2022: 90:1-90:18 - [i10]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
Constant Approximating Parameterized k-SetCover is W[2]-hard. CoRR abs/2202.04377 (2022) - 2021
- [j5]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM 68(3): 16:1-16:40 (2021) - [c8]Bingkai Lin:
Constant approximating k-clique is w[1]-hard. STOC 2021: 1749-1756 - [i9]Bingkai Lin:
Constant Approximating k-Clique is W[1]-hard. CoRR abs/2102.04769 (2021) - [i8]Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang:
On Lower Bounds of Approximating Parameterized k-Clique. CoRR abs/2111.14033 (2021) - 2020
- [c7]Ken-ichi Kawarabayashi, Bingkai Lin:
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut. SODA 2020: 990-999
2010 – 2019
- 2019
- [j4]Yijia Chen, Bingkai Lin:
The Constant Inapproximability of the Parameterized Dominating Set Problem. SIAM J. Comput. 48(2): 513-533 (2019) - [c6]Bingkai Lin:
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem. ICALP 2019: 81:1-81:15 - [i7]Bingkai Lin:
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem. CoRR abs/1902.03702 (2019) - [i6]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR abs/1909.01986 (2019) - [i5]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j3]Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin:
Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1398-1403 (2018) - [j2]Bingkai Lin:
The Parameterized Complexity of the k-Biclique Problem. J. ACM 65(5): 34:1-34:23 (2018) - 2017
- [j1]Bingkai Lin, Yijia Chen:
The parameterized complexity of k-edge induced subgraphs. Inf. Comput. 252: 138-160 (2017) - [c5]Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. WG 2017: 180-192 - [i4]Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. CoRR abs/1703.06423 (2017) - 2016
- [c4]Yijia Chen, Bingkai Lin:
The Constant Inapproximability of the Parameterized Dominating Set Problem. FOCS 2016: 505-514 - 2015
- [c3]Bingkai Lin:
The Parameterized Complexity of k-Biclique. SODA 2015: 605-615 - [i3]Yijia Chen, Bingkai Lin:
The Constant Inapproximability of the Parameterized Dominating Set Problem. CoRR abs/1511.00075 (2015) - 2014
- [i2]Bingkai Lin:
The Parameterized Complexity of k-Biclique. CoRR abs/1406.3700 (2014) - 2013
- [c2]Xiaojie Deng, Bingkai Lin, Chihao Zhang:
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width. FAW-AAIM 2013: 315-324 - 2012
- [c1]Bingkai Lin, Yijia Chen:
The Parameterized Complexity of k-Edge Induced Subgraphs. ICALP (1) 2012: 641-652 - 2011
- [i1]Bingkai Lin, Yijia Chen:
The parameterized complexity of k-edge induced subgraphs. CoRR abs/1105.0477 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
