| A New Estimation Method for the Biological Interaction Predicting Problems | 0 | 0.34 | 2022 |
| Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum | 0 | 0.34 | 2021 |
| 2-Arc-Transitive Regular Covers of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">n</Emphasis></Subscript> Having the Covering Transformation Group ℤ<Stack><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript><Superscript>2</Superscript></Stack> | 0 | 0.34 | 2018 |
| NRDTD: a database for clinically or experimentally supported non-coding RNAs and drug targets associations. | 5 | 0.44 | 2017 |
| An approximate ore-type result for tight Hamilton cycles in uniform hypergraphs. | 0 | 0.34 | 2017 |
| On bisections of directed graphs. | 1 | 0.36 | 2017 |
| m-dominating k-ended trees of l-connected graphs | 0 | 0.34 | 2017 |
| Graphs of f-class 1. | 0 | 0.34 | 2017 |
| Improved upper bound for the degenerate and star chromatic numbers of graphs. | 1 | 0.36 | 2017 |
| The classification of f-coloring of graphs with large maximum degree. | 0 | 0.34 | 2017 |
| Algorithm on rainbow connection for maximal outerplanar graphs. | 0 | 0.34 | 2016 |
| Acyclic coloring of graphs with some girth restriction | 0 | 0.34 | 2016 |
| Existence of rainbow matchings in strongly edge-colored graphs. | 3 | 0.45 | 2016 |
| m-dominating k-trees of graphs | 0 | 0.34 | 2016 |
| Neighbor Sum Distinguishing Index of K4-Minor Free Graphs. | 0 | 0.34 | 2016 |
| Nllss: Predicting Synergistic Drug Combinations Based On Semi-Supervised Learning | 7 | 0.48 | 2016 |
| On judicious partitions of uniform hypergraphs. | 5 | 0.45 | 2016 |
| Improved protein-protein interactions prediction via weighted sparse representation model combining continuous wavelet descriptor and PseAA composition. | 1 | 0.34 | 2016 |
| Neighbor sum distinguishing total choosability of planar graphs | 9 | 0.62 | 2016 |
| An Improved Upper Bound on Edge Weight Choosability of Graphs. | 0 | 0.34 | 2015 |
| Orthogonal matchings revisited | 0 | 0.34 | 2015 |
| m-dominating k-ended trees of graphs | 1 | 0.40 | 2014 |
| LncRNADisease: a database for long-non-coding RNA-associated diseases. | 36 | 2.09 | 2013 |
| Novel human lncRNA-disease association inference based on lncRNA expression profiles. | 40 | 1.78 | 2013 |
| Spanning k-ended trees of bipartite graphs. | 0 | 0.34 | 2013 |
| Minimum degree, edge-connectivity and radius | 2 | 0.39 | 2013 |
| A Note on Semi-coloring of Graphs | 1 | 0.44 | 2013 |
| On The Sum Of Independence Number And Average Degree Of A Graph | 0 | 0.34 | 2011 |
| A Conjecture On Average Distance And Diameter Of A Graph | 1 | 0.37 | 2011 |
| Linear time construction of 5-phylogenetic roots for tree chordal graphs | 1 | 0.35 | 2010 |
| A full-scale solution to the rectilinear obstacle-avoiding Steiner problem | 4 | 0.44 | 2008 |
| Factor-Critical Graphs with Given Number of Maximum Matchings | 1 | 0.38 | 2008 |
| Induced Subgraph in Random Regular Graph | 0 | 0.34 | 2008 |
| Detecting Community Structure by Network Vectorization | 1 | 0.37 | 2008 |
| lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity | 0 | 0.34 | 2007 |
| An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane | 1 | 0.36 | 2006 |
| DraXRouter: global routing in X-architecture with dynamic resource assignment | 8 | 0.49 | 2006 |
| Strictly chordal graphs are leaf powers | 21 | 1.18 | 2006 |
| ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm | 6 | 0.52 | 2006 |
| An-OARSMan: obstacle-avoiding routing tree construction with good length performance | 19 | 1.22 | 2005 |
| A routing paradigm with novel resources estimation and routability models for x-architecture based physical design | 4 | 0.42 | 2005 |
| Via-aware global routing for good VLSI manufacturability and high yield | 4 | 0.41 | 2005 |
| The polygonal contraction heuristic for rectilinear Steiner tree construction | 1 | 0.38 | 2005 |
| Linear Vertex Arboricity, Independence Number and Clique Cover Number | 1 | 0.40 | 2001 |
| A New Result on Alspach's Problem | 1 | 0.37 | 1999 |
| On the optimal four-way switch box routing structures of FPGA greedy routing architectures | 10 | 0.90 | 1998 |
