Guanghui Wang

CoRR, May, 2025

The Impact of the Distance Between Cycles on Elementary Trapping Sets.

[BibT_eX]

[DOI]

CoRR, March, 2025

Atten-Transformer: A Deep Learning Framework for User App Usage Prediction.

[BibT_eX]

[DOI]

Longlong Li

Cunquan Qu

CoRR, February, 2025

Transversal Hamilton Cycle in Hypergraph Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

2024

An Optimization Model for Offline Scheduling Policy of Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., August, 2024

A Ramsey-Turán theory for tilings in graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, January, 2024

H-factors in graphs with small independence number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Large Y3,2-tilings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Jie Han

Lin Sun

Eur. J. Comb., 2024

Spanning trees in graphs without large bipartite holes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

On the lifting degree of girth-8 QC-LDPC codes.

[BibT_eX]

[DOI]

CoRR, 2024

KA-GNN: Kolmogorov-Arnold Graph Neural Networks for Molecular Property Prediction.

[BibT_eX]

[DOI]

CoRR, 2024

Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder.

[BibT_eX]

[DOI]

CoRR, 2024

On the Performance of Low-complexity Decoders of LDPC and Polar Codes.

[BibT_eX]

[DOI]

CoRR, 2024

A novel graph neural network method for Alzheimer's disease classification.

[BibT_eX]

[DOI]

Comput. Biol. Medicine, 2024

Theoretical Bounds for the Size of Elementary Trapping Sets by Graph Theory Methods.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2024

Analysis of Efficient Scheduling in Layered Decoding of LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom Workshops 2024, 2024

2023

Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Balanced Subdivisions of Cliques in Graphs.

[BibT_eX]

[DOI]

Comb., October, 2023

Embedding clique-factors in graphs with low ℓ-independence number.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Multiscale Topological Indices for the Quantitative Prediction of SARS CoV-2 Binding Affinity Change upon Mutations.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., July, 2023

Toward maintenance of hypercores in large-scale dynamic hypergraphs.

[BibT_eX]

[DOI]

VLDB J., May, 2023

Tiling multipartite hypergraphs in quasi-random hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, May, 2023

Integer colorings with forbidden rainbow sums.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

Shape of the asymptotic maximum sum-free sets in integer lattice grids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Clique-factors in graphs with sublinear ?-independence number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2023

Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Crux and Long Cycles in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

Matching of Given Sizes in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Efficient Algorithm Based on Non-Backtracking Matrix for Community Detection in Signed Networks.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2022

Clique immersion in graphs without a fixed bipartite graph.

[BibT_eX]

[DOI]

Hong Liu

Donglei Yang

J. Comb. Theory B, 2022

Stable structural clustering in uncertain graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Integer colorings with no rainbow k-term arithmetic progression.

[BibT_eX]

[DOI]

Wenling Zhou

Eur. J. Comb., 2022

Properly colored short cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021

Information spreading with relative attributes on signed networks.

[BibT_eX]

[DOI]

Inf. Sci., 2021

Rainbow Pancyclicity in Graph Systems.

[BibT_eX]

[DOI]

Yangyang Cheng

Yi Zhao

Electron. J. Comb., 2021

Non-linear Hamilton cycles in linear quasi-random hypergraphs.

[BibT_eX]

[DOI]

Jie Han

Xichao Shu

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE Annual International Symposium on Personal, 2021

The K-Core Decomposition Algorithm Under the Framework of GraphBLAS.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

2020

Local antimagic orientation of graphs.

[BibT_eX]

[DOI]

Yulin Chang

Fei Jing

J. Comb. Optim., 2020

The evolution of structural balance in time-varying signed networks.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2020

Properly colored spanning trees in edge-colored graphs.

[BibT_eX]

[DOI]

Yangyang Cheng

Mikio Kano

Discret. Math., 2020

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8.

[BibT_eX]

[DOI]

Discret. Math., 2020

Temporal Gravity Model for Important Nodes Identification in Temporal Networks.

[BibT_eX]

[DOI]

CoRR, 2020

Non-backtracking Operator for Community Detection in Signed Networks.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Integrating random walk and binary regression to identify novel miRNA-disease association.

[BibT_eX]

[DOI]

BMC Bioinform., December, 2019

Antimagic orientations of even regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10.

[BibT_eX]

[DOI]

Yulin Chang

Qiancheng Ouyang

J. Comb. Optim., 2019

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.

[BibT_eX]

[DOI]

Discret. Math., 2019

Graphs are (1, Δ+1)-choosable.

[BibT_eX]

[DOI]

Discret. Math., 2019

Rainbow Hamiltonian cycles in strongly edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

Local antimagic orientations of d-degenerate graphs.

[BibT_eX]

[DOI]

Jie Hu

Qiancheng Ouyang

Discret. Appl. Math., 2019

Decomposing edge-coloured graphs under colour degree constraints.

[BibT_eX]

[DOI]

Shinya Fujita

Ruonan Li

Comb. Probab. Comput., 2019

Rainbow Matchings in Properly-Colored Hypergraphs.

[BibT_eX]

[DOI]

Hao Huang

Tong Li

Electron. J. Comb., 2019

2018

Generalized acyclic edge colorings via entropy compression.

[BibT_eX]

[DOI]

Laihao Ding

Jianliang Wu

J. Comb. Optim., 2018

Multipolarization versus unification in community networks.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

On splitting digraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Strong list-chromatic index of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

A note on rainbow matchings in strongly edge-colored graphs.

[BibT_eX]

[DOI]

Yangyang Cheng

Ta Sheng Tan

Nicolás Sanhueza-Matamala

Discret. Math., 2018

Density of Monochromatic Infinite Paths.

[BibT_eX]

[DOI]

Allan Lo

Electron. J. Comb., 2018

Local antimagic labeling of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

Social media as sensor in real world: movement trajectory detection with microblog.

[BibT_eX]

[DOI]

Soft Comput., 2017

Neighbor sum distinguishing total coloring of 2-degenerate graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Neighbor product distinguishing total colorings.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.

[BibT_eX]

[DOI]

Xiaohan Cheng

Jianliang Wu

J. Comb. Optim., 2017

Equitable vertex arboricity of 5-degenerate graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

HAMDA: Hybrid Approach for MiRNA-Disease Association prediction.

[BibT_eX]

[DOI]

J. Biomed. Informatics, 2017

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Decomposing edge-colored graphs under color degree constraints.

[BibT_eX]

[DOI]

Shinya Fujita

Ruonan Li

Electron. Notes Discret. Math., 2017

2016

On the neighbor sum distinguishing total coloring of planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Neighbor sum distinguishing total choosability of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Neighbor Sum Distinguishing Index of K4-Minor Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

A Relaxed Case on 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Yuping Gao

Jian-Liang Wu

Graphs Comb., 2016

Adjacent vertex distinguishing colorings by sum of sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Existence of rainbow matchings in strongly edge-colored graphs.

[BibT_eX]

[DOI]

Xiaowei Yu

Discret. Math., 2016

2015

The r-acyclic chromatic number of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Neighbor sum distinguishing total colorings of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

An Improved Upper Bound on Edge Weight Choosability of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Orthogonal matchings revisited.

[BibT_eX]

[DOI]

Cunquan Qu

Discret. Math., 2015

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

Domatic partition in homogeneous wireless sensor networks.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2014

The Linear t-Colorings of Sierpiński-Like Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Fractional f-Edge Cover Chromatic Index of Graphs.

[BibT_eX]

[DOI]

Jinbo Li

Graphs Comb., 2014

A note on Edge Weight choosability of graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

Long properly colored cycles in edge colored complete graphs.

[BibT_eX]

[DOI]

Tao Wang

Discret. Math., 2014

Neighbor sum distinguishing index of planar graphs.

[BibT_eX]

[DOI]

Zhumin Chen

Jihui Wang

Discret. Math., 2014

Shortest paths in Sierpiński graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

An improved upper bound for the neighbor sum distinguishing index of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

ECDC: An energy and coverage-aware distributed clustering protocol for wireless sensor networks.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2014

2013

A note on Rainbow Matchings.

[BibT_eX]

[DOI]

Bingqiang Liu

Discret. Math. Algorithms Appl., 2013

Equitable and list equitable colorings of planar graphs without 4-cycles.

[BibT_eX]

[DOI]

Aijun Dong

Guojun Li

Discret. Math., 2013

Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey.

[BibT_eX]

[DOI]

Comput. Commun., 2013

2012

Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks.

[BibT_eX]

[DOI]

Nannan Wang

J. Parallel Distributed Comput., 2012

A Stochastic k-Coverage Scheduling Algorithm in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2012

Clustering-Based Energy-Efficient Broadcast Tree in Wireless Networks.

[BibT_eX]

[DOI]

Int. J. Comput. Commun. Control, 2012

A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Circular Coloring of Planar Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Color degree and heterochromatic cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Neighbor Sum Distinguishing Coloring of some Graphs.

[BibT_eX]

[DOI]

Aijun Dong

Discret. Math. Algorithms Appl., 2012

On r-acyclic edge colorings of planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Circular vertex arboricity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Improved bounds for acyclic chromatic index of planar graphs.

[BibT_eX]

[DOI]

Jianfeng Hou

Discret. Appl. Math., 2011

(2,1)-Total labeling of planar graphs with large maximum degree

[BibT_eX]

[DOI]

CoRR, 2011

Rainbow Matchings in Properly Edge Colored Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Algorithm for two disjoint long paths in 2-connected graphs.

[BibT_eX]

[DOI]

Shan Zhou

Theor. Comput. Sci., 2010

The k-dominating cycles in graphs.

[BibT_eX]

[DOI]

Shan Zhou

Eur. J. Comb., 2010

Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks.

[BibT_eX]

[DOI]

Nannan Wang

Proceedings of the Wireless Algorithms, 2010

2009

Paths, cycles and circular colorings in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Color degree and alternating cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

The heterochromatic matchings in edge-colored bipartite graphs.

[BibT_eX]

Ars Comb., 2009

An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings.

[BibT_eX]

[DOI]

Suxia Cui

Proceedings of the Combinatorial Optimization and Applications, 2009

Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.

[BibT_eX]

[DOI]

Suxia Cui

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Heterochromatic Matchings in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

A Note on k -walks in Bridgeless Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Long Alternating Cycles in Edge-Colored Complete Graphs.

[BibT_eX]

[DOI]