Jiawei Gao

According to our database, Jiawei Gao authored at least 9 papers between 2013 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

The Fine-Grained Complexity of Problems Expressible by First-Order Logic and Its Extensions.

Jiawei Gao

PhD thesis, 2019

The Fine-Grained Complexity of Strengthenings of First-Order Logic.

Jiawei Gao, Russell Impagliazzo

Electron. Colloquium Comput. Complex., 2019

On the Fine-grained Complexity of Least Weight Subsequence in Graphs.

Jiawei Gao

Electron. Colloquium Comput. Complex., 2019

The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games.

Jiawei Gao

CoRR, 2019

On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs.

Jiawei Gao

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2017

Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications.

Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Orthogonal Vectors is hard for first-order properties on sparse graphs.

Jiawei Gao, Russell Impagliazzo

Electron. Colloquium Comput. Complex., 2016

Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility.

Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2013

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and <i>k</i>-Planar Graphs.

Jiawei Gao, Ton Kloks, Sheung-Hung Poon

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013