# Suogang Gao

According to our database

Collaborative distances:

^{1}, Suogang Gao authored at least 32 papers between 2001 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

On the metric dimension of the folded n-cube.

Optim. Lett., 2020

New code upper bounds for the folded

*n*-cube.
J. Comb. Theory, Ser. A, 2020

On the edge metric dimension of convex polytopes and its related graphs.

J. Comb. Optim., 2020

2019

Ring Theory-Based Evolutionary Algorithm and its application to D{0-1} KP.

Appl. Soft Comput., 2019

On Approximation Algorithm for the Edge Metric Dimension Problem.

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2016

Algorithms for randomized time-varying knapsack problems.

J. Comb. Optim., 2016

Group Testing with Multiple Inhibitor Sets and Error-Tolerant and Its Decoding Algorithms.

J. Comput. Biol., 2016

2015

Note on the tight relative 2-designs on H(n, 2).

Discret. Math., 2015

Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.

Ars Comb., 2015

2013

On the non-existence of tight Gaussian 6-designs on two concentric spheres.

Discret. Math., 2013

2012

Nonadaptive Algorithms for Threshold Group Testing with Inhibitors and Error-Tolerance.

J. Comput. Biol., 2012

2011

DNA library screening, pooling design and unitary spaces.

Theor. Comput. Sci., 2011

Approaching pooling design with smaller efficient ratio.

J. Global Optimization, 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

Constructing error-correcting pooling designs with symplectic space.

J. Comb. Optim., 2010

Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field.

J. Comput. Biol., 2010

New algebraic constructions for pooling design in DNA library screening.

IJBRA, 2010

2009

Node-weighted Steiner tree approximation in unit disk graphs.

J. Comb. Optim., 2009

Two new error-correcting pooling designs from

*d*-bounded distance-regular graphs.
J. Comb. Optim., 2009

A generalization of dual polar graph of orthogonal space.

Finite Fields Their Appl., 2009

The graphs induced by maximal totally isotropic flats of affine-unitary spaces.

Finite Fields Their Appl., 2009

A Construction of Cartesian Authentication Code from Orthogonal Spaces over a Finite Field of odd Characteristic.

Discrete Math., Alg. and Appl., 2009

Error-Tolerant Trivial Two-Stage Group Testing for complexes Using Almost Separable and Almost Disjunct Matrices.

Discrete Math., Alg. and Appl., 2009

Some Properties of Macula's matrix and its complement.

Ars Comb., 2009

2008

Subspaces in d-bounded distance-regular graphs and their applications.

Eur. J. Comb., 2008

Lattices generated by subspaces in d-bounded distance-regular graphs.

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

Vanishing conditions on parameters for P(Q)-polynomial association schemes.

Discret. Math., 2001