Guiying Yan

Orcid: 0000-0002-1736-5482

According to our database1, Guiying Yan authored at least 74 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Anti-Ramsey number of disjoint union of star-like hypergraphs.
Discret. Math., April, 2024

Weak-Dynamic Coloring of Graphs Beyond-Planarity.
Graphs Comb., February, 2024

2023
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs.
Discret. Math., September, 2023

Quasi <sub>rmps</sub>-Pancyclicity of Regular Multipartite Tournament.
Graphs Comb., August, 2023

Hypergraph incidence coloring.
Discret. Math., May, 2023

On the Weight Distribution of Weights Less than 2w<sub>min</sub> in Polar Codes.
CoRR, 2023

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

An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes.
CoRR, 2023

Improved Finite-Length Bound of Gaussian Unsourced Multiple Access.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2023

On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
A New Estimation Method for the Biological Interaction Predicting Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs.
J. Graph Theory, 2022

Deterministic Identification over Channels without CSI.
Proceedings of the IEEE Information Theory Workshop, 2022

The Complete SC-Invariant Affine Automorphisms of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders.
Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021
Information spreading with relative attributes on signed networks.
Inf. Sci., 2021

Predicting Brain Regions Related to Alzheimer's Disease Based on Global Feature.
Frontiers Comput. Neurosci., 2021

Improving the Gilbert-Varshamov Bound by Graph Spectral Method.
CoRR, 2021

Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum.
Proceedings of the 32nd IEEE Annual International Symposium on Personal, 2021

On the Weight Spectrum of Pre-Transformed Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

The Complete Affine Automorphism Group of Polar Codes.
Proceedings of the IEEE Global Communications Conference, 2021

2020
GSSNN: Graph Smoothing Splines Neural Networks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2018
2-Arc-Transitive Regular Covers of K n, n Having the Covering Transformation Group ℤ p 2.
Comb., 2018

A novel approach based on KATZ measure to predict associations of human microbiota with non-infectious diseases.
Bioinform., 2018

2017
PBMDA: A novel and effective path-based computational model for miRNA-disease association prediction.
PLoS Comput. Biol., 2017

Improved upper bound for the degenerate and star chromatic numbers of graphs.
J. Comb. Optim., 2017

HAMDA: Hybrid Approach for MiRNA-Disease Association prediction.
J. Biomed. Informatics, 2017

On bisections of directed graphs.
Eur. J. Comb., 2017

An approximate ore-type result for tight Hamilton cycles in uniform hypergraphs.
Discret. Math., 2017

Graphs of f-class 1.
Discret. Appl. Math., 2017

NRDTD: a database for clinically or experimentally supported non-coding RNAs and drug targets associations.
Database J. Biol. Databases Curation, 2017

The classification of f-coloring of graphs with large maximum degree.
Appl. Math. Comput., 2017

m-dominating k-ended trees of l-connected graphs.
AKCE Int. J. Graphs Comb., 2017

2016
Algorithm on rainbow connection for maximal outerplanar graphs.
Theor. Comput. Sci., 2016

NLLSS: Predicting Synergistic Drug Combinations Based on Semi-supervised Learning.
PLoS Comput. Biol., 2016

On judicious partitions of uniform hypergraphs.
J. Comb. Theory, Ser. A, 2016

Neighbor sum distinguishing total choosability of planar graphs.
J. Comb. Optim., 2016

Acyclic coloring of graphs with some girth restriction.
J. Comb. Optim., 2016

Neighbor Sum Distinguishing Index of K<sub>4</sub>-Minor Free Graphs.
Graphs Comb., 2016

Existence of rainbow matchings in strongly edge-colored graphs.
Discret. Math., 2016

m-dominating k-trees of graphs.
Discret. Math., 2016

Improved protein-protein interactions prediction via weighted sparse representation model combining continuous wavelet descriptor and PseAA composition.
BMC Syst. Biol., 2016

2015
The r-acyclic chromatic number of planar graphs.
J. Comb. Optim., 2015

An Improved Upper Bound on Edge Weight Choosability of Graphs.
Graphs Comb., 2015

On judicious partitions of hypergraphs with edges of size at most 3.
Eur. J. Comb., 2015

Orthogonal matchings revisited.
Discret. Math., 2015

2014
m-dominating k-ended trees of graphs.
Discret. Math., 2014

An improved upper bound for the neighbor sum distinguishing index of graphs.
Discret. Appl. Math., 2014

2013
LncRNADisease: a database for long-non-coding RNA-associated diseases.
Nucleic Acids Res., 2013

Minimum degree, edge-connectivity and radius.
J. Comb. Optim., 2013

A Note on Semi-coloring of Graphs.
Graphs Comb., 2013

Spanning <i>k</i>-ended trees of bipartite graphs.
Discret. Math., 2013

Novel human lncRNA-disease association inference based on lncRNA expression profiles.
Bioinform., 2013

2011
On the Sum of Independence Number and Average Degree of a Graph.
Discret. Math. Algorithms Appl., 2011

A Conjecture on Average Distance and Diameter of a Graph.
Discret. Math. Algorithms Appl., 2011

2010
Linear time construction of 5-phylogenetic roots for tree chordal graphs.
J. Comb. Optim., 2010

2008
Induced Subgraph in Random Regular Graph.
J. Syst. Sci. Complex., 2008

A full-scale solution to the rectilinear obstacle-avoiding Steiner problem.
Integr., 2008

Factor-Critical Graphs with Given Number of Maximum Matchings.
Graphs Comb., 2008

Detecting Community Structure by Network Vectorization.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

2006
Strictly chordal graphs are leaf powers.
J. Discrete Algorithms, 2006

ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.
J. Comput. Sci. Technol., 2006

An <i>O</i>(<i>n</i>log<i>n</i>) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane.
Proceedings of the 2006 International Symposium on Physical Design, 2006

DraXRouter: global routing in X-Architecture with dynamic resource assignment.
Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

2005
A Routing Paradigm with Novel Resources Estimation and Routability Models for X-Architecture Based Physical Design.
Proceedings of the Embedded Computer Systems: Architectures, 2005

The polygonal contraction heuristic for rectilinear Steiner tree construction.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

An-OARSMan: obstacle-avoiding routing tree construction with good length performance.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Via-Aware Global Routing for Good VLSI Manufacturability and High Yield.
Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

2004
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design.
Proceedings of the Integrated Circuit and System Design, 2004

2001
Linear Vertex Arboricity, Independence Number and Clique Cover Number.
Ars Comb., 2001

2000
Decomposition of Graphs into (g, f)-Factors.
Graphs Comb., 2000

1999
A New Result on Alspach's Problem.
Graphs Comb., 1999

1998
On the optimal four-way switch box routing structures of FPGA greedy routing architectures1.
Integr., 1998


  Loading...