Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. - Xiaofeng Gu 002; Kamesh Madduri; K. Subramani 001; Hong-Jian Lai (FAW, 2009)

Random walks for selected boolean implication and equivalence problems. - K. Subramani 001; Hong-Jian Lai; Xiaofeng Gu 002 (Acta Informatica, 2009)

Absorbing random walks and the NAE2SAT problem. - K. Subramani 001; Xiaofeng Gu 002 (Int. J. Comput. Math., 2011)

Characterization of minimally (2, l)-connected graphs. - Xiaofeng Gu 002; Hong-Jian Lai; Senmei Yao (Inf. Process. Lett., 2011)

Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. - Xiaofeng Gu 002; Hong-Jian Lai; Yanting Liang (Appl. Math. Lett., 2012)

Realizing degree sequences with k-edge-connected uniform hypergraphs. - Xiaofeng Gu 002; Hong-Jian Lai (Discret. Math., 2013)

Improved algorithms for optimal length resolution refutation in difference constraint systems. - K. Subramani 001; Matthew D. Williamson; Xiaofeng Gu 002 (Formal Aspects Comput., 2013)

Characterizations of Strength Extremal Graphs. - Xiaofeng Gu 002; Hong-Jian Lai; Ping Li 023; Senmei Yao (Graphs Comb., 2014)

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs. - Sebastian M. Cioaba; Xiaofeng Gu 002 (CoRR, 2016)

Fractional spanning tree packing, forest covering and eigenvalues. - Yanmei Hong; Xiaofeng Gu 002; Hong-Jian Lai; Qinghai Liu (Discret. Appl. Math., 2016)

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs. - Xiaofeng Gu 002; Hong-Jian Lai; Ping Li 023; Senmei Yao (J. Graph Theory, 2016)

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

Cycles with a chord in dense graphs. - Guantao Chen; Ronald J. Gould; Xiaofeng Gu 002; Akira Saito (Discret. Math., 2018)

A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. - Xiaofeng Gu 002; Hong-Jian Lai (Discret. Math., 2018)

Spectrum bounds for the scattering number, integrity, tenacity of regular graphs. - Yinkui Li; Yongtang Shi; Xiaofeng Gu 002 (Future Gener. Comput. Syst., 2018)

Spectral characterization of the complete graph removing a path. - Muhuo Liu; Haiying Shan; Xiaofeng Gu 002 (Discret. Appl. Math., 2020)

Spanning bipartite graphs with high degree sum in graphs. - Guantao Chen; Shuya Chiba; Ronald J. Gould; Xiaofeng Gu 002; Akira Saito; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2020)

Spectral conditions for graph rigidity in the Euclidean plane. - Sebastian M. Cioaba; Sean Dewar; Xiaofeng Gu 002 (Discret. Math., 2021)

Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture. - Muhuo Liu; Xiaofeng Gu 002 (Discret. Math., 2021)

Toughness in pseudo-random graphs. - Xiaofeng Gu 002 (Eur. J. Comb., 2021)

A Proof of Brouwer's Toughness Conjecture. - Xiaofeng Gu 002 (SIAM J. Discret. Math., 2021)

Sufficient Conditions for 2-Dimensional Global Rigidity. - Xiaofeng Gu 002; Wei Meng; Martin Rolek; Yue Wang 050; Gexin Yu (SIAM J. Discret. Math., 2021)

Cyclically Orderable Generalized Petersen Graphs. - Xiaofeng Gu 002; William Zhang 003 (AAIM, 2022)

Extremal augmented Zagreb index of trees with given numbers of vertices and leaves. - Chaohui Chen; Muhuo Liu; Xiaofeng Gu 002; Kinkar Chandra Das (Discret. Math., 2022)

Spectral strengthening of a theorem on transversal critical graphs. - Muhuo Liu; Xiaofeng Gu 002 (Discret. Math., 2022)

A tight lower bound on the matching number of graphs via Laplacian eigenvalues. - Xiaofeng Gu 002; Muhuo Liu (Eur. J. Comb., 2022)

ℓ $ ell $ -Connectivity and ℓ $ ell $ -edge-connectivity of random graphs. - Ran Gu; Xiaofeng Gu 002; Yongtang Shi; Hua Wang 003 (J. Graph Theory, 2022)

On hamiltonian line graphs of hypergraphs. - Xiaofeng Gu 002; Hong-Jian Lai; Sulin Song (J. Graph Theory, 2022)

Graph Rigidity Properties of Ramanujan Graphs. - Sebastian M. Cioaba; Sean Dewar; Georg Grasegger; Xiaofeng Gu 002 (Electron. J. Comb., 2023)

Spanning tree packing and 2-essential edge-connectivity. - Xiaofeng Gu 002; Runrun Liu; Gexin Yu (Discret. Math., 2023)

Spectral radius and edge-disjoint spanning trees. - Dandan Fan; Xiaofeng Gu 002; Huiqiu Lin (J. Graph Theory, 2023)

Spectral characterization of the complete graph removing a cycle. - Muhuo Liu; Xiaofeng Gu 002; Haiying Shan; Zoran Stanic (J. Comb. Theory, Ser. A, 2024)

Cyclic base ordering of generalized Petersen graphs. - Xiaofeng Gu 002; William Zhang 003 (Discret. Math. Algorithms Appl., 2024)

Cyclic base ordering of certain degenerate graphs. - Xiaofeng Gu 002; Jessica Li; Eric H. Yang; William Y. Zhang (Discret. Appl. Math., 2025)