Yijia Chen

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6161059	2023-06-26	Paper
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique	2023-04-15	Paper
https://portal.mardi4nfdi.de/entity/Q5874201	2023-02-07	Paper
A parameterized halting problem, $\Delta_0$ truth and the MRDP theorem	2022-11-11	Paper
Parameterized Parallel Computing and First-Order Logic	2022-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q5092416	2022-07-21	Paper
Game-theoretic analysis of Guts Poker	2021-08-14	Paper
Tree-depth, quantifier elimination, and quantifier rank	2021-01-20	Paper
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem	2021-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q5111186	2020-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q4972729	2019-11-26	Paper
Some lower bounds in parameterized $\mathrm{AC}^{0}$	2019-05-29	Paper
The Constant Inapproximability of the Parameterized Dominating Set Problem	2019-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q4608586	2018-03-21	Paper
The hardness of embedding grids and walls	2018-01-04	Paper
On the Ordered Conjecture	2017-05-16	Paper
The parameterized complexity of $k$-edge induced subgraphs	2016-12-22	Paper
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture	2015-09-22	Paper
Hard Instances of Algorithms and Proof Systems	2015-09-03	Paper
Consistency, optimality, and incompleteness	2015-08-27	Paper
ON OPTIMAL INVERTERS	2014-10-21	Paper
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem	2014-10-14	Paper
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem	2014-02-17	Paper
The Parameterized Complexity of k-Edge Induced Subgraphs	2013-08-12	Paper
The Exponential Time Hypothesis and the Parameterized Clique Problem	2013-01-07	Paper
A Parameterized Halting Problem	2012-09-05	Paper
Hard Instances of Algorithms and Proof Systems	2012-08-14	Paper
Strong isomorphism reductions in complexity theory	2011-12-23	Paper
Consistency and Optimality	2011-09-09	Paper
Lower bounds for kernelizations and other preprocessing procedures	2011-05-25	Paper
On p-Optimal Proof Systems and Logics for PTIME	2010-09-07	Paper
A Logic for PTIME and a Parameterized Halting Problem	2010-09-03	Paper
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT	2010-09-03	Paper
Lower Bounds for Kernelizations and Other Preprocessing Procedures	2010-07-28	Paper
On the complexity of Gödel's proof predicate	2010-03-15	Paper
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping	2009-03-05	Paper
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping	2009-03-02	Paper
Understanding the Complexity of Induced Subgraph Isomorphisms	2008-08-28	Paper
An Isomorphism Between Subexponential and Parameterized Complexity Theory	2008-08-14	Paper
The Parameterized Complexity of Maximality and Minimality Problems	2008-06-03	Paper
On Parameterized Approximability	2008-06-03	Paper
The parameterized complexity of maximality and minimality problems	2008-02-13	Paper
An analysis of the W*-hierarchy	2007-07-09	Paper
Computer Science Logic	2007-06-21	Paper
On miniaturized problems in parameterized complexity theory	2006-04-06	Paper
Parameterized and Exact Computation	2005-08-23	Paper
Machine-based methods in parameterized complexity theory	2005-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q4681813	2005-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4445690	2004-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4783303	2002-12-04	Paper
https://portal.mardi4nfdi.de/entity/Q4521123	2001-07-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yijia Chen