default search action
Yong Gao 0001
Person information
- affiliation: University of British Columbia Okanagan, Irving K. Barber School of Arts and Sciences, BC, Canada
- affiliation (former): University of Alberta, Department of Computing Science, Edmonton, AB, Canada
Other persons with the same name
- Yong Gao — disambiguation page
- Yong Gao 0002 — Chinese Academy of Sciences, Institute of Automation, Beijing, China
- Yong Gao 0003
— Peking University, Institute of Remote Sensing and Geographic Information System, Beijing, China
- Yong Gao 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Congsong Zhang
A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems. IEEE Trans. Neural Networks Learn. Syst. 35(9): 11746-11760 (2024) - 2022
- [i10]Congsong Zhang, Yong Gao, James Nastos:
Learning Branching Heuristics from Graph Neural Networks. CoRR abs/2211.14405 (2022) - 2021
- [j19]Chenxing Zhang, Lin Gao, Bingbo Wang
Improving Single-Cell RNA-seq Clustering by Integrating Pathways. Briefings Bioinform. 22(6) (2021) - [j18]Weibing Wang, Lin Gao
CCIP: predicting CTCF-mediated chromatin loops with transitivity. Bioinform. 37(24): 4635-4642 (2021) - [j17]Ran Duan
Evaluation and comparison of multi-omics data integration methods for cancer subtyping. PLoS Comput. Biol. 17(8) (2021)
2010 – 2019
- 2018
- [j16]Songwei Jia
Viewing the Meso-Scale Structures in Protein-Protein Interaction Networks Using 2-Clubs. IEEE Access 6: 36780-36797 (2018) - 2017
- [j15]Peng Zhang, Yong Gao:
A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming. Theor. Comput. Sci. 657: 98-110 (2017) - [c15]Congsong Zhang
On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs. COCOON 2017: 555-567 - [c14]Yong Gao:
A Random Model for Argumentation Framework: Phase Transitions, Empirical Hardness, and Heuristics. IJCAI 2017: 503-509 - 2016
- [i9]Songwei Jia, Lin Gao, Yong Gao, James Nastos, Xiao Wen, Xindong Zhang, Haiyang Wang:
Exploring triad-rich substructures by graph-theoretic characterizations in complex networks. CoRR abs/1602.05286 (2016) - 2015
- [c13]Peng Zhang, Yong Gao:
Super Solutions of Random Instances of Satisfiability. FAW 2015: 314-325 - 2013
- [j14]Yong Gao, Donovan R. Hare
The parametric complexity of graph diameter augmentation. Discret. Appl. Math. 161(10-11): 1626-1631 (2013) - [j13]Yong Gao, Donovan R. Hare
The cluster deletion problem for cographs. Discret. Math. 313(23): 2763-2771 (2013) - [j12]James Nastos
Familial groups in social networks. Soc. Networks 35(3): 439-450 (2013) - 2012
- [j11]Yong Gao:
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs. Discret. Appl. Math. 160(4-5): 566-578 (2012) - [j10]James Nastos, Yong Gao:
Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes. Discret. Math. Algorithms Appl. 4(1) (2012) - 2011
- [c12]Ajay Sridharan, Yong Gao, Kui Wu, James Nastos
Statistical behavior of embeddedness and communities of overlapping cliques in online social networks. INFOCOM 2011: 546-550 - [i8]Joseph C. Culberson, Yong Gao:
An Analysis of Phase Transition in NK Landscapes. CoRR abs/1106.4575 (2011) - [i7]Joseph C. Culberson, Yong Gao:
Consistency and Random Constraint Satisfaction Models. CoRR abs/1110.2204 (2011) - 2010
- [c11]James Nastos
A Novel Branching Strategy for Parameterized Graph Modification Problems. COCOA (2) 2010: 332-346 - [c10]Xi Zhang, Kui Wu, Yong Gao:
Algorithms for Answering Geo-Range Query. GLOBECOM 2010: 1-5 - [i6]James Nastos, Yong Gao:
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes. CoRR abs/1006.3020 (2010) - [i5]Ajay Sridharan, Yong Gao, Kui Wu, James Nastos:
Statistical Behavior of Embeddedness and Communities of Overlapping Cliques in Online Social Networks. CoRR abs/1009.1686 (2010)
2000 – 2009
- 2009
- [j9]Yong Gao:
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability. Artif. Intell. 173(14): 1343-1366 (2009) - [j8]Yong Gao:
Threshold dominating cliques in random graphs and interval routing. J. Discrete Algorithms 7(4): 519-532 (2009) - [j7]Yong Gao:
The degree distribution of random k-trees. Theor. Comput. Sci. 410(8-10): 688-695 (2009) - [i4]Yong Gao:
Treewidth of Erdös-Rényi Random Graphs, Random Intersection Graphs, and Scale-Free Random Graphs. CoRR abs/0907.5481 (2009) - [i3]James Nastos, Yong Gao:
A note on the hardness of graph diameter augmentation problems. CoRR abs/0909.3877 (2009) - 2008
- [c9]Yong Gao:
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems. AAAI 2008: 265-270 - [c8]Yong Gao:
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. SAT 2008: 91-104 - [i2]Yong Gao:
A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability. CoRR abs/0806.4652 (2008) - [i1]Yong Gao:
The Degree Distribution of Random k-Trees. CoRR abs/0808.0202 (2008) - 2007
- [j6]Yong Gao, Joseph C. Culberson:
Consistency and Random Constraint Satisfaction Models. J. Artif. Intell. Res. 28: 517-557 (2007) - [c7]Yong Gao, Michael Henderson:
Speeding Up Pairwise Sequence Alignments: A Scoring Scheme Reweighting Based Approach. BIBE 2007: 1194-1198 - 2006
- [c6]Yong Gao:
On the Threshold of Having a Linear Treewidth in Random Graphs. COCOON 2006: 226-234 - 2005
- [j5]Yong Gao, Joseph C. Culberson:
Resolution complexity of random constraint satisfaction problems: Another half of the story. Discret. Appl. Math. 153(1-3): 124-140 (2005) - [j4]Yong Gao, Joseph C. Culberson:
Space Complexity of Estimation of Distribution Algorithms. Evol. Comput. 13(1): 125-143 (2005) - [j3]Kui Wu, Yong Gao, Fulu Li, Yang Xiao
Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks. Mob. Networks Appl. 10(6): 837-852 (2005) - [c5]Joseph C. Culberson, Yong Gao, Calin Anton:
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. IJCAI 2005: 78-83 - 2004
- [c4]Yong Gao, Joseph C. Culberson:
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. CP 2004: 17-31 - 2003
- [j2]Yong Gao, Joseph C. Culberson:
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story. Electron. Notes Discret. Math. 16: 15-20 (2003) - [c3]Yong Gao, Joseph C. Culberson:
On the Treewidth of NK Landscapes. GECCO 2003: 948-954 - [c2]Yong Gao:
Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference. UAI 2003: 265-271 - [c1]Yong Gao, Kui Wu, Fulu Li:
Analysis on the redundancy of wireless sensor networks. WSNA 2003: 108-114 - 2002
- [j1]Yong Gao, Joseph C. Culberson:
An Analysis of Phase Transition in NK Landscapes. J. Artif. Intell. Res. 17: 309-332 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: