An Analysis of Phase Transition in NK Landscapes. - Yong Gao 001; Joseph C. Culberson (J. Artif. Intell. Res., 2002)

On the Treewidth of NK Landscapes. - Yong Gao 001; Joseph C. Culberson (GECCO, 2003)

Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference. - Yong Gao 001 (UAI, 2003)

Analysis on the redundancy of wireless sensor networks. - Yong Gao 001; Kui Wu 001; Fulu Li (WSNA, 2003)

Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. - Yong Gao 001; Joseph C. Culberson (CP, 2004)

Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. - Joseph C. Culberson; Yong Gao 001; Calin Anton (IJCAI, 2005)

Resolution complexity of random constraint satisfaction problems: Another half of the story. - Yong Gao 001; Joseph C. Culberson (Discret. Appl. Math., 2005)

Space Complexity of Estimation of Distribution Algorithms. - Yong Gao 001; Joseph C. Culberson (Evol. Comput., 2005)

Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks. - Kui Wu 001; Yong Gao 001; Fulu Li; Yang Xiao 001 (Mob. Networks Appl., 2005)

On the Threshold of Having a Linear Treewidth in Random Graphs. - Yong Gao 001 (COCOON, 2006)

Speeding Up Pairwise Sequence Alignments: A Scoring Scheme Reweighting Based Approach. - Yong Gao 001; Michael Henderson (BIBE, 2007)

Consistency and Random Constraint Satisfaction Models. - Yong Gao 001; Joseph C. Culberson (J. Artif. Intell. Res., 2007)

Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems. - Yong Gao 001 (AAAI, 2008)

Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. - Yong Gao 001 (SAT, 2008)

A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability - Yong Gao 001 (CoRR, 2008)

Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability. - Yong Gao 001 (Artif. Intell., 2009)

A note on the hardness of graph diameter augmentation problems - James Nastos; Yong Gao 001 (CoRR, 2009)

Threshold dominating cliques in random graphs and interval routing. - Yong Gao 001 (J. Discrete Algorithms, 2009)

The degree distribution of random k-trees. - Yong Gao 001 (Theor. Comput. Sci., 2009)

A Novel Branching Strategy for Parameterized Graph Modification Problems. - James Nastos; Yong Gao 001 (COCOA (2), 2010)

Algorithms for Answering Geo-Range Query. - Xi Zhang; Kui Wu 001; Yong Gao 001 (GLOBECOM, 2010)

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes - James Nastos; Yong Gao 001 (CoRR, 2010)

Statistical behavior of embeddedness and communities of overlapping cliques in online social networks. - Ajay Sridharan; Yong Gao 001; Kui Wu 001; James Nastos (INFOCOM, 2011)

Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs. - Yong Gao 001 (Discret. Appl. Math., 2012)

Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes. - James Nastos; Yong Gao 001 (Discret. Math. Algorithms Appl., 2012)

The parametric complexity of graph diameter augmentation. - Yong Gao 001; Donovan R. Hare; James Nastos (Discret. Appl. Math., 2013)

The cluster deletion problem for cographs. - Yong Gao 001; Donovan R. Hare; James Nastos (Discret. Math., 2013)

Familial groups in social networks. - James Nastos; Yong Gao 001 (Soc. Networks, 2013)

Super Solutions of Random Instances of Satisfiability. - Peng Zhang; Yong Gao 001 (FAW, 2015)

Exploring triad-rich substructures by graph-theoretic characterizations in complex networks. - Songwei Jia; Lin Gao 006; Yong Gao 001; James Nastos; Xiao Wen; Xindong Zhang; Haiyang Wang (CoRR, 2016)

On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs. - Congsong Zhang; Yong Gao 001 (COCOON, 2017)

A Random Model for Argumentation Framework: Phase Transitions, Empirical Hardness, and Heuristics. - Yong Gao 001 (IJCAI, 2017)

A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming. - Peng Zhang; Yong Gao 001 (Theor. Comput. Sci., 2017)

Viewing the Meso-Scale Structures in Protein-Protein Interaction Networks Using 2-Clubs. - Songwei Jia; Lin Gao 006; Yong Gao 001; James Nastos; Xiao Wen; Xiaotai Huang; Haiyang Wang (IEEE Access, 2018)

Improving Single-Cell RNA-seq Clustering by Integrating Pathways. - Chenxing Zhang; Lin Gao 006; Bingbo Wang; Yong Gao 001 (Briefings Bioinform., 2021)

CCIP: predicting CTCF-mediated chromatin loops with transitivity. - Weibing Wang; Lin Gao 006; Yusen Ye; Yong Gao 001 (Bioinform., 2021)

Evaluation and comparison of multi-omics data integration methods for cancer subtyping. - Ran Duan; Lin Gao 006; Yong Gao 001; Yuxuan Hu 004; Han Xu; Mingfeng Huang; Kuo Song; Hongda Wang; Yongqiang Dong; Chaoqun Jiang; Chenxing Zhang; Songwei Jia (PLoS Comput. Biol., 2021)

Learning Branching Heuristics from Graph Neural Networks. - Congsong Zhang; Yong Gao 001; James Nastos (CoRR, 2022)

A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems. - Congsong Zhang; Yong Gao 001; James Nastos (IEEE Trans. Neural Networks Learn. Syst., 2024)

The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs. - Congsong Zhang; Yong Gao 001; James Nastos (Discret. Appl. Math., 2025)