The immersion relation on webs. - Guoli Ding (Graph Structure Theory, 1991)

Covering the edges with consecutive sets. - Guoli Ding (J. Graph Theory, 1991)

Subgraphs and well-quasi-ordering. - Guoli Ding (J. Graph Theory, 1992)

Disjoint Paths in a Planar Graph - A General Theorem. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (SIAM J. Discret. Math., 1992)

Disjoint circuits on a Klein bottle and a theorem on posets. - Guoli Ding (Discret. Math., 1993)

Clutters with tau2=2tau. - Guoli Ding (Discret. Math., 1993)

Stable sets versus independent sets. - Guoli Ding (Discret. Math., 1993)

Monotone clutters. - Guoli Ding (Discret. Math., 1993)

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (J. Comb. Theory B, 1993)

Bounding the Vertex Cover Number of a Hypergraph. - Guoli Ding; Paul D. Seymour; Peter Winkler 001 (Comb., 1994)

Recognizing the P4-structure of a tree. - Guoli Ding (Graphs Comb., 1994)

Bounding the Number of Bases of a Matroid. - Guoli Ding (Comb., 1995)

On Infinite Antichains of Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley (J. Comb. Theory B, 1995)

Some results on tree decomposition of graphs. - Guoli Ding; Bogdan Oporowski (J. Graph Theory, 1995)

Graphs with not too many spanning trees. - Guoli Ding (Networks, 1995)

Bounding the Number of Circuits of a Graph. - Guoli Ding (Comb., 1996)

On tree-partitions of graphs. - Guoli Ding; Bogdan Oporowski (Discret. Math., 1996)

Excluding a Long Double Path Minor. - Guoli Ding (J. Comb. Theory B, 1996)

Unavoidable Minors of Large 3-Connected Binary Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley; Dirk Vertigan (J. Comb. Theory B, 1996)

Matroids arisen from matrogenic graphs. - Guoli Ding; Peter L. Hammer (Discret. Math., 1997)

Unavoidable Minors of Large 3-Connected Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley; Dirk L. Vertigan (J. Comb. Theory B, 1997)

Partitioning Graphs of Bounded Tree-Width. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk Vertigan (Comb., 1998)

Chordal graphs, interval graphs, and wqo. - Guoli Ding (J. Graph Theory, 1998)

Surfaces, Tree-Width, Clique-Minors, and Partitions. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk L. Vertigan (J. Comb. Theory B, 2000)

Spanning trees with many leaves. - Guoli Ding; Thor Johnson; Paul D. Seymour (J. Graph Theory, 2001)

On interval clutters. - Guoli Ding (Discret. Math., 2002)

Packing Cycles in Graphs. - Guoli Ding; Wenan Zang (J. Comb. Theory B, 2002)

Generating r-regular graphs. - Guoli Ding; Peter P. Chen (Discret. Appl. Math., 2003)

Partitioning into graphs with only small components. - Noga Alon; Guoli Ding; Bogdan Oporowski; Dirk Vertigan (J. Comb. Theory B, 2003)

Packing cycles in graphs, II. - Guoli Ding; Zhenzhen Xu; Wenan Zang (J. Comb. Theory B, 2003)

Unavoidable doubly connected large graphs. - Guoli Ding; Peter P. Chen (Discret. Math., 2004)

Excluding any graph as a minor allows a low tree-width 2-coloring. - Matt DeVos; Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Bruce A. Reed; Paul D. Seymour; Dirk Vertigan (J. Comb. Theory B, 2004)

The best expert versus the smartest algorithm. - Peter P. Chen; Guoli Ding (Theor. Comput. Sci., 2004)

Approximating Pseudo-Boolean Functions on Non-Uniform Domains. - Robert F. Lax; Guoli Ding; Peter P. Chen; Jianhua Chen 003 (IJCAI, 2005)

Efficient Learning of Pseudo-Boolean Functions from Limited Training Data. - Guoli Ding; Jianhua Chen 003; Robert F. Lax; Peter P. Chen (ISMIS, 2005)

New bounds for randomized busing. - Steven S. Seiden; Peter P. Chen; Robert F. Lax; Jianhua Chen 003; Guoli Ding (Theor. Comput. Sci., 2005)

Splitter Theorems for Cubic Graphs. - Guoli Ding; Jinko Kanno (Comb. Probab. Comput., 2006)

A Min-Max Relation on Packing Feedback Vertex Sets. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (Math. Oper. Res., 2006)

A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. - Tong Yi; Guoli Ding; Bogdan Oporowski (IPCCC, 2007)

Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. - Guoli Ding; Robert F. Lax; Jianhua Chen 003; Peter P. Chen; Brian D. Marx (MLMTA, 2007)

Graph-theoretic method for merging security system specifications. - Guoli Ding; Jianhua Chen 003; Robert F. Lax; Peter P. Chen (Inf. Sci., 2007)

Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions. - Guoli Ding; Robert F. Lax; Peter P. Chen; Jianhua Chen 003 (J. Adv. Comput. Intell. Intell. Informatics, 2007)

Fuzzy Clustering and Iterative Relational Classification for Terrorist Profiling. - Jianhua Chen 003; Jian Xu; Peter P. Chen; Guoli Ding; Robert F. Lax; Brian D. Marx (GrC, 2008)

Empirical Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. - K. Nunez; Jianhua Chen 003; Peter P. Chen; Guoli Ding; Robert F. Lax; Brian D. Marx (ICMLA, 2008)

Local Soft Belief Updating for Relational Classification. - Guoli Ding; Robert F. Lax; Jianhua Chen 003; Peter P. Chen; Brian D. Marx (ISMIS, 2008)

Formulas for approximating pseudo-Boolean random variables. - Guoli Ding; Robert F. Lax; Jianhua Chen 003; Peter P. Chen (Discret. Appl. Math., 2008)

A Characterization of Box-Mengerian Matroid Ports. - Xujin Chen; Guoli Ding; Wenan Zang (Math. Oper. Res., 2008)

The complexity of recognizing linear systems with certain integrality properties. - Guoli Ding; Li Feng 001; Wenan Zang (Math. Program., 2008)

Learning Terrorist Profiles by Optimization with Two Objectives. - Guoli Ding; Robert F. Lax; Jianhua Chen 003; Peter P. Chen; Brian D. Marx (IKE, 2009)

The box-TDI system associated with 2-edge connected spanning subgraphs. - Xujin Chen; Guoli Ding; Wenan Zang (Discret. Appl. Math., 2009)

The edge version of Hadwiger's conjecture. - Guoli Ding (Discret. Math., 2009)

On canonical antichains. - Guoli Ding (Discret. Math., 2009)

Unavoidable parallel minors of 4-connected graphs. - Carolyn Chun; Guoli Ding; Bogdan Oporowski; Dirk L. Vertigan (J. Graph Theory, 2009)

Generating 5-regular planar graphs. - Guoli Ding; Jinko Kanno; Jianning Su (J. Graph Theory, 2009)

Packing circuits in matroids. - Guoli Ding; Wenan Zang (Math. Program., 2009)

Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs. - Guoli Ding; Stan Dziobiak (Comb. Probab. Comput., 2010)

Transforms of pseudo-Boolean random variables. - Guoli Ding; Robert F. Lax; Jianhua Chen 003; Peter P. Chen; Brian D. Marx (Discret. Appl. Math., 2010)

Unavoidable topological minors of infinite graphs. - Carolyn Chun; Guoli Ding (Discret. Math., 2010)

Splitter Theorems for 4-Regular Graphs. - Guoli Ding; Jinko Kanno (Graphs Comb., 2010)

Large non-planar graphs and an application to crossing-critical graphs. - Guoli Ding; Bogdan Oporowski; Robin Thomas 001; Dirk Vertigan (J. Comb. Theory B, 2011)

Bandwidth of trees of diameter at most 4. - Mark Bilinski; Kwang Ju Choi; Deborah Chun; Guoli Ding; Stan Dziobiak; Rodrigo Farnham; Perry Iverson; Shirley Leu; Lisa Warshauer Lowrance (Discret. Math., 2012)

Bonds with parity constraints. - Xujin Chen; Guoli Ding; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

The Maximum-Weight Stable Matching Problem: Duality and Efficiency. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (SIAM J. Discret. Math., 2012)

A Chain Theorem for 3+-Connected Graphs. - Guoli Ding; Cheng Liu (SIAM J. Discret. Math., 2012)

Excluding a small minor. - Guoli Ding; Cheng Liu (Discret. Appl. Math., 2013)

A Characterization of Graphs with No Octahedron Minor. - Guoli Ding (J. Graph Theory, 2013)

On 3-Connected Graphs of Path-Width at Most Three. - Guoli Ding; Stan Dziobiak (SIAM J. Discret. Math., 2013)

Internally 4-connected projective-planar graphs. - Guoli Ding; Perry Iverson (J. Comb. Theory B, 2014)

Characterizing binary matroids with no P9-minor. - Guoli Ding; Haidong Wu (Adv. Appl. Math., 2015)

Graphs with no $ bar P_7$-Minor. - Guoli Ding; Chanun Lewchalermvongs; John Maharry (Electron. J. Comb., 2016)

Excluded-Minor Characterization of Apex-Outerplanar Graphs. - Guoli Ding; Stan Dziobiak (Graphs Comb., 2016)

Large Wk- or K3, t-Minors in 3-Connected Graphs. - Guoli Ding; Stan Dziobiak; Haidong Wu (J. Graph Theory, 2016)

Hall-Type Results for 3-Connected Projective Graphs. - Guoli Ding; Perry Iverson (J. Graph Theory, 2016)

Unavoidable Connected Matroids Retaining a Specified Minor. - Carolyn Chun; Guoli Ding; Dillon Mayhew; James G. Oxley (SIAM J. Discret. Math., 2016)

On Almost-Planar Graphs. - Guoli Ding; Joshua Fallon; Emily Marshall 001 (Electron. J. Comb., 2018)

Minimal k-Connected Non-Hamiltonian Graphs. - Guoli Ding; Emily Marshall 001 (Graphs Comb., 2018)

Excluding a large theta graph. - Guoli Ding; Emily Marshall 001 (J. Comb. Theory B, 2018)

On box-perfect graphs. - Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2018)

When Is the Matching Polytope Box-Totally Dual Integral? - Guoli Ding; Lei Tan; Wenan Zang (Math. Oper. Res., 2018)

A chain theorem for 4-connected graphs. - Chengfu Qin; Guoli Ding (J. Comb. Theory B, 2019)

Online Mincut: Advice, Randomization and More. - Avah Banerjee; Guoli Ding (CoRR, 2020)

Ranking tournaments with no errors I: Structural description. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

Ranking tournaments with no errors II: Minimax relation. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

Distributed Matrix Tiling Using A Hypergraph Labeling Formulation. - Avah Banerjee; Maxwell Reeser; Guoli Ding (ICDCN, 2022)

Strengthened chain theorems for different versions of 4-connectivity. - Guoli Ding; Chengfu Qin (Discret. Math., 2023)

Unavoidable Induced Subgraphs of Large 2-Connected Graphs. - Sarah Allred; Guoli Ding; Bogdan Oporowski (SIAM J. Discret. Math., 2023)

On Gupta's Codensity Conjecture. - Yan Cao 001; Guantao Chen; Guoli Ding; Guangming Jing; Wenan Zang (SIAM J. Discret. Math., 2023)

Packing Feedback Arc Sets in Tournaments Exactly. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (Math. Oper. Res., 2024)

Refining a chain theorem from matroids to internally 4-connected graphs. - Chanun Lewchalermvongs; Guoli Ding (Adv. Appl. Math., 2025)

Unavoidable induced subgraphs of infinite 2-connected graphs. - Sarah Allred; Guoli Ding; Bogdan Oporowski (Discret. Math., 2025)