Xiaofeng Gu

Orcid: 0000-0003-2725-2411

According to our database1, Xiaofeng Gu authored at least 55 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Cyclic base ordering of generalized Petersen graphs.
Discret. Math. Algorithms Appl., February, 2024

W-IQ: Wither-logic based issue queue for RISC-V superscalar out-of-order processor.
Integr., January, 2024

2023
Spectral radius and edge-disjoint spanning trees.
J. Graph Theory, December, 2023

Microwave-Sensor Array for Decoupling Detection of Distance, Shape, Dielectric, and Morphology.
IEEE Trans. Instrum. Meas., 2023

Semi-Supervised Seismic Stratigraphic Interpretation Constrained by Spatial Structure.
IEEE Trans. Geosci. Remote. Sens., 2023

Seismic Stratigraphic Interpretation Based on Deep Active Learning.
IEEE Trans. Geosci. Remote. Sens., 2023

Spanning tree packing and 2-essential edge-connectivity.
Discret. Math., 2023

Graph Rigidity Properties of Ramanujan Graphs.
Electron. J. Comb., 2023

2022
A novel multi-scale and sparsity auto-encoder for classification.
Int. J. Mach. Learn. Cybern., 2022

On hamiltonian line graphs of hypergraphs.
J. Graph Theory, 2022

ℓ $\ell $ -Connectivity and ℓ $\ell $ -edge-connectivity of random graphs.
J. Graph Theory, 2022

A tight lower bound on the matching number of graphs via Laplacian eigenvalues.
Eur. J. Comb., 2022

Spectral strengthening of a theorem on transversal critical graphs.
Discret. Math., 2022

Extremal augmented Zagreb index of trees with given numbers of vertices and leaves.
Discret. Math., 2022

Cyclically Orderable Generalized Petersen Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Sufficient Conditions for 2-Dimensional Global Rigidity.
SIAM J. Discret. Math., 2021

A Proof of Brouwer's Toughness Conjecture.
SIAM J. Discret. Math., 2021

An energy-efficient switching scheme based on distributing most significant bit capacitors for successive approximation register analog-to-digital converter.
Int. J. Circuit Theory Appl., 2021

Toughness in pseudo-random graphs.
Eur. J. Comb., 2021

Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture.
Discret. Math., 2021

Spectral conditions for graph rigidity in the Euclidean plane.
Discret. Math., 2021

2020
Spanning bipartite graphs with high degree sum in graphs.
Discret. Math., 2020

Spectral characterization of the complete graph removing a path.
Discret. Appl. Math., 2020

2019
Collaborative model with adaptive selection scheme for visual tracking.
Int. J. Mach. Learn. Cybern., 2019

Adaptive Weight Collaborative Complementary Learning for Robust Visual Tracking.
KSII Trans. Internet Inf. Syst., 2019

2018
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering.
SIAM J. Discret. Math., 2018

A multistandard and resource-efficient Viterbi decoder for a multimode communication system.
Frontiers Inf. Technol. Electron. Eng., 2018

Spectrum bounds for the scattering number, integrity, tenacity of regular graphs.
Future Gener. Comput. Syst., 2018

A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs.
Discret. Math., 2018

Cycles with a chord in dense graphs.
Discret. Math., 2018

Credit Scoring Based on Transaction Sequence Classification.
Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2018

2017
Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs.
J. Comb. Optim., 2017

A Secure Face-Verification Scheme Based on Homomorphic Encryption and Deep Neural Networks.
IEEE Access, 2017

The stability and control of fractional-order system with distributed time delay.
Proceedings of the IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society, Beijing, China, October 29, 2017

2016
Comparison of electrical characteristics between AlGaN/GaN and lattice-matched InAlN/GaN heterostructure Schottky barrier diodes.
Microelectron. Reliab., 2016

Hot electrons induced degradation in lattice-matched InAlN/GaN high electron mobility transistors.
Microelectron. Reliab., 2016

Design and optimization of LDMOS-SCR devices with improved ESD protection performance.
Microelectron. Reliab., 2016

Investigation on LDMOS-SCR with high holding current for high voltage ESD protection.
Microelectron. Reliab., 2016

Design and Implementation of a USB Device Controller with the Power Management Unit.
J. Low Power Electron., 2016

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.
J. Graph Theory, 2016

Fractional spanning tree packing, forest covering and eigenvalues.
Discret. Appl. Math., 2016

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
CoRR, 2016

2014
An investigation on capacitance-trigger ESD protection devices for high voltage integrated circuits.
Microelectron. Reliab., 2014

An Intelligent System for Lung Cancer Diagnosis Using a New Genetic Algorithm Based Feature Selection Method.
J. Medical Syst., 2014

Characterizations of Strength Extremal Graphs.
Graphs Comb., 2014

Regular factors and eigenvalues of regular graphs.
Eur. J. Comb., 2014

2013
Multi-target indoor localization and tracking on video monitoring system in a wireless sensor network.
J. Netw. Comput. Appl., 2013

Improved algorithms for optimal length resolution refutation in difference constraint systems.
Formal Aspects Comput., 2013

Realizing degree sequences with <i>k</i>-edge-connected uniform hypergraphs.
Discret. Math., 2013

Kernel Parameter Optimization in Stretched Kernel-Based Fuzzy Clustering.
Proceedings of the Partially Supervised Learning - Second IAPR International Workshop, 2013

2012
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees.
Appl. Math. Lett., 2012

2011
Characterization of minimally (2, <i>l</i>)-connected graphs.
Inf. Process. Lett., 2011

Absorbing random walks and the NAE2SAT problem.
Int. J. Comput. Math., 2011

2009
Random walks for selected boolean implication and equivalence problems.
Acta Informatica, 2009

Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009


  Loading...