Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs. - Jiawei Gao 001; Ton Kloks; Sheung-Hung Poon (WALCOM, 2013)

Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. - Marco Carmosino; Jiawei Gao 001; Russell Impagliazzo; Ivan Mihajlin; Ramamohan Paturi; Stefan Schneider 003 (Electron. Colloquium Comput. Complex., 2015)

Orthogonal Vectors is hard for first-order properties on sparse graphs. - Jiawei Gao 001; Russell Impagliazzo (Electron. Colloquium Comput. Complex., 2016)

On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs. - Jiawei Gao 001 (IPEC, 2019)

The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games. - Jiawei Gao 001 (CoRR, 2019)

On the Fine-grained Complexity of Least Weight Subsequence in Graphs. - Jiawei Gao 001 (Electron. Colloquium Comput. Complex., 2019)

The Fine-Grained Complexity of Strengthenings of First-Order Logic. - Jiawei Gao 001; Russell Impagliazzo (Electron. Colloquium Comput. Complex., 2019)

Completeness for First-order Properties on Sparse Structures with Algorithmic Applications. - Jiawei Gao 001; Russell Impagliazzo; Antonina Kolokolova; Ryan Williams 001 (ACM Trans. Algorithms, 2019)

The Fine-Grained Complexity of Problems Expressible by First-Order Logic and Its Extensions. - Jiawei Gao 001 (2019)