Improved protein-protein interactions prediction via weighted sparse representation model combining continuous wavelet descriptor and PseAA composition.

[BibT_eX]

[DOI]

Yu-An Huang

Zhu-Hong You

Xing Chen

Guiying Yan

BMC Syst. Biol., 2016

2015

The r-acyclic chromatic number of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

An Improved Upper Bound on Edge Weight Choosability of Graphs.

[BibT_eX]

[DOI]

Guanghui Wang

Guiying Yan

Graphs Comb., 2015

On judicious partitions of hypergraphs with edges of size at most 3.

[BibT_eX]

[DOI]

Yao Zhang

Yucong Tang

Guiying Yan

Eur. J. Comb., 2015

Orthogonal matchings revisited.

[BibT_eX]

[DOI]

Cunquan Qu

Guanghui Wang

Guiying Yan

Discret. Math., 2015

2014

m-dominating k-ended trees of graphs.

[BibT_eX]

[DOI]

Mikio Kano

Masao Tsugaki

Guiying Yan

Discret. Math., 2014

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

[BibT_eX]

[DOI]

Guanghui Wang

Guiying Yan

Discret. Appl. Math., 2014

2013

LncRNADisease: a database for long-non-coding RNA-associated diseases.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2013

Minimum degree, edge-connectivity and radius.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

A Note on Semi-coloring of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Spanning k-ended trees of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

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

[BibT_eX]

[DOI]

Xing Chen

Guiying Yan

Bioinform., 2013

2011

On the Sum of Independence Number and Average Degree of a Graph.

[BibT_eX]

[DOI]

Xunuan Yang

Baoyindureng Wu

Guiying Yan

Discret. Math. Algorithms Appl., 2011

A Conjecture on Average Distance and Diameter of a Graph.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2011

2010

Linear time construction of 5-phylogenetic roots for tree chordal graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

2008

Induced Subgraph in Random Regular Graph.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2008

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

[BibT_eX]

[DOI]

Integr., 2008

Factor-Critical Graphs with Given Number of Maximum Matchings.

[BibT_eX]

[DOI]

Yan Liu

Guiying Yan

Graphs Comb., 2008

Detecting Community Structure by Network Vectorization.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

2006

Strictly chordal graphs are leaf powers.

[BibT_eX]

[DOI]

William S. Kennedy

Guohui Lin

Guiying Yan

J. Discrete Algorithms, 2006

ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2006

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Symposium on Physical Design, 2006

DraXRouter: global routing in X-Architecture with dynamic resource assignment.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Embedded Computer Systems: Architectures, 2005

The polygonal contraction heuristic for rectilinear Steiner tree construction.

[BibT_eX]

[DOI]

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

An-OARSMan: obstacle-avoiding routing tree construction with good length performance.

[BibT_eX]

[DOI]

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Via-Aware Global Routing for Good VLSI Manufacturability and High Yield.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

2004

An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design.

[BibT_eX]

[DOI]

Proceedings of the Integrated Circuit and System Design, 2004

2001

Linear Vertex Arboricity, Independence Number and Clique Cover Number.

[BibT_eX]

Ars Comb., 2001

2000

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

[BibT_eX]

[DOI]

Graphs Comb., 2000

1999

A New Result on Alspach's Problem.

[BibT_eX]

[DOI]

Guiying Yan

Graphs Comb., 1999

1998

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

[BibT_eX]

[DOI]

Integr., 1998

Guiying Yan

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...