Yijia Chen

Orcid: 0000-0001-7033-9593

According to our database1, Yijia Chen authored at least 64 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Preface for the special issue of Theoretical Computer Science in honor of the 60<sup>th</sup> birthday of Yuxi Fu.
Theor. Comput. Sci., February, 2023

Simple Combinatorial Construction of the k<sup>o(1)</sup>-Lower Bound for Approximating the Parameterized k-Clique.
CoRR, 2023

Curvature-Based Machine Vision Method for Measuring the Dimension of Ball Screws.
IEEE Access, 2023

PMMVar: Leveraging Multi-level Protein Structures for Enhanced Coding Variant Pathogenicity Prediction.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
A Surprising Relationship Between Descriptive Complexity and Proof Complexity.
Bull. EATCS, 2022

A parameterized halting problem, Δ<sub>0</sub> truth and the MRDP theorem.
CoRR, 2022

Optimization of a Real-Time Wavelet-Based Algorithm for Improving Speech Intelligibility.
CoRR, 2022

On Algorithms Based on Finitely Many Homomorphism Counts.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Non-Hodgkin Lymphoma CAR T Cells: Enhancement on Synnotch Signaling, GLUT1 expression, and PGC1a expression brings Potential Clinical Advancement in Therapy.
Proceedings of the 3rd International Symposium on Artificial Intelligence for Medicine Sciences, 2022

A DC-DC converter with input full active bridge and output semi active bridge for bipolar LVDC systems.
Proceedings of the IEEE Industry Applications Society Annual Meeting, 2022

2021
A Hyperspectral Image Classification Method Using Multifeature Vectors and Optimized KELM.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2021

On Queries Determined by a Constant Number of Homomorphism Counts.
CoRR, 2021

Forbidden Induced Subgraphs and the Łoś-Tarski Theorem.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Improving Hashing Algorithms for Similarity Search \textitvia MLE and the Control Variates Trick.
Proceedings of the Asian Conference on Machine Learning, 2021

2020
FO-Definability of Shrub-Depth.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Self-Evolving Adaptive Learning for Personalized Education.
Proceedings of the Companion Publication of the 2020 ACM Conference on Computer Supported Cooperative Work and Social Computing, 2020

Parameterized Parallel Computing and First-Order Logic.
Proceedings of the Fields of Logic and Computation III, 2020

2019
The Constant Inapproximability of the Parameterized Dominating Set Problem.
SIAM J. Comput., 2019

The parameterized space complexity of model-checking bounded variable first-order logic.
Log. Methods Comput. Sci., 2019

Some lower bounds in parameterized AC<sup>0</sup>.
Inf. Comput., 2019

The Complexity of Homomorphism Indistinguishability.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Tree-depth, quantifier elimination, and quantifier rank.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

The Complexity of Limited Belief Reasoning - The Quantifier-Free Case.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Logic and Computational Complexity (NII Shonan Meeting 2017-13).
NII Shonan Meet. Rep., 2017

The parameterized complexity of k-edge induced subgraphs.
Inf. Comput., 2017

The Hardness of Embedding Grids and Walls.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Some Lower Bounds in Parameterized AC^0.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture.
Proceedings of the Fields of Logic and Computation II, 2015

2014
On Optimal Inverters.
Bull. Symb. Log., 2014

Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity.
Electron. Colloquium Comput. Complex., 2013

Consistency, optimality, and incompleteness.
Ann. Pure Appl. Log., 2013

2012
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem.
J. ACM, 2012

On the Ordered Conjecture.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

The Exponential Time Hypothesis and the Parameterized Clique Problem.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

A Parameterized Halting Problem.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Lower Bounds for Kernelizations and Other Preprocessing Procedures.
Theory Comput. Syst., 2011

Strong isomorphism reductions in complexity theory.
J. Symb. Log., 2011

Hard instances of algorithms and proof systems.
Electron. Colloquium Comput. Complex., 2011

Listings and logics.
Electron. Colloquium Comput. Complex., 2011

Consistency and Optimality.
Proceedings of the Models of Computation in Context, 2011

2010
On the complexity of Gödel's proof predicate.
J. Symb. Log., 2010

On optimal proof systems and logics for PTIME.
Electron. Colloquium Comput. Complex., 2010

On <i>p</i>-Optimal Proof Systems and Logics for PTIME.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping.
J. Log. Comput., 2009

2008
A logic for PTIME and a parameterized halting problem.
Electron. Colloquium Comput. Complex., 2008

The parameterized complexity of maximality and minimality problems.
Ann. Pure Appl. Log., 2008

Understanding the Complexity of Induced Subgraph Isomorphisms.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
An analysis of the W<sup>*</sup>-hierarchy.
J. Symb. Log., 2007

On Parameterized Approximability.
Electron. Colloquium Comput. Complex., 2007

Lower Bounds for Kernelizations.
Electron. Colloquium Comput. Complex., 2007

On Parameterized Path and Chordless Path Problems.
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006
On miniaturized problems in parameterized complexity theory.
Theor. Comput. Sci., 2006

An Isomorphism between Subexponential and Parameterized Complexity Theory
Electron. Colloquium Comput. Complex., 2006

2005
Machine-based methods in parameterized complexity theory.
Theor. Comput. Sci., 2005

2004
Model-checking problems, machines and parameterized complexity.
PhD thesis, 2004

2003
Machine Characterization of the Classes of the W-Hierarchy.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2001
Capture Complexity by Partition.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
The Downward Transfer of Elementary Satisfiability of Partition Logics.
Math. Log. Q., 2000

1997
Automatic Generation of Parallel Compiler-Partial Evaluation of Parallel Lambda Language .
Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997


  Loading...