• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

LIN Bingkai  Lin Bingkai

ORCIDConnect your ORCID iD *help
… Alternative Names

Lin Bingkai  リン ビンカイ

Less
Researcher Number 00780743
Affiliation (Current) 2026: 国立情報学研究所, ビッグデータ数理国際研究センター, 特任研究員
Affiliation (based on the past Project Information) *help 2016 – 2017: 国立情報学研究所, ビッグデータ数理国際研究センター, 特任研究員
Review Section/Research Field
Principal Investigator
Theory of informatics
Keywords
Principal Investigator
inapproximability / lower bound / dominating set / アルゴリズム / lower bounds / k-grid problem / approximation algorithms / parameterized complexity / Dominating set problem / Lower bounds / FPT-inapproximation
  • Research Projects

    (1 results)
  • Research Products

    (4 results)
  • Co-Researchers

    (2 People)
  •  Exploring the limits of approximation using fixed-parameter tractable algorithmsPrincipal Investigator

    • Principal Investigator
      LIN Bingkai
    • Project Period (FY)
      2016 – 2017
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Research Field
      Theory of informatics
    • Research Institution
      National Institute of Informatics

All 2017 2016

All Journal Article Presentation

  • [Journal Article] The Hardness of Embedding Grids and Walls2017

    • Author(s)
      Chen Yijia、Grohe Martin、Lin Bingkai
    • Journal Title

      International Workshop on Graph-Theoretic Concepts in Computer Science

      Volume: 1 Pages: 180-192

    • DOI

      10.1007/978-3-319-68705-6_14

    • ISBN
      9783319687049, 9783319687056
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H07409
  • [Journal Article] The parameterized complexity of k-edge induced subgraphs2017

    • Author(s)
      Lin Bingkai、Chen Yijia
    • Journal Title

      Information and Computation

      Volume: 252 Pages: 138-160

    • DOI

      10.1016/j.ic.2016.10.004

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H07409
  • [Presentation] Gap Amplification Using Bipartite Random Graphs2017

    • Author(s)
      Bingkai Lin
    • Organizer
      Dagstuhl Seminar 17041
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H07409
  • [Presentation] The Constant Inapproximability of the Parameterized Dominating Set Problem2016

    • Author(s)
      Yijia Chen, Bingkai Lin
    • Organizer
      FOCS 2016
    • Place of Presentation
      New Brunswick, New Jersey, USA
    • Year and Date
      2016-10-09
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H07409
  • 1.  Chen Yijia
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 3 results
  • 2.  Grohe Martin
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi