Yong Gao
Affiliations:- University of British Columbia Okanagan, Irving K. Barber School of Arts and Sciences, BC, Canada
- University of Alberta, Department of Computing Science, Edmonton, AB, Canada (former)
According to our database1,
Yong Gao
authored at least 38 papers
between 2002 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
2021
Evaluation and comparison of multi-omics data integration methods for cancer subtyping.
PLoS Comput. Biol., 2021
Briefings Bioinform., 2021
2018
Viewing the Meso-Scale Structures in Protein-Protein Interaction Networks Using 2-Clubs.
IEEE Access, 2018
2017
A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming.
Theor. Comput. Sci., 2017
A Random Model for Argumentation Framework: Phase Transitions, Empirical Hardness, and Heuristics.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
2016
Exploring triad-rich substructures by graph-theoretic characterizations in complex networks.
CoRR, 2016
2015
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015
2013
2012
Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes.
Discret. Math. Algorithms Appl., 2012
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs.
Discret. Appl. Math., 2012
2011
Statistical behavior of embeddedness and communities of overlapping cliques in online social networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011
2010
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
CoRR, 2010
Proceedings of the Global Communications Conference, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
2009
J. Discrete Algorithms, 2009
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability.
Artif. Intell., 2009
2008
CoRR, 2008
Proceedings of the Theory and Applications of Satisfiability Testing, 2008
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008
2007
Speeding Up Pairwise Sequence Alignments: A Scoring Scheme Reweighting Based Approach.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007
2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Mob. Networks Appl., 2005
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
2004
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness.
Proceedings of the Principles and Practice of Constraint Programming, 2004
2003
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story.
Electron. Notes Discret. Math., 2003
Proceedings of the Second ACM International Conference on Wireless Sensor Networks and Applications, 2003
Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference.
Proceedings of the UAI '03, 2003
Proceedings of the Genetic and Evolutionary Computation, 2003
2002