Xiaofeng Guo

According to our database1, Xiaofeng Guo authored at least 85 papers between 1986 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


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

Soft Foot Sensor Design and Terrain Classification for Dynamic Legged Locomotion.
Proceedings of the 3rd IEEE International Conference on Soft Robotics, 2020

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

Contractible Edges and Removable Edges in 3-Connected Graphs.
Graphs Comb., 2019

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

A new kind of parameter for fault tolerance of graphs.
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

Active Affordance Exploration for Robot Grasping.
Proceedings of the Intelligent Robotics and Applications - 12th International Conference, 2019

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

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

The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs.
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

Fault tolerance of hypercubes and folded hypercubes.
J. Supercomput., 2014

Collapsible Graphs and Hamiltonicity of Line Graphs.
Graphs Comb., 2014

Total chromatic number of generalized Mycielski graphs.
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

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

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph.
Graphs Comb., 2012

Collapsible graphs and Hamiltonian connectedness of line graphs.
Discret. Appl. Math., 2012

Hosoya polynomials of the capped zig-zag nanotubes.
Ars Comb., 2012

Hamiltonicity of 3-connected line graphs.
Appl. Math. Lett., 2012

Super λ<sub>3</sub>-optimality of regular graphs.
Appl. Math. Lett., 2012

Some upper bounds for the atom-bond connectivity index of graphs.
Appl. Math. Lett., 2012

The construction of concept system in TCM syndrome ontology.
Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

SO-RTI: A new RTI based on web services.
Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.
Inf. Sci., 2011

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs.
Discret. Math., 2011

On the edge-connectivity of graphs with two orbits of the same size.
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

On a kind of reliability analysis of networks.
Appl. Math. Comput., 2011

Removable ears of 1-extendable graphs.
J. Syst. Sci. Complex., 2010

A kind of conditional fault tolerance of (n, k)-star graphs.
Inf. Process. Lett., 2010

Super connectivity of Kronecker products of graphs.
Inf. Process. Lett., 2010

A lower bound on the number of removable ears of 1-extendable graphs.
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

Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes.
Inf. Process. Lett., 2009

Removable edges in a k-connected graph and a construction method for k-connected graphs.
Discret. Math., 2009

Optimal strong (kappa, d)-orientation of complete k-partite graphs.
Discret. Appl. Math., 2009

A novel characterization of n-extendable bipartite graphs.
Ars Comb., 2009

Connectivity of the Mycielskian of a digraph.
Appl. Math. Lett., 2009

Lower and upper orientable strong diameters of graphs satisfying the Ore condition.
Appl. Math. Lett., 2009

Super-connected and hyper-connected jump graphs.
Int. J. Comput. Math., 2008

Removable edges in a 5-connected graph and a construction method of 5-connected graphs.
Discret. Math., 2008

Research on Ant Colony Neural Network PID Controller and Application.
Proceedings of the 8th ACIS International Conference on Software Engineering, 2007

Latency hiding through multithreading on a network processor.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Latency Hiding in Multi-Threading and Multi-Processing of Network Applications.
Proceedings of the 16th International Conference on Parallel Architectures and Compilation Techniques (PACT 2007), 2007

Lower and upper orientable strong radius and strong diameter of complete k-partite graphs.
Discret. Appl. Math., 2006

Reducible chains of planar 1-cycle resonant graphs.
Discret. Math., 2004

An Adaptive Routing Strategy Based on Dynamic Cache in Mobile Ad Hoc Networks.
Proceedings of the Parallel and Distributed Processing and Applications, 2004

Planar k-cycle resonant graphs with k=1, 2.
Discret. Appl. Math., 2003

Some Notes on 2-D Graphical Representation of DNA Sequence.
J. Chem. Inf. Comput. Sci., 2002

Boundary uniqueness of fusenes.
Discret. Appl. Math., 2002

On the Characterization of DNA Primary Sequences by Triplet of Nucleic Acid Bases.
J. Chem. Inf. Comput. Sci., 2001

k-Resonant Benzenoid Systems and k-Cycle Resonant Graphs.
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

Use of path matrices for a characterization of molecular structures.
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

Concealed Non-Kekuléan Benzenoids [J. Chem. Inf. Comput. Sci 35, 226-232 (1995)].
J. Chem. Inf. Comput. Sci., 1996

Concealed Non-Kekul.acte.ean Benzenoids.
J. Chem. Inf. Comput. Sci., 1995

Wiener Matrix Invariants.
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

k-Cycle resonant graphs.
Discret. Math., 1994

Wiener matrix: Source of novel graph invariants.
J. Chem. Inf. Comput. Sci., 1993

Theory of polypentagons.
J. Chem. Inf. Comput. Sci., 1993

Enumeration and classification of benzenoid systems. 32. Normal perifusenes with two internal vertices.
J. Chem. Inf. Comput. Sci., 1992

Reducible chains in several types of 2-connected graphs.
Discret. Math., 1992

Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs.
Discret. Appl. Math., 1991

Z-transformation graphs of perfect matchings of hexagonal systems.
Discret. Math., 1988

Hamilton cycles in directed Euler tour graphs.
Discret. Math., 1987

Hamilton cycles in Euler tour graph.
J. Comb. Theory, Ser. B, 1986