| 2009 |
|---|
| 40 | EE | Xujin Chen,
Guoli Ding,
Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs.
Discrete Applied Mathematics 157(1): 118-125 (2009) |
| 39 | EE | Carolyn Chun,
Guoli Ding,
Bogdan Oporowski,
Dirk L. Vertigan:
Unavoidable parallel minors of 4-connected graphs.
Journal of Graph Theory 60(4): 313-326 (2009) |
| 2008 |
|---|
| 38 | EE | Guoli Ding,
Robert F. Lax,
Jianhua Chen,
Peter P. Chen,
Brian D. Marx:
Local Soft Belief Updating for Relational Classification.
ISMIS 2008: 525-534 |
| 37 | EE | Guoli Ding,
Robert F. Lax,
Jianhua Chen,
Peter P. Chen:
Formulas for approximating pseudo-Boolean random variables.
Discrete Applied Mathematics 156(10): 1581-1597 (2008) |
| 36 | EE | Guoli Ding,
Li Feng,
Wenan Zang:
The complexity of recognizing linear systems with certain integrality properties.
Math. Program. 114(2): 321-334 (2008) |
| 2007 |
|---|
| 35 | EE | Tong Yi,
Guoli Ding,
Bogdan Oporowski:
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters.
IPCCC 2007: 142-149 |
| 34 | | Guoli Ding,
Robert F. Lax,
Jianhua Chen,
Peter P. Chen,
Brian D. Marx:
Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k.
MLMTA 2007: 294- |
| 33 | EE | Guoli Ding,
Jianhua Chen,
Robert F. Lax,
Peter P. Chen:
Graph-theoretic method for merging security system specifications.
Inf. Sci. 177(10): 2152-2166 (2007) |
| 32 | EE | Guoli Ding,
Robert F. Lax,
Peter Chen,
Jianhua Chen:
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions.
JACIII 11(4): 403-409 (2007) |
| 2006 |
|---|
| 31 | EE | Guoli Ding,
Jinko Kanno:
Splitter Theorems for Cubic Graphs.
Combinatorics, Probability & Computing 15(3): 355-375 (2006) |
| 2005 |
|---|
| 30 | EE | Robert F. Lax,
Guoli Ding,
Peter P. Chen,
Jianhua Chen:
Approximating Pseudo-Boolean Functions on Non-Uniform Domains.
IJCAI 2005: 1754-1755 |
| 29 | EE | Xujin Chen,
Guoli Ding,
Xiaodong Hu,
Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets.
ISAAC 2005: 126-135 |
| 28 | EE | Guoli Ding,
Jianhua Chen,
Robert F. Lax,
Peter P. Chen:
Efficient Learning of Pseudo-Boolean Functions from Limited Training Data.
ISMIS 2005: 323-331 |
| 27 | EE | Steven S. Seiden,
Peter P. Chen,
Robert F. Lax,
Jianhua Chen,
Guoli Ding:
New bounds for randomized busing.
Theor. Comput. Sci. 332(1-3): 63-81 (2005) |
| 2004 |
|---|
| 26 | EE | Guoli Ding,
Peter P. Chen:
Unavoidable doubly connected large graphs.
Discrete Mathematics 280(1-3): 1-12 (2004) |
| 25 | EE | Matt DeVos,
Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Bruce A. Reed,
Paul D. Seymour,
Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B 91(1): 25-41 (2004) |
| 24 | EE | Peter P. Chen,
Guoli Ding:
The best expert versus the smartest algorithm.
Theor. Comput. Sci. 324(2-3): 361-380 (2004) |
| 2003 |
|---|
| 23 | EE | Guoli Ding,
Peter P. Chen:
Generating r-regular graphs.
Discrete Applied Mathematics 129(2-3): 329-343 (2003) |
| 22 | EE | Noga Alon,
Guoli Ding,
Bogdan Oporowski,
Dirk Vertigan:
Partitioning into graphs with only small components.
J. Comb. Theory, Ser. B 87(2): 231-243 (2003) |
| 21 | EE | Guoli Ding,
Zhenzhen Xu,
Wenan Zang:
Packing cycles in graphs, II.
J. Comb. Theory, Ser. B 87(2): 244-253 (2003) |
| 2002 |
|---|
| 20 | EE | Guoli Ding:
On interval clutters.
Discrete Mathematics 254(1-3): 89-102 (2002) |
| 19 | EE | Guoli Ding,
Wenan Zang:
Packing Cycles in Graphs.
J. Comb. Theory, Ser. B 86(2): 381-407 (2002) |
| 2000 |
|---|
| 18 | EE | Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory, Ser. B 79(2): 221-246 (2000) |
| 1998 |
|---|
| 17 | EE | Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width.
Combinatorica 18(1): 1-12 (1998) |
| 1997 |
|---|
| 16 | EE | Guoli Ding,
Peter L. Hammer:
Matroids arisen from matrogenic graphs.
Discrete Mathematics 165-166: 211-217 (1997) |
| 15 | EE | Guoli Ding,
Bogdan Oporowski,
James G. Oxley,
Dirk L. Vertigan:
Unavoidable Minors of Large 3-Connected Matroids.
J. Comb. Theory, Ser. B 71(2): 244-293 (1997) |
| 1996 |
|---|
| 14 | | Guoli Ding:
Bounding the Number of Circuits of a Graph.
Combinatorica 16(3): 331-341 (1996) |
| 13 | EE | Guoli Ding,
Bogdan Oporowski:
On tree-partitions of graphs.
Discrete Mathematics 149(1-3): 45-58 (1996) |
| 12 | EE | Guoli Ding:
Excluding a Long Double Path Minor.
J. Comb. Theory, Ser. B 66(1): 11-23 (1996) |
| 11 | EE | Guoli Ding,
Bogdan Oporowski,
James G. Oxley,
Dirk Vertigan:
Unavoidable Minors of Large 3-Connected Binary Matroids.
J. Comb. Theory, Ser. B 66(2): 334-360 (1996) |
| 1995 |
|---|
| 10 | | Guoli Ding:
Bounding the Number of Bases of a Matroid.
Combinatorica 15(2): 159-165 (1995) |
| 9 | EE | Guoli Ding,
Bogdan Oporowski,
James G. Oxley:
On Infinite Antichains of Matroids.
J. Comb. Theory, Ser. B 63(1): 21-40 (1995) |
| 1994 |
|---|
| 8 | | Guoli Ding,
Paul D. Seymour,
Peter Winkler:
Bounding the Vertex Cover Number of a Hypergraph.
Combinatorica 14(1): 23-34 (1994) |
| 1993 |
|---|
| 7 | EE | Guoli Ding:
Disjoint circuits on a Klein bottle and a theorem on posets.
Discrete Mathematics 112(1-3): 81-91 (1993) |
| 6 | EE | Guoli Ding:
Clutters with tau2=2tau.
Discrete Mathematics 115(1-3): 141-152 (1993) |
| 5 | EE | Guoli Ding:
Stable sets versus independent sets.
Discrete Mathematics 117(1-3): 73-87 (1993) |
| 4 | EE | Guoli Ding:
Monotone clutters.
Discrete Mathematics 119(1-3): 67-77 (1993) |
| 3 | EE | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory, Ser. B 58(1): 40-45 (1993) |
| 1992 |
|---|
| 2 | | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discrete Math. 5(1): 112-116 (1992) |
| 1991 |
|---|
| 1 | | Guoli Ding:
The immersion relation on webs.
Graph Structure Theory 1991: 517-524 |
