Yijia Chen
Yijia Chen
Verified email at fudan.edu.cn - Homepage
Title
Cited by
Cited by
Year
On parameterized approximability
Y Chen, M Grohe, M Grüber
International Workshop on Parameterized and Exact Computation, 109-120, 2006
842006
Lower bounds for kernelizations and other preprocessing procedures
Y Chen, J Flum, M Müller
Theory of Computing Systems 48 (4), 803-839, 2011
57*2011
Bounded nondeterminism and alternation in parameterized complexity theory
Y Chen, J Flum, M Grohe
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003
492003
Machine-based methods in parameterized complexity theory
Y Chen, J Flum, M Grohe
Theoretical Computer Science 339 (2-3), 167-199, 2005
402005
On parameterized path and chordless path problems
Y Chen, J Flum
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
392007
The constant inapproximability of the parameterized dominating set problem
Y Chen, B Lin
SIAM Journal on Computing 48 (2), 513-533, 2019
382019
Understanding the complexity of induced subgraph isomorphisms
Y Chen, M Thurley, M Weyer
International Colloquium on Automata, Languages, and Programming, 587-596, 2008
382008
Machine characterizations of the classes of the W-hierarchy
Y Chen, J Flum
International Workshop on Computer Science Logic, 114-127, 2003
322003
An isomorphism between subexponential and parameterized complexity theory
Y Chen, M Grohe
SIAM Journal on Computing 37 (4), 1228-1258, 2007
172007
A logic for PTIME and a parameterized halting problem
Y Chen, J Flum
Fields of logic and computation, 251-276, 2010
162010
The parameterized complexity of maximality and minimality problems
Y Chen, J Flum
Annals of Pure and Applied Logic 151 (1), 22-61, 2008
152008
Strong isomorphism reductions in complexity theory
S Buss, Y Chen, J Flum, SD Friedman, M Müller
Journal of Symbolic Logic 76 (4), 1381-1402, 2011
122011
On p-Optimal Proof Systems and Logics for PTIME
Y Chen, J Flum
International Colloquium on Automata, Languages, and Programming, 321-332, 2010
122010
On miniaturized problems in parameterized complexity theory
Y Chen, J Flum
Theoretical Computer Science 351 (3), 314-336, 2006
122006
Slicewise definability in first-order logic with bounded quantifier rank
Y Chen, J Flum, X Huang
arXiv preprint arXiv:1704.03167, 2017
112017
On optimal inverters
Y Chen, J Flum
The Bulletin of Symbolic Logic, 1-23, 2014
112014
On the complexity of Gödel's proof predicate
Y Chen, J Flum
The Journal of Symbolic Logic 75 (1), 239-254, 2010
112010
Some lower bounds in parameterized AC0
Y Chen, J Flum
Information and Computation 267, 116-134, 2019
102019
Hard instances of algorithms and proof systems
Y Chen, J Flum, M Müller
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-25, 2014
102014
From almost optimal algorithms to logics for complexity classes via listings and a halting problem
Y Chen, J Flum
Journal of the ACM (JACM) 59 (4), 1-34, 2012
72012
The system can't perform the operation now. Try again later.
Articles 1–20