Guanghui Wang
Orcid: 0000-0002-3730-5575Affiliations:
- Shandong University, Jinan, China
According to our database1,
Guanghui Wang
authored at least 103 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Random Struct. Algorithms, January, 2024
Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder.
CoRR, 2024
2023
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs.
J. Graph Theory, November, 2023
J. Comb. Theory, Ser. B, July, 2023
Multiscale Topological Indices for the Quantitative Prediction of SARS CoV-2 Binding Affinity Change upon Mutations.
J. Chem. Inf. Model., July, 2023
VLDB J., May, 2023
J. Comb. Theory, Ser. B, May, 2023
Eur. J. Comb., 2023
CoRR, 2023
An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes.
CoRR, 2023
2022
Efficient Algorithm Based on Non-Backtracking Matrix for Community Detection in Signed Networks.
IEEE Trans. Netw. Sci. Eng., 2022
J. Comb. Theory, Ser. B, 2022
Proceedings of the IEEE Globecom 2022 Workshops, 2022
2021
Proceedings of the 32nd IEEE Annual International Symposium on Personal, 2021
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021
2020
Future Gener. Comput. Syst., 2020
Discret. Math., 2020
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8.
Discret. Math., 2020
CoRR, 2020
2019
Integrating random walk and binary regression to identify novel miRNA-disease association.
BMC Bioinform., December, 2019
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10.
J. Comb. Optim., 2019
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.
Discret. Math., 2019
Comb. Probab. Comput., 2019
2018
Future Gener. Comput. Syst., 2018
2017
Soft Comput., 2017
J. Comb. Optim., 2017
J. Comb. Optim., 2017
J. Biomed. Informatics, 2017
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.
Graphs Comb., 2017
Electron. Notes Discret. Math., 2017
2016
Theor. Comput. Sci., 2016
J. Comb. Optim., 2016
Graphs Comb., 2016
Graphs Comb., 2016
Discret. Math., 2016
2015
Discret. Appl. Math., 2015
2014
J. Netw. Comput. Appl., 2014
Discret. Appl. Math., 2014
ECDC: An energy and coverage-aware distributed clustering protocol for wireless sensor networks.
Comput. Electr. Eng., 2014
2013
Discret. Math., 2013
Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey.
Comput. Commun., 2013
2012
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks.
J. Parallel Distributed Comput., 2012
Int. J. Distributed Sens. Networks, 2012
Int. J. Comput. Commun. Control, 2012
Graphs Comb., 2012
Discret. Math. Algorithms Appl., 2012
2011
Discret. Appl. Math., 2011
2010
Theor. Comput. Sci., 2010
Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks.
Proceedings of the Wireless Algorithms, 2010
2009
The heterochromatic matchings in edge-colored bipartite graphs.
Ars Comb., 2009
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings.
Proceedings of the Combinatorial Optimization and Applications, 2009
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
2007
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007