Travelled to:
1 × Austria
1 × Canada
1 × Croatia
1 × Czech Republic
1 × Iceland
1 × Switzerland
1 × USA
1 × United Kingdom
2 × France
Collaborated with:
J.Flum B.Lin E.Shen M.Thurley M.Weyer X.Huang
Talks about:
logic (4) parameter (3) complex (3) subgraph (2) slicewis (2) problem (2) system (2) ptime (2) proof (2) order (2)
Person: Yijia Chen
DBLP: Chen:Yijia
Contributed to:
Wrote 12 papers:
- ICALP-v1-2012-LinC #complexity
- The Parameterized Complexity of k-Edge Induced Subgraphs (BL, YC), pp. 641–652.
- LICS-2012-ChenF #on the #order
- On the Ordered Conjecture (YC, JF), pp. 225–234.
- LICS-2011-ChenF #logic
- Listings and Logics (YC, JF), pp. 165–174.
- CSL-2010-ChenF #on the #problem #proving #slicing
- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.
- ICALP-v2-2010-ChenF #logic #on the #proving
- On p-Optimal Proof Systems and Logics for PTIME (YC, JF), pp. 321–332.
- LICS-2009-ChenF #logic #problem
- A Logic for PTIME and a Parameterized Halting Problem (YC, JF), pp. 397–406.
- ICALP-A-2008-ChenTW #complexity #comprehension #morphism
- Understanding the Complexity of Induced Subgraph Isomorphisms (YC, MT, MW), pp. 587–596.
- CSL-2007-ChenF #parametricity
- Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping (YC, JF), pp. 389–404.
- CSL-2003-ChenF
- Machine Characterization of the Classes of the W-Hierarchy (YC, JF), pp. 114–127.
- CSL-2001-ChenS #complexity
- Capture Complexity by Partition (YC, ES), pp. 84–98.
- CSL-2017-ChenFH #bound #first-order #logic #quantifier #rank #slicing
- Slicewise Definability in First-Order Logic with Bounded Quantifier Rank (YC, JF, XH), p. 16.
- CSL-2020-ChenF
- FO-Definability of Shrub-Depth (YC, JF), p. 16.