Chen, Yijia - Department of Computer Science, Shanghai Jiao Tong University

• AN ISOMORPHISM BETWEEN SUBEXPONENTIAL AND PARAMETERIZED COMPLEXITY THEORY
• The Downward Transfer of Elementary Satisfiability of Partition Logics #
• Understanding the Complexity of Induced Subgraph Isomorphisms
• Machine Characterizations of the Classes of the WHierarchy
• The Parameterized Complexity of Maximality and Minimality Problems Yijia Chen # J org Flum +
• Capture Complexity by Partition Yijia Chen #1 and Enshao Shen ##2
• Lower Bounds for Kernelizations and Other Preprocessing Yijia Chen #
• An analysis of the W # hierarchy Yijia Chen # Jorg Flum + Martin Grohe #
• Consistency and Optimality Yijia Chen 1 , Jorg Flum 2 , and Moritz Muller 3
• On Parameterized Path and Chordless Path Problems BASICS, Department of Computer Science
• A logic for PTIME and a parameterized halting problem Department of Computer Science
• Hard instances of algorithms and proof systems Yijia Chen 1 , Jorg Flum 2 , and Moritz Muller 3
• On Parameterized Approximability # Yijia Chen + Martin Grohe # Magdalena Gr uber
• Bounded Nondeterminism and Alternation in Parameterized Complexity Theory Yijia Chen # Jorg Flum + Martin Grohe #
• On the Complexity of G odel's Proof Predicate Yijia Chen # Jorg Flum +
• Subexponential Time and FixedParameter Tractability: Exploiting the Miniaturization Mapping
• On slicewise monotone parameterized problems and optimal proof systems for TAUT
• On miniaturized problems in parameterized complexity theory Institut fur Informatik,
• Listings and logics Department of Computer Science
• On poptimal proof systems and logics for PTIME Yijia Chen 1 and Jorg Flum 2
• Strong isomorphism reductions in complexity theory sbuss@math.ucsd.edu
• Machinebased Methods in Parameterized Complexity Theory Yijia Chen # Jorg Flum + Martin Grohe #
• On Parameterized Approximability Yijia Chen Martin Grohe Magdalena Gruber
• The Parameterized Complexity of Maximality and Minimality Problems Yijia Chen
• Bounded Nondeterminism and Alternation in Parameterized Complexity Theory Martin Grohe
• On slicewise monotone parameterized problems and optimal proof systems for TAUT
• On Parameterized Path and Chordless Path Problems BASICS, Department of Computer Science
• On miniaturized problems in parameterized complexity theory Institut fur Informatik,
• Consistency and Optimality Yijia Chen1
• Machine-based Methods in Parameterized Complexity Theory Martin Grohe
• On the Complexity of Godel's Proof Predicate Yijia Chen
• An analysis of the W Yijia Chen
• Strong isomorphism reductions in complexity theory sbuss@math.ucsd.edu
• On p-optimal proof systems and logics for PTIME Yijia Chen1
• Hard instances of algorithms and proof systems Yijia Chen1
• Understanding the Complexity of Induced Subgraph Isomorphisms
• A logic for PTIME and a parameterized halting problem Department of Computer Science
• Lower Bounds for Kernelizations and Other Preprocessing Yijia Chen
• Capture Complexity by Partition Yijia Chen1
• Machine Characterizations of the Classes of the W-Hierarchy
• AN ISOMORPHISM BETWEEN SUBEXPONENTIAL AND PARAMETERIZED COMPLEXITY THEORY
• Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping