Yongtang Shi
Orcid: 0000-0001-9406-7967
According to our database1,
Yongtang Shi
authored at least 116 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Graphs Comb., April, 2024
Discret. Appl. Math., February, 2024
2023
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3.
Discret. Appl. Math., October, 2023
Discret. Math., May, 2023
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.
J. Comb. Optim., 2023
A sharp lower bound for the spectral radius in <i>K</i><sub>4</sub>-saturated graphs.
Discret. Math., 2023
2022
Theor. Comput. Sci., 2022
Optim. Methods Softw., 2022
J. Optim. Theory Appl., 2022
J. Graph Theory, 2022
Appl. Math. Comput., 2022
2021
Theor. Comput. Sci., 2021
J. Comb. Optim., 2021
Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree.
Graphs Comb., 2021
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings.
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
J. Graph Theory, 2020
Discret. Math., 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
A new coupled disease-awareness spreading model with mass media on multiplex networks.
Inf. Sci., 2019
Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach.
Inf. Sci., 2019
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth.
Discret. Math. Theor. Comput. Sci., 2019
An efficient polynomial time approximation scheme for the vertex cover <i>P<sub> </sub>3</i> problem on planar graphs.
Discuss. Math. Graph Theory, 2019
Discret. Math., 2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019
2018
Graph measures with high discrimination power revisited: A random polynomial approach.
Inf. Sci., 2018
Future Gener. Comput. Syst., 2018
Measurements and security of complex networks and systems: Research advances and challenges.
Future Gener. Comput. Syst., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Appl. Math. Comput., 2018
2017
J. Comb. Optim., 2017
Inf. Sci., 2017
Inf. Sci., 2017
Inf. Sci., 2017
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles.
Graphs Comb., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Inf. Sci., 2016
An improved algorithm for the vertex cover P<sub>3</sub> problem on graphs of bounded treewidth.
CoRR, 2016
A method for inferring inequalities for probability values applied to complex networks.
Complex., 2016
A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration.
Appl. Math. Comput., 2016
2015
Electron. J. Graph Theory Appl., 2015
Discret. Math. Algorithms Appl., 2015
Complex., 2015
Note on a Turan-type problem on distances.
Ars Comb., 2015
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs.
Appl. Math. Comput., 2015
Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial.
Appl. Math. Comput., 2015
Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix.
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
2014
The Wiener Polarity Index of Graph Products.
Ars Comb., 2014
Appl. Math. Comput., 2014
2013
2011
Theor. Comput. Sci., 2011
Eur. J. Comb., 2011
On the diameter and inverse degree.
Ars Comb., 2011
Australas. J Comb., 2011
2010
Discret. Math., 2010
2007
Discret. Appl. Math., 2007
Discret. Appl. Math., 2007