Home
Home
Lin
Bingkai (林 冰凱)
Email: lin at nju.edu.cn
PO Box 603, 163 Xianlin Ave, Nanjing, Jiangsu Province, China, 210023
Ph.D. 2016, The University of Tokyo
I am
a National-Youth-1000-Talent Professor in the
Theory Group
at
Nanjing University
.
Research Interests:
graph theory, parameterized complexity, extremal combinatoric, hardness of
approximation
.
Talk at
ITCS, SHUFE
.
pdf
Talk at FOCS 2016,
pdf
Talk at PAAW,
pdf
Talk at ICALP 2019,
pdf
Talk at SODA 2020,
pdf
Publications:
with
Ken-ichi Kawarabayashi
,
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
. SODA 2020
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem.
ICALP 2019(track A)
,
best paper
The Parameterized Complexity of k-Biclique
.
Journal of the ACM (JACM)
, Volume 65 Issue 5 (2018)
Conference version:
The Parameterized Complexity of k-Biclique
.
SODA 2015
,
best paper and best student paper
with
Yijia Chen
,
The parameterized complexity of k-edge induced subgraphs
.
Information and Computation, Volume 252 (2017), 138-160
Conference version:
The parameterized complexity of k-edge induced subgraphs
.
ICALP 2012(track A)
with
Yijia Chen
,
The Constant Inapproximability of the Parameterized Dominating Set Problem
.
FOCS 2016
with
Yijia Chen
,
Martin Grohe
,
The hardness of embedding grids and walls
.
WG 2017
with
Chihao Zhang
,
Xiaojie Deng
,
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
.
FAW-AAIM 2013
with
Édouard Bonnet
,
László Egri,
Dániel Marx
,
Fixed-parameter Approximability of Boolean MinCSPs
.
On Parameterized Inapproximability of Several Optimization Problems
. PhD thesis 2016
Links:
School on Parameterized Algorithms and Complexity
Open Problem List
Parameterized Complexity Wiki
Ten
Lessons I wish I had been Taught
The Barrier of Meaning(an interesting discussion on the AI-problem)
Turning STOC 2017 into a “
T
heory Festival”
Graph Classes