Suogang Gao
According to our database1,
Suogang Gao
authored at least 47 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Math., March, 2024
2023
J. Comb. Optim., May, 2023
2022
An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties.
Comput. Appl. Math., September, 2022
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties.
J. Comb. Optim., 2022
Graphs Comb., 2022
The Terwilliger algebra of the halved n-cube from the viewpoint of its automorphism group action.
Eur. J. Comb., 2022
Proceedings of the Algorithmic Aspects in Information and Management, 2022
2021
Approximation algorithms for the submodular edge cover problem with submodular penalties.
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
An approximation algorithm for the submodular multicut problem in trees with linear penalties.
Optim. Lett., 2021
Optim. Lett., 2021
J. Comb. Optim., 2021
2020
J. Comb. Optim., 2020
J. Comb. Optim., 2020
2019
Appl. Soft Comput., 2019
2016
Group Testing with Multiple Inhibitor Sets and Error-Tolerant and Its Decoding Algorithms.
J. Comput. Biol., 2016
2015
Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.
Ars Comb., 2015
2013
Discret. Math., 2013
2012
Nonadaptive Algorithms for Threshold Group Testing with Inhibitors and Error-Tolerance.
J. Comput. Biol., 2012
2011
Commutative weakly distance-regular digraphs of circle with fixed length.
Ars Comb., 2011
Eigenpolynomials associated with subspaces in d-bounded distance-regular graphs.
Ars Comb., 2011
A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs.
Ars Comb., 2011
2010
Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2.
J. Comb. Optim., 2010
J. Comb. Optim., 2010
Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field.
J. Comput. Biol., 2010
Int. J. Bioinform. Res. Appl., 2010
2009
Two new error-correcting pooling designs from <i>d</i> -bounded distance-regular graphs.
J. Comb. Optim., 2009
Finite Fields Their Appl., 2009
Finite Fields Their Appl., 2009
A Construction of Cartesian Authentication Code from Orthogonal Spaces over a Finite Field of odd Characteristic.
Discret. Math. Algorithms Appl., 2009
Error-Tolerant Trivial Two-Stage Group Testing for complexes Using Almost Separable and Almost Disjunct Matrices.
Discret. Math. Algorithms Appl., 2009
Some Properties of Macula's matrix and its complement.
Ars Comb., 2009
2008
Eur. J. Comb., 2008
Discret. Math., 2008
Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs.
Discret. Math., 2008
2007
Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs.
Eur. J. Comb., 2007
2001
Discret. Math., 2001