关注
Yijia Chen
Yijia Chen
在 cs.sjtu.edu.cn 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
On parameterized approximability
Y Chen, M Grohe, M Grüber
International Workshop on Parameterized and Exact Computation, 109-120, 2006
962006
The constant inapproximability of the parameterized dominating set problem
Y Chen, B Lin
SIAM Journal on Computing 48 (2), 513-533, 2019
662019
Bounded nondeterminism and alternation in parameterized complexity theory
Y Chen, J Flum, M Grohe
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003
572003
Lower bounds for kernelizations and other preprocessing procedures
Y Chen, J Flum, M Müller
Theory of Computing Systems 48, 803-839, 2011
55*2011
Understanding the complexity of induced subgraph isomorphisms
Y Chen, M Thurley, M Weyer
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
502008
On parameterized path and chordless path problems
Y Chen, J Flum
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
482007
Machine-based methods in parameterized complexity theory
Y Chen, J Flum, M Grohe
Theoretical Computer Science 339 (2-3), 167-199, 2005
442005
Machine characterizations of the classes of the W-hierarchy
Y Chen, J Flum
International Workshop on Computer Science Logic, 114-127, 2003
332003
An isomorphism between subexponential and parameterized complexity theory
Y Chen, M Grohe
SIAM Journal on Computing 37 (4), 1228-1258, 2007
202007
A logic for PTIME and a parameterized halting problem
Y Chen, J Flum
2009 24th Annual IEEE Symposium on Logic In Computer Science, 397-406, 2009
192009
The parameterized complexity of maximality and minimality problems
Y Chen, J Flum
Annals of Pure and Applied Logic 151 (1), 22-61, 2008
182008
Some lower bounds in parameterized AC0
Y Chen, J Flum
Information and Computation 267, 116-134, 2019
172019
The Complexity of Homomorphism Indistinguishability
J Böker, Y Chen, M Grohe, G Rattan
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
142019
Slicewise definability in first-order logic with bounded quantifier rank
Y Chen, J Flum, X Huang
arXiv preprint arXiv:1704.03167, 2017
142017
Strong isomorphism reductions in complexity theory
S Buss, Y Chen, J Flum, SD Friedman, M Müller
The Journal of Symbolic Logic 76 (4), 1381-1402, 2011
142011
On p-Optimal Proof Systems and Logics for PTIME
Y Chen, J Flum
International Colloquium on Automata, Languages, and Programming, 321-332, 2010
142010
On the complexity of Gödel's proof predicate
Y Chen, J Flum
The Journal of Symbolic Logic 75 (1), 239-254, 2010
142010
The exponential time hypothesis and the parameterized clique problem
Y Chen, K Eickmeyer, J Flum
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
132012
On miniaturized problems in parameterized complexity theory
Y Chen, J Flum
Theoretical Computer Science 351 (3), 314-336, 2006
132006
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
112014
系统目前无法执行此操作,请稍后再试。
文章 1–20