default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuogang Gao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j49]Lihang Hou, Suogang Gao, Na Kang, Bo Hou:
The Terwilliger algebras of Odd graphs and Doubled Odd graphs. Discret. Math. 348(1): 114216 (2025)- 2024
- [j48]Yi Tian, Cong Lin, Bo Hou, Lihang Hou, Suogang Gao:
Further study of distance-regular graphs with classical parameters with b . Discret. Math. 347(3): 113817 (2024) - [j47]Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu, Wen Liu
:
W-prize-collecting scheduling problem on parallel machines. J. Comb. Optim. 48(3): 26 (2024) - [j46]Bo Hou, Hongye Zheng, Wen Liu, Weili Wu, Ding-Zhu Du, Suogang Gao:
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. Optim. Lett. 18(7): 1747-1754 (2024) - 2023
- [j45]Yi Tian, Na Kang, Weili Wu, Ding-Zhu Du, Suogang Gao:
Distance magic labeling of the halved folded n-cube. J. Comb. Optim. 45(2): 75 (2023) - [j44]Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu:
An approximation algorithm for the clustered path travelling salesman problem. J. Comb. Optim. 45(4): 104 (2023) - 2022
- [j43]Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu:
An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties. Comput. Appl. Math. 41(6) (2022) - [j42]Lihang Hou, Bo Hou, Na Kang, Suogang Gao:
The Terwilliger algebra of the halved n-cube from the viewpoint of its automorphism group action. Eur. J. Comb. 101: 103480 (2022) - [j41]Jing Li, Yan Wang, Bo Hou, Weidong Gao, Suogang Gao:
Non-Bipartite Distance-Regular Graphs with Diameters 5, 6 and a Smallest Eigenvalue. Graphs Comb. 38(3): 55 (2022) - [j40]Hongye Zheng, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. J. Comb. Optim. 44(1): 343-353 (2022) - [c5]Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu:
An Approximation Algorithm for the Clustered Path Travelling Salesman Problem. AAIM 2022: 15-27 - [c4]Bo Hou, Zhenzhen Pang, Suogang Gao, Wen Liu:
Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP. AAIM 2022: 28-32 - [c3]Yi Tian, Na Kang, Weili Wu, Ding-Zhu Du, Suogang Gao:
Distance Magic Labeling of the Halved Folded n-Cube. AAIM 2022: 327-338 - 2021
- [j39]Yi Tian, Lihang Hou, Bo Hou, Suogang Gao:
D-magic labelings of the folded n-cube. Discret. Math. 344(9): 112520 (2021) - [j38]Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu, Suogang Gao:
A greedy algorithm for the fault-tolerant outer-connected dominating set problem. J. Comb. Optim. 41(1): 118-127 (2021) - [j37]Chenfei Hou, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
An approximation algorithm for the submodular multicut problem in trees with linear penalties. Optim. Lett. 15(4): 1105-1112 (2021) - [j36]Jiawen Gao, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
An approximation algorithm for the k-generalized Steiner forest problem. Optim. Lett. 15(4): 1475-1483 (2021) - [j35]Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On approximation algorithm for the edge metric dimension problem. Theor. Comput. Sci. 853: 2-6 (2021) - [j34]Xin Wang, Suogang Gao, Bo Hou, Lidong Wu, Wen Liu:
Approximation algorithms for the submodular edge cover problem with submodular penalties. Theor. Comput. Sci. 871: 126-133 (2021) - 2020
- [j33]Bo Hou, Yunjing Shan, Suogang Gao:
The Hilton-Milner theorem for attenuated spaces. Discret. Math. 343(12): 112120 (2020) - [j32]Yuezhong Zhang, Suogang Gao:
On the edge metric dimension of convex polytopes and its related graphs. J. Comb. Optim. 39(2): 334-350 (2020) - [j31]Shaojing Du, Suogang Gao, Bo Hou, Wen Liu:
An approximation algorithm for submodular hitting set problem with linear penalties. J. Comb. Optim. 40(4): 1065-1074 (2020) - [j30]Lihang Hou, Bo Hou, Suogang Gao, Wei-Hsuan Yu:
New code upper bounds for the folded n-cube. J. Comb. Theory A 172: 105182 (2020) - [j29]Yuezhong Zhang, Lihang Hou, Bo Hou, Weili Wu, Ding-Zhu Du, Suogang Gao:
On the metric dimension of the folded n-cube. Optim. Lett. 14(1): 249-257 (2020)
2010 – 2019
- 2019
- [j28]Yichao He, Xizhao Wang, Suogang Gao:
Ring Theory-Based Evolutionary Algorithm and its application to D{0-1} KP. Appl. Soft Comput. 77: 714-722 (2019) - [c2]Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On Approximation Algorithm for the Edge Metric Dimension Problem. AAIM 2019: 142-148 - 2016
- [j27]Shufang Zhao, Yichao He, Xinlu Zhang, Wen Xu, Weili Wu, Suogang Gao:
Group Testing with Multiple Inhibitor Sets and Error-Tolerant and Its Decoding Algorithms. J. Comput. Biol. 23(10): 821-829 (2016) - [j26]Yichao He, Xinlu Zhang, Wenbin Li, Xiang Li, Weili Wu, Suogang Gao:
Algorithms for randomized time-varying knapsack problems. J. Comb. Optim. 31(1): 95-117 (2016) - 2015
- [j25]Jizhu Nan, Jun Guo, Suogang Gao:
Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy. Ars Comb. 119: 33-45 (2015) - [j24]Hong Yue, Bo Hou, Suogang Gao:
Note on the tight relative 2-designs on H(n, 2). Discret. Math. 338(2): 196-208 (2015) - 2013
- [j23]Bo Hou, Panpan Shen, Ran Zhang, Suogang Gao:
On the non-existence of tight Gaussian 6-designs on two concentric spheres. Discret. Math. 313(9): 1002-1010 (2013) - 2012
- [j22]Yichao He, Haiyan Tian, Xinlu Zhang, Zhiwei Wang, Suogang Gao:
Nonadaptive Algorithms for Threshold Group Testing with Inhibitors and Error-Tolerance. J. Comput. Biol. 19(7): 903-910 (2012) - 2011
- [j21]Suogang Gao, Jun Guo:
A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs. Ars Comb. 98: 135-148 (2011) - [j20]Zengti Li, Suogang Gao, Haixia Guo:
Commutative weakly distance-regular digraphs of circle with fixed length. Ars Comb. 101: 301-307 (2011) - [j19]Jun Guo, Suogang Gao:
Eigenpolynomials associated with subspaces in d-bounded distance-regular graphs. Ars Comb. 102: 463-471 (2011) - [j18]Suogang Gao, Zengti Li, Hongjie Du, Yan Shi, Weili Wu:
Approaching pooling design with smaller efficient ratio. J. Glob. Optim. 49(1): 125-135 (2011) - [j17]Suogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, Weili Wu:
DNA library screening, pooling design and unitary spaces. Theor. Comput. Sci. 412(3): 217-224 (2011) - 2010
- [j16]Zengti Li, Suogang Gao, Hongjie Du, Yan Shi, Weili Wu:
New algebraic constructions for pooling design in DNA library screening. Int. J. Bioinform. Res. Appl. 6(3): 308-322 (2010) - [j15]Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu:
Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field. J. Comput. Biol. 17(10): 1413-1423 (2010) - [j14]Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu:
Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2. J. Comb. Optim. 20(4): 325-334 (2010) - [j13]Jun Guo, Yuexuan Wang, Suogang Gao, Jiangchen Yu, Weili Wu:
Constructing error-correcting pooling designs with symplectic space. J. Comb. Optim. 20(4): 413-421 (2010)
2000 – 2009
- 2009
- [j12]Wen Liu, Yafan Yue, Suogang Gao:
Some Properties of Macula's matrix and its complement. Ars Comb. 90 (2009) - [j11]Zengti Li, Suogang Gao, Zhong Wang, Bhavani Thuraisingham, Weili Wu:
A Construction of Cartesian Authentication Code from Orthogonal Spaces over a Finite Field of odd Characteristic. Discret. Math. Algorithms Appl. 1(1): 105-114 (2009) - [j10]Weiwei Lang, Yuexuan Wang, James Yu, Suogang Gao, Weili Wu:
Error-Tolerant Trivial Two-Stage Group Testing for complexes Using Almost Separable and Almost Disjunct Matrices. Discret. Math. Algorithms Appl. 1(2): 235-252 (2009) - [j9]Suogang Gao, Jun Guo:
The graphs induced by maximal totally isotropic flats of affine-unitary spaces. Finite Fields Their Appl. 15(2): 185-194 (2009) - [j8]Jun Guo, Suogang Gao:
A generalization of dual polar graph of orthogonal space. Finite Fields Their Appl. 15(6): 661-672 (2009) - [j7]Xinlu Zhang, Jun Guo, Suogang Gao:
Two new error-correcting pooling designs from d -bounded distance-regular graphs. J. Comb. Optim. 17(3): 339-345 (2009) - [j6]Feng Zou, Xianyue Li, Suogang Gao, Weili Wu:
Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18(4): 342-349 (2009) - [c1]Suogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, Weili Wu:
DNA Library Screening, Pooling Design and Unitary Spaces. COCOA 2009: 49-60 - 2008
- [j5]Jun Guo, Suogang Gao:
Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs. Discret. Math. 308(10): 1921-1929 (2008) - [j4]Jun Guo, Suogang Gao, Kaishun Wang:
Lattices generated by subspaces in d-bounded distance-regular graphs. Discret. Math. 308(22): 5260-5264 (2008) - [j3]Suogang Gao, Jun Guo, Baohuan Zhang, Lihui Fu:
Subspaces in d-bounded distance-regular graphs and their applications. Eur. J. Comb. 29(3): 592-600 (2008) - 2007
- [j2]Suogang Gao, Jun Guo, Wen Liu:
Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs. Eur. J. Comb. 28(6): 1800-1813 (2007) - 2001
- [j1]Suogang Gao, Hong You:
Vanishing conditions on parameters for P(Q)-polynomial association schemes. Discret. Math. 238(1-3): 53-60 (2001)
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-11-07 20:31 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:
