Xing Gao

collaborators

2 papers

math.CO2026

Stability of nontrivial graph pairs

Xiaomeng Wang, Xing Gao

A graph pair $(I^, I^£)$ is called stable if every automorphism of the direct product $I^ \times I^£$ is induced componentwise by automorphisms of $I^$ and $I^£$ . A graph is twin-free i…

cs.DS2025

Learning-Augmented Algorithms for Boolean Satisfiability

Idan Attias, Xing Gao, Lev Reyzin

Learning-augmented algorithms are a prominent recent development in beyond worst-case analysis. In this framework, a problem instance is provided with a prediction (``advice'') fro…