# Yanpei Liu

According to our database

Collaborative distances:

^{1}, Yanpei Liu authored at least 84 papers between 1984 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Fast Power and Energy Management for Future Many-Core Systems.

TOMPECS, 2017

Resource scheduling approach for multimedia cloud content management.

The Journal of Supercomputing, 2017

Collaborative content dissemination based on game theory in multimedia cloud.

Knowl.-Based Syst., 2017

Energy-aware cross-layer resource allocation in mobile cloud.

Int. J. Communication Systems, 2017

QoS-based resource allocation across local and public cloud for resource-constrained mobile device.

Trans. Emerging Telecommunications Technologies, 2017

Multimedia cloud content distribution based on interest discovery and integrated utility of user.

Computers & Industrial Engineering, 2017

Delving into Transferable Adversarial Examples and Black-box Attacks.

Proceedings of the 5th International Conference on Learning Representations, 2017

2016

Efficient service selection approach for mobile devices in mobile cloud.

The Journal of Supercomputing, 2016

FastCap: An efficient and fair algorithm for power capping in many-core systems.

Proceedings of the 2016 IEEE International Symposium on Performance Analysis of Systems and Software, 2016

The Real-Time Scheduling Strategy Based on Traffic and Load Balancing in Storm.

Proceedings of the 18th IEEE International Conference on High Performance Computing and Communications; 14th IEEE International Conference on Smart City; 2nd IEEE International Conference on Data Science and Systems, 2016

Cooperative Content Dissemination Based on User Grouping in Multimedia Cloud.

Proceedings of the 18th IEEE International Conference on High Performance Computing and Communications; 14th IEEE International Conference on Smart City; 2nd IEEE International Conference on Data Science and Systems, 2016

2014

On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems.

IEEE Journal on Selected Areas in Communications, 2014

An Exponential Smoothing Adaptive Failure Detector in the Dual Model of Heartbeat and Interaction.

JCSE, 2014

Rooted General Maps on All Surfaces.

Ars Comb., 2014

SleepScale: Runtime joint speed scaling and sleep states management for power efficient data centers.

Proceedings of the ACM/IEEE 41st International Symposium on Computer Architecture, 2014

A virtual data center deployment model based on the green cloud computing.

Proceedings of the 2014 IEEE/ACIS 13th International Conference on Computer and Information Science, 2014

2013

On the Number of Genus Embeddings of Complete Bipartite Graphs.

Graphs and Combinatorics, 2013

On The Average Crosscap Number Of A Graph.

Ars Comb., 2013

2012

Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness.

IEEE Trans. Information Forensics and Security, 2012

Research on Component Retrieval Methods.

JSW, 2012

Grid Service Concurrency Control Protocol.

JNW, 2012

Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph.

Graphs and Combinatorics, 2012

On the number of genus embeddings of complete tripartite graph K

_{n, n, l}.
Ars Comb., 2012

Optimal scheduling policies with mutual information accumulation in wireless networks.

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Coding for fast content download.

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Exploiting multipath and Doppler array gains in fast-fading wireless channel.

IET Communications, 2011

Genus Distributions For Double Pearl-Ladder Graphs.

Ars Comb., 2011

Number of Embeddings of Wheel Graphs on Surfaces of Small Genus.

Ars Comb., 2011

Flexibility of Circular Graphs C(2n, 2) on the Projective Plane.

Ars Comb., 2011

Up-embeddability and independent number of simple graphs.

Ars Comb., 2011

A new bound on maximum genus of simple graphs.

Ars Comb., 2011

New Method for Intrusion Detection Based on BPNN and Improved GA Optimization.

Proceedings of the Information Computing and Applications, 2011

Secret key generation through OFDM multipath channel.

Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

Exploiting route diversity in multi-packet transmission using mutual information accumulation.

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Classification of (

*p,q,n*)-Dipoles on Nonorientable Surfaces.
Electr. J. Comb., 2010

Enumeration of Unicursal Planar Near-Triangulation.

Ars Comb., 2010

Orientable embedding distributions by genus for certain type of non-planar graphs (II).

Ars Comb., 2010

Genus polynomials for three types of graphs.

Ars Comb., 2010

Upper embeddable graphs via the degree-sum of adjacent vertices.

Ars Comb., 2010

Up-embeddable graphs via the degree-sum of nonadjacent vertices: non-simple graphs.

Ars Comb., 2010

A note on the neighbor condition for up-embeddability of graphs.

Ars Comb., 2010

Up-embeddability of graphs with small order.

Appl. Math. Lett., 2010

2009

A Genus Inequality Of The Union Graphs.

Ars Comb., 2009

On the embedding genus distribution of ladders and crosses.

Appl. Math. Lett., 2009

The genus distributions of 4-regular digraphs.

Australasian J. Combinatorics, 2009

2008

Orientable embedding genus distribution for certain types of graphs.

J. Comb. Theory, Ser. B, 2008

The genus distributions of directed antiladders in orientable surfaces.

Appl. Math. Lett., 2008

Genus distributions of orientable embeddings for two types of graphs.

Australasian J. Combinatorics, 2008

2007

On the Decomposition of Graphs into Complete Bipartite Graphs.

Graphs and Combinatorics, 2007

Up-Embeddability of a Graph by Order and Girth.

Graphs and Combinatorics, 2007

Chromatic sums of general maps on the sphere and the projective plane.

Discrete Mathematics, 2007

A census of boundary cubic rooted planar maps.

Discrete Applied Mathematics, 2007

Flexibility of Embeddings of Bouquets of Circles on the Projective Plane and Klein Bottle.

Electr. J. Comb., 2007

Counting pan-fan maps on nonorientable surfaces.

Ars Comb., 2007

2006

Strong Embedding of HP-Graphs on Surface with Higher Genus.

J. Systems Science & Complexity, 2006

The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration.

Graphs and Combinatorics, 2006

Orientable embedding distributions by genus for certain type of non-planar graphs (I).

Ars Comb., 2006

Maximum genus, Girth and Maximum non-adjacent edge set.

Ars Comb., 2006

2005

Chromatic sums of 2-edge-connected maps on the plane.

Discrete Mathematics, 2005

2004

Generating cycle spaces for graphs on surfaces with small genera.

Eur. J. Comb., 2004

Saturated systems of homogeneous boxes and the logical analysis of numerical data.

Discrete Applied Mathematics, 2004

Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS).

Discrete Applied Mathematics, 2004

A new approach for enumerating maps on orientable surfaces.

Australasian J. Combinatorics, 2004

2003

Determination of the star valency of a graph.

Discrete Applied Mathematics, 2003

2002

The Number of Loopless 4-Regular Maps on the Projective Plane.

J. Comb. Theory, Ser. B, 2002

Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane.

Eur. J. Comb., 2002

Enumeration on Nonseparable Planar Maps.

Eur. J. Comb., 2002

Enumeration of simple bipartite maps on the sphere and the projective plane.

Discrete Mathematics, 2002

2001

4-Regular Maps on the Klein Bottle.

J. Comb. Theory, Ser. B, 2001

Enumerating near-4-regular maps on the sphere and the torus.

Discrete Applied Mathematics, 2001

2000

Face Size and the Maximum Genus of a Graph 1. Simple Graphs.

J. Comb. Theory, Ser. B, 2000

Maximum Genus, Girth and Connectivity.

Eur. J. Comb., 2000

Bisingular maps on the sphere and the projective plane.

Discrete Mathematics, 2000

1999

Orthogonal drawings of graphs for the automation of VLSI circuit design.

J. Comput. Sci. Technol., 1999

The maximum genus of graphs with diameter three.

Discrete Mathematics, 1999

The enumeration of rooted nonseparable nearly cubic maps.

Discrete Mathematics, 1999

1998

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.

Discrete Applied Mathematics, 1998

1997

Maximum genus and maximum nonseparating independent set of a 3-regular graph.

Discrete Mathematics, 1997

Generalized Bicycles.

Discrete Applied Mathematics, 1997

1995

On the chromatic uniqueness of the graph W(n, n-2) + K

_{k}.
Discrete Mathematics, 1995

1993

On functional equations arising from map enumerations.

Discrete Mathematics, 1993

Counting rooted near-triangulations on the sphere.

Discrete Mathematics, 1993

1990

On chromatic and dichromatic sum equations.

Discrete Mathematics, 1990

1984

On the number of rooted

*c*-nets.
J. Comb. Theory, Ser. B, 1984