The Downward Transfer of Elementary Satisfiability of Partition Logics. - Enshao Shen; Yijia Chen 001 (Math. Log. Q., 2000)

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (CCC, 2003)

Machine Characterization of the Classes of the W-Hierarchy. - Yijia Chen 001; Jörg Flum (CSL, 2003)

On Miniaturized Problems in Parameterized Complexity Theory. - Yijia Chen 001; Jörg Flum (IWPEC, 2004)

Model-checking problems, machines and parameterized complexity. - Yijia Chen 001 (2004)

Machine-based methods in parameterized complexity theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (Theor. Comput. Sci., 2005)

An Isomorphism between Subexponential and Parameterized Complexity Theory. - Yijia Chen 001; Martin Grohe (CCC, 2006)

The Parameterized Complexity of Maximality and Minimality Problems. - Yijia Chen 001; Jörg Flum (IWPEC, 2006)

On Parameterized Approximability. - Yijia Chen 001; Martin Grohe; Magdalena Grüber (IWPEC, 2006)

On Parameterized Path and Chordless Path Problems. - Yijia Chen 001; Jörg Flum (CCC, 2007)

Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. - Yijia Chen 001; Jörg Flum (CSL, 2007)

Lower Bounds for Kernelizations. - Yijia Chen 001; Jörg Flum; Moritz Müller (Electron. Colloquium Comput. Complex., 2007)

An analysis of the W*-hierarchy. - Yijia Chen 001; Jörg Flum; Martin Grohe (J. Symb. Log., 2007)

Understanding the Complexity of Induced Subgraph Isomorphisms. - Yijia Chen 001; Marc Thurley; Mark Weyer (ICALP (1), 2008)

Lower Bounds for Kernelizations and Other Preprocessing Procedures. - Yijia Chen 001; Jörg Flum; Moritz Müller (CiE, 2009)

A Logic for PTIME and a Parameterized Halting Problem. - Yijia Chen 001; Jörg Flum (LICS, 2009)

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. - Yijia Chen 001; Jörg Flum (CSL, 2010)

On p-Optimal Proof Systems and Logics for PTIME. - Yijia Chen 001; Jörg Flum (ICALP (2), 2010)

On optimal proof systems and logics for PTIME. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2010)

On the complexity of Gödel's proof predicate. - Yijia Chen 001; Jörg Flum (J. Symb. Log., 2010)

Consistency and Optimality. - Yijia Chen 001; Jörg Flum; Moritz Müller (CiE, 2011)

Listings and Logics. - Yijia Chen 001; Jörg Flum (LICS, 2011)

Strong isomorphism reductions in complexity theory. - Sam Buss; Yijia Chen 001; Jörg Flum; Sy-David Friedman; Moritz Müller (J. Symb. Log., 2011)

A Parameterized Halting Problem. - Yijia Chen 001; Jörg Flum (The Multivariate Algorithmic Revolution and Beyond, 2012)

Hard Instances of Algorithms and Proof Systems. - Yijia Chen 001; Jörg Flum; Moritz Müller (CiE, 2012)

The Parameterized Complexity of k-Edge Induced Subgraphs. - Bingkai Lin; Yijia Chen 001 (ICALP (1), 2012)

The Exponential Time Hypothesis and the Parameterized Clique Problem. - Yijia Chen 001; Kord Eickmeyer; Jörg Flum (IPEC, 2012)

On the Ordered Conjecture. - Yijia Chen 001; Jörg Flum (LICS, 2012)

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. - Yijia Chen 001; Jörg Flum (J. ACM, 2012)

Consistency, optimality, and incompleteness. - Yijia Chen 001; Jörg Flum; Moritz Müller (Ann. Pure Appl. Log., 2013)

On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2013)

Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem. - Yijia Chen 001; Moritz Müller (MFCS (1), 2014)

On Optimal Inverters. - Yijia Chen 001; Jörg Flum (Bull. Symb. Log., 2014)

The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. - Yijia Chen 001; Jörg Flum (Fields of Logic and Computation II, 2015)

The Constant Inapproximability of the Parameterized Dominating Set Problem. - Yijia Chen 001; Bingkai Lin (FOCS, 2016)

Some Lower Bounds in Parameterized AC^0. - Yijia Chen 001; Jörg Flum (MFCS, 2016)

Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. - Yijia Chen 001; Jörg Flum; Xuangui Huang (CSL, 2017)

The Hardness of Embedding Grids and Walls. - Yijia Chen 001; Martin Grohe; Bingkai Lin (WG, 2017)

Logic and Computational Complexity (NII Shonan Meeting 2017-13). - Yijia Chen 001; Rodney G. Downey; Jörg Flum (NII Shonan Meet. Rep., 2017)

The Complexity of Limited Belief Reasoning - The Quantifier-Free Case. - Yijia Chen 001; Abdallah Saffidine; Christoph Schwering (IJCAI, 2018)

Tree-depth, quantifier elimination, and quantifier rank. - Yijia Chen 001; Jörg Flum (LICS, 2018)

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. - Yijia Chen 001; Moritz Müller; Keita Yokoyama (LICS, 2018)

The Complexity of Homomorphism Indistinguishability. - Jan Böker; Yijia Chen 001; Martin Grohe; Gaurav Rattan (MFCS, 2019)

Some lower bounds in parameterized AC0. - Yijia Chen 001; Jörg Flum (Inf. Comput., 2019)

The parameterized space complexity of model-checking bounded variable first-order logic. - Yijia Chen 001; Michael Elberfeld; Moritz Müller (Log. Methods Comput. Sci., 2019)

Parameterized Parallel Computing and First-Order Logic. - Yijia Chen 001; Jörg Flum (Fields of Logic and Computation III, 2020)

FO-Definability of Shrub-Depth. - Yijia Chen 001; Jörg Flum (CSL, 2020)

Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. - Yijia Chen 001; Jörg Flum (LICS, 2021)

On Queries Determined by a Constant Number of Homomorphism Counts. - Yijia Chen 001; Jörg Flum; Mingjun Liu; Zhiyang Xun (CoRR, 2021)

On Algorithms Based on Finitely Many Homomorphism Counts. - Yijia Chen 001; Jörg Flum; Mingjun Liu; Zhiyang Xun (MFCS, 2022)

A parameterized halting problem, Δ0 truth and the MRDP theorem. - Yijia Chen 001; Moritz Müller; Keita Yokoyama (CoRR, 2022)

A Surprising Relationship Between Descriptive Complexity and Proof Complexity. - Yijia Chen 001; Jörg Flum; Moritz Müller (Bull. EATCS, 2022)

Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique. - Yijia Chen 001; Yi Feng; Bundit Laekhanukit; Yanlin Liu (CoRR, 2023)

Simple Combinatorial Construction of the ko (1)-Lower Bound for Approximating the Parameterized k-Clique. - Yijia Chen 001; Yi Feng; Bundit Laekhanukit; Yanlin Liu (SOSA, 2025)

On Average Baby PIH and Its Applications. - Yuwei Liu; Yijia Chen 001; Shuangle Li; Bingkai Lin; Xin Zheng (STACS, 2025)

A Parameterized Halting Problem, $ Delta _0$ Truth and the Mrdp Theorem. - Yijia Chen 001; Moritz Müller; Keita Yokoyama (J. Symb. Log., 2025)

Some remarks on the uncolored versions of the original CFI-graphs. - Yijia Chen 001; Jörg Flum; Mingjun Liu (CoRR, 2025)