Yijia Chen

activity

20162025

most citedSome lower bounds in parameterized

AC^{0}

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2023

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

Yijia Chen, Yi Feng, Bundit Laekhanukit +1

In the parameterized $k$ -clique problem, or $k$ -Clique for short, we are given a graph $G$ and a parameter $k \geq 1$ . The goal is to decide whether there exist $k$ vertices in $G$ t…

cs.CC2017

The Hardness of Embedding Grids and Walls

Yijia Chen, Martin Grohe, Bingkai Lin

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedd…

cs.CC2016★ 1 cited

Some lower bounds in parameterized $AC^{0}$

Yijia Chen, Joerg Flum

We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical $AC^{0}$ . Among others, we derive such a lower bound for al…

Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique

The Hardness of Embedding Grids and Walls

Some lower bounds in parameterized AC0

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

Some lower bounds in parameterized $AC^{0}$