# Xiaofeng Guo

According to our database

Collaborative distances:

^{1}, Xiaofeng Guo authored at least 85 papers between 1986 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Graph-based trace analysis for microservice architecture understanding and problem diagnosis.

Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020

Proceedings of the 3rd IEEE International Conference on Soft Robotics, 2020

2019

基于日志可视化分析的微服务系统调试方法 (Method of Microservice System Debugging Based on Log Visualization Analysis).

计算机科学, 2019

Graphs Comb., 2019

Solving viscoelastic problems with cyclic symmetry via a temporally adaptive EFG-SB partitioning algorithm.

Eng. Comput., 2019

Concurr. Comput. Pract. Exp., 2019

The Fermat-Torricelli Problem of Triangles on the Sphere with Euclidean Metric: A Symbolic Solution with Maple.

Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

Deep Reinforcement Learning for Robotic Pushing and Picking in Cluttered Environment.

Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

Proceedings of the Intelligent Robotics and Applications - 12th International Conference, 2019

2018

DSCL Hand: A Novel Underactuated Robot Hand of Linearly Parallel Pinch and Self-adaptive Grasp with Double-Slider Co-circular Linkage Mechanisms.

Proceedings of the Intelligent Robotics and Applications - 11th International Conference, 2018

2016

On total domination number of Cartesian product of directed cycles.

Ars Comb., 2016

Local restricted edge connectivity and restricted edge connectivity of graphs.

Ars Comb., 2016

2015

Graphs Comb., 2015

Extending matchings in planar odd graphs.

Ars Comb., 2015

On cyclic edge connectivity of regular graphs with two orbits.

Ars Comb., 2015

Super connectivity of Kronecker products of some graphs.

Ars Comb., 2015

Super 3-restricted edge connectivity of triangle-free graphs.

Ars Comb., 2015

A new fast nonlinear principal component analysis algorithm for blind source separation.

Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015

2014

J. Supercomput., 2014

Graphs Comb., 2014

Discret. Math., 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.

Discret. Appl. Math., 2014

On cycle resonant outerplanar graphs.

Ars Comb., 2014

Restricted arc-connectivity of digraphs.

Ars Comb., 2014

2013

Meeting the "Digital Natives": Understanding the Acceptance of Technology in Classrooms.

J. Educ. Technol. Soc., 2013

Total chromatic number of folded hypercubes.

Ars Comb., 2013

Super connectivity and super arc connectivity of the Mycielskian of a digraph.

Ars Comb., 2013

Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs.

Appl. Math. Lett., 2013

2012

Graphs Comb., 2012

Discret. Appl. Math., 2012

Hosoya polynomials of the capped zig-zag nanotubes.

Ars Comb., 2012

Appl. Math. Lett., 2012

Appl. Math. Lett., 2012

Appl. Math. Lett., 2012

Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

2011

Inf. Sci., 2011

Discret. Math., 2011

Discret. Math., 2011

Strong Distances in Strong Oriented Complete k-Partite Graphs.

Ars Comb., 2011

The optimal strong radius and optimal strong diameter of the Cartesian product graphs.

Appl. Math. Lett., 2011

Appl. Math. Comput., 2011

2010

J. Syst. Sci. Complex., 2010

Inf. Process. Lett., 2010

Inf. Process. Lett., 2010

Discret. Math., 2010

Federated Content Rights Management for Research and Academic Publications Using the Handle System.

D Lib Mag., 2010

Contractible edges of k-connected graphs for k = 4, 5.

Ars Comb., 2010

On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition.

Ars Comb., 2010

Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs.

Ars Comb., 2010

2009

Inf. Process. Lett., 2009

Removable edges in a k-connected graph and a construction method for k-connected graphs.

Discret. Math., 2009

Discret. Appl. Math., 2009

A novel characterization of n-extendable bipartite graphs.

Ars Comb., 2009

Appl. Math. Lett., 2009

Lower and upper orientable strong diameters of graphs satisfying the Ore condition.

Appl. Math. Lett., 2009

2008

Int. J. Comput. Math., 2008

Removable edges in a 5-connected graph and a construction method of 5-connected graphs.

Discret. Math., 2008

2007

Proceedings of the 8th ACIS International Conference on Software Engineering, 2007

Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Proceedings of the 16th International Conference on Parallel Architectures and Compilation Techniques (PACT 2007), 2007

2006

Lower and upper orientable strong radius and strong diameter of complete k-partite graphs.

Discret. Appl. Math., 2006

2004

Discret. Math., 2004

Proceedings of the Parallel and Distributed Processing and Applications, 2004

2003

Discret. Appl. Math., 2003

2002

J. Chem. Inf. Comput. Sci., 2002

Discret. Appl. Math., 2002

2001

On the Characterization of DNA Primary Sequences by Triplet of Nucleic Acid Bases.

J. Chem. Inf. Comput. Sci., 2001

J. Chem. Inf. Comput. Sci., 2001

Pathway Analysis of Bacillus subtillis Metabolic Network Based on Genomic Information.

Proceedings of the Computer science and biology: Proceedings of the German Conference on Bioinformatics, 2001

1998

Proceedings of the Discrete Mathematical Chemistry, 1998

An efficient algorithm for determining fixed bonds and normal components in a bipartite graph.

Proceedings of the Discrete Mathematical Chemistry, 1998

1996

J. Chem. Inf. Comput. Sci., 1996

1995

J. Chem. Inf. Comput. Sci., 1995

1994

J. Chem. Inf. Comput. Sci., 1994

Recursive Method for Enumeration of Linearly Independent and Minimal Conjugated Circuits of Benzenoid Hydrocarbons.

J. Chem. Inf. Comput. Sci., 1994

Discret. Math., 1994

1993

J. Chem. Inf. Comput. Sci., 1993

J. Chem. Inf. Comput. Sci., 1993

1992

Enumeration and classification of benzenoid systems. 32. Normal perifusenes with two internal vertices.

J. Chem. Inf. Comput. Sci., 1992

Discret. Math., 1992

1991

Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs.

Discret. Appl. Math., 1991

1988

Discret. Math., 1988

1987

Discret. Math., 1987

1986

J. Comb. Theory, Ser. B, 1986