default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuoli Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j80]Chanun Lewchalermvongs
, Guoli Ding:
Refining a chain theorem from matroids to internally 4-connected graphs. Adv. Appl. Math. 163: 102802 (2025)- [j79]Sarah Allred, Guoli Ding, Bogdan Oporowski:
Unavoidable induced subgraphs of infinite 2-connected graphs. Discret. Math. 348(4): 114346 (2025) - [j78]Sarah Allred, Guoli Ding, Bogdan Oporowski:
Unavoidable induced subgraphs of infinite 2-connected graphs. Discret. Math. 348(4): 114346 (2025) - 2024
- [j77]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49(1): 151-170 (2024) - 2023
- [j76]Guoli Ding, Chengfu Qin:
Strengthened chain theorems for different versions of 4-connectivity. Discret. Math. 346(1): 113129 (2023) - [j75]Sarah Allred, Guoli Ding, Bogdan Oporowski:
Unavoidable Induced Subgraphs of Large 2-Connected Graphs. SIAM J. Discret. Math. 37(2): 684-698 (2023) - [j74]Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang:
On Gupta's Codensity Conjecture. SIAM J. Discret. Math. 37(3): 1666-1673 (2023) - 2022
- [c11]Avah Banerjee, Maxwell Reeser, Guoli Ding:
Distributed Matrix Tiling Using A Hypergraph Labeling Formulation. ICDCN 2022: 62-71 - 2021
- [i2]Avah Banerjee, Guoli Ding, Maxwell Reeser:
Distributed Matrix Tiling Using A Hypergraph Labeling Formulation. CoRR abs/2106.15549 (2021) - 2020
- [j73]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors I: Structural description. J. Comb. Theory B 141: 264-294 (2020) - [j72]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory B 142: 244-275 (2020) - [i1]Avah Banerjee, Guoli Ding:
Online Mincut: Advice, Randomization and More. CoRR abs/2004.12223 (2020)
2010 – 2019
- 2019
- [j71]Chengfu Qin, Guoli Ding:
A chain theorem for 4-connected graphs. J. Comb. Theory B 134: 341-349 (2019) - 2018
- [j70]Guoli Ding, Joshua Fallon, Emily Marshall:
On Almost-Planar Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j69]Guoli Ding, Emily Marshall:
Minimal k-Connected Non-Hamiltonian Graphs. Graphs Comb. 34(2): 289-312 (2018) - [j68]Guoli Ding, Wenan Zang, Qiulan Zhao:
On box-perfect graphs. J. Comb. Theory B 128: 17-46 (2018) - [j67]Guoli Ding, Emily Marshall:
Excluding a large theta graph. J. Comb. Theory B 132: 47-79 (2018) - [j66]Guoli Ding, Lei Tan, Wenan Zang:
When Is the Matching Polytope Box-Totally Dual Integral? Math. Oper. Res. 43(1): 64-99 (2018) - 2016
- [j65]Guoli Ding, Chanun Lewchalermvongs, John Maharry:
Graphs with no $\bar P_7$-Minor. Electron. J. Comb. 23(2): 2 (2016) - [j64]Guoli Ding, Stan Dziobiak:
Excluded-Minor Characterization of Apex-Outerplanar Graphs. Graphs Comb. 32(2): 583-627 (2016) - [j63]Guoli Ding, Stan Dziobiak, Haidong Wu:
Large Wk- or K3, t-Minors in 3-Connected Graphs. J. Graph Theory 82(2): 207-217 (2016) - [j62]Guoli Ding, Perry Iverson:
Hall-Type Results for 3-Connected Projective Graphs. J. Graph Theory 82(3): 253-264 (2016) - [j61]Carolyn Chun, Guoli Ding, Dillon Mayhew, James G. Oxley:
Unavoidable Connected Matroids Retaining a Specified Minor. SIAM J. Discret. Math. 30(3): 1590-1606 (2016) - 2015
- [j60]Guoli Ding, Haidong Wu:
Characterizing binary matroids with no P9-minor. Adv. Appl. Math. 70: 70-91 (2015) - 2014
- [j59]Guoli Ding, Perry Iverson:
Internally 4-connected projective-planar graphs. J. Comb. Theory B 108: 123-138 (2014) - 2013
- [j58]Guoli Ding, Cheng Liu:
Excluding a small minor. Discret. Appl. Math. 161(3): 355-368 (2013) - [j57]Guoli Ding:
A Characterization of Graphs with No Octahedron Minor. J. Graph Theory 74(2): 143-162 (2013) - [j56]Guoli Ding, Stan Dziobiak:
On 3-Connected Graphs of Path-Width at Most Three. SIAM J. Discret. Math. 27(3): 1514-1526 (2013) - 2012
- [j55]Mark Bilinski, Kwang Ju Choi, Deborah Chun, Guoli Ding, Stan Dziobiak, Rodrigo Farnham, Perry Iverson, Shirley Leu, Lisa Warshauer Lowrance:
Bandwidth of trees of diameter at most 4. Discret. Math. 312(12-13): 1947-1951 (2012) - [j54]Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. J. Comb. Theory B 102(3): 588-609 (2012) - [j53]Guoli Ding, Cheng Liu:
A Chain Theorem for 3+-Connected Graphs. SIAM J. Discret. Math. 26(1): 102-113 (2012) - [j52]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26(3): 1346-1360 (2012) - 2011
- [j51]Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan:
Large non-planar graphs and an application to crossing-critical graphs. J. Comb. Theory B 101(2): 111-121 (2011) - 2010
- [j50]Guoli Ding, Stan Dziobiak:
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs. Comb. Probab. Comput. 19(4): 579-591 (2010) - [j49]Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen, Brian D. Marx:
Transforms of pseudo-Boolean random variables. Discret. Appl. Math. 158(1): 13-24 (2010) - [j48]Carolyn Chun, Guoli Ding:
Unavoidable topological minors of infinite graphs. Discret. Math. 310(24): 3512-3522 (2010) - [j47]Guoli Ding, Jinko Kanno:
Splitter Theorems for 4-Regular Graphs. Graphs Comb. 26(3): 329-344 (2010)
2000 – 2009
- 2009
- [j46]Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157(1): 118-125 (2009) - [j45]Guoli Ding:
The edge version of Hadwiger's conjecture. Discret. Math. 309(5): 1118-1122 (2009) - [j44]Guoli Ding:
On canonical antichains. Discret. Math. 309(5): 1123-1134 (2009) - [j43]Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan:
Unavoidable parallel minors of 4-connected graphs. J. Graph Theory 60(4): 313-326 (2009) - [j42]Guoli Ding, Jinko Kanno, Jianning Su:
Generating 5-regular planar graphs. J. Graph Theory 61(3): 219-240 (2009) - [j41]Guoli Ding, Wenan Zang:
Packing circuits in matroids. Math. Program. 119(1): 137-168 (2009) - [c10]Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen, Brian D. Marx:
Learning Terrorist Profiles by Optimization with Two Objectives. IKE 2009: 364-369 - 2008
- [j40]Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen:
Formulas for approximating pseudo-Boolean random variables. Discret. Appl. Math. 156(10): 1581-1597 (2008) - [j39]Xujin Chen, Guoli Ding, Wenan Zang:
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33(2): 497-512 (2008) - [j38]Guoli Ding, Li Feng, Wenan Zang:
The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2): 321-334 (2008) - [c9]Jianhua Chen, Jian Xu, Peter P. Chen, Guoli Ding, Robert F. Lax, Brian D. Marx:
Fuzzy Clustering and Iterative Relational Classification for Terrorist Profiling. GrC 2008: 142-147 - [c8]K. Nunez, Jianhua Chen, Peter P. Chen, Guoli Ding, Robert F. Lax, Brian D. Marx:
Empirical Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. ICMLA 2008: 106-111 - [c7]Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen, Brian D. Marx:
Local Soft Belief Updating for Relational Classification. ISMIS 2008: 525-534 - 2007
- [j37]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) - [j36]Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua Chen:
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions. J. Adv. Comput. Intell. Intell. Informatics 11(4): 403-409 (2007) - [c6]Tong Yi, Guoli Ding, Bogdan Oporowski:
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. IPCCC 2007: 142-149 - [c5]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- - 2006
- [j35]Guoli Ding, Jinko Kanno:
Splitter Theorems for Cubic Graphs. Comb. Probab. Comput. 15(3): 355-375 (2006) - [j34]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31(4): 777-788 (2006) - 2005
- [j33]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) - [c4]Robert F. Lax, Guoli Ding, Peter P. Chen, Jianhua Chen:
Approximating Pseudo-Boolean Functions on Non-Uniform Domains. IJCAI 2005: 1754-1755 - [c3]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135 - [c2]Guoli Ding, Jianhua Chen, Robert F. Lax, Peter P. Chen:
Efficient Learning of Pseudo-Boolean Functions from Limited Training Data. ISMIS 2005: 323-331 - 2004
- [j32]Guoli Ding, Peter P. Chen:
Unavoidable doubly connected large graphs. Discret. Math. 280(1-3): 1-12 (2004) - [j31]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 B 91(1): 25-41 (2004) - [j30]Peter P. Chen, Guoli Ding:
The best expert versus the smartest algorithm. Theor. Comput. Sci. 324(2-3): 361-380 (2004) - 2003
- [j29]Guoli Ding, Peter P. Chen:
Generating r-regular graphs. Discret. Appl. Math. 129(2-3): 329-343 (2003) - [j28]Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan:
Partitioning into graphs with only small components. J. Comb. Theory B 87(2): 231-243 (2003) - [j27]Guoli Ding, Zhenzhen Xu, Wenan Zang:
Packing cycles in graphs, II. J. Comb. Theory B 87(2): 244-253 (2003) - 2002
- [j26]Guoli Ding:
On interval clutters. Discret. Math. 254(1-3): 89-102 (2002) - [j25]Guoli Ding, Wenan Zang:
Packing Cycles in Graphs. J. Comb. Theory B 86(2): 381-407 (2002) - 2001
- [j24]Guoli Ding, Thor Johnson, Paul D. Seymour:
Spanning trees with many leaves. J. Graph Theory 37(4): 189-197 (2001) - 2000
- [j23]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory B 79(2): 221-246 (2000)
1990 – 1999
- 1998
- [j22]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width. Comb. 18(1): 1-12 (1998) - [j21]Guoli Ding:
Chordal graphs, interval graphs, and wqo. J. Graph Theory 28(2): 105-114 (1998) - 1997
- [j20]Guoli Ding, Peter L. Hammer:
Matroids arisen from matrogenic graphs. Discret. Math. 165-166: 211-217 (1997) - [j19]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan:
Unavoidable Minors of Large 3-Connected Matroids. J. Comb. Theory B 71(2): 244-293 (1997) - 1996
- [j18]Guoli Ding:
Bounding the Number of Circuits of a Graph. Comb. 16(3): 331-341 (1996) - [j17]Guoli Ding, Bogdan Oporowski:
On tree-partitions of graphs. Discret. Math. 149(1-3): 45-58 (1996) - [j16]Guoli Ding:
Excluding a Long Double Path Minor. J. Comb. Theory B 66(1): 11-23 (1996) - [j15]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan:
Unavoidable Minors of Large 3-Connected Binary Matroids. J. Comb. Theory B 66(2): 334-360 (1996) - 1995
- [j14]Guoli Ding:
Bounding the Number of Bases of a Matroid. Comb. 15(2): 159-165 (1995) - [j13]Guoli Ding, Bogdan Oporowski, James G. Oxley:
On Infinite Antichains of Matroids. J. Comb. Theory B 63(1): 21-40 (1995) - [j12]Guoli Ding, Bogdan Oporowski:
Some results on tree decomposition of graphs. J. Graph Theory 20(4): 481-499 (1995) - [j11]Guoli Ding:
Graphs with not too many spanning trees. Networks 25(4): 193-197 (1995) - 1994
- [j10]Guoli Ding, Paul D. Seymour, Peter Winkler:
Bounding the Vertex Cover Number of a Hypergraph. Comb. 14(1): 23-34 (1994) - [j9]Guoli Ding:
Recognizing the P4-structure of a tree. Graphs Comb. 10(2-4): 323-328 (1994) - 1993
- [j8]Guoli Ding:
Disjoint circuits on a Klein bottle and a theorem on posets. Discret. Math. 112(1-3): 81-91 (1993) - [j7]Guoli Ding:
Clutters with tau2=2tau. Discret. Math. 115(1-3): 141-152 (1993) - [j6]Guoli Ding:
Stable sets versus independent sets. Discret. Math. 117(1-3): 73-87 (1993) - [j5]Guoli Ding:
Monotone clutters. Discret. Math. 119(1-3): 67-77 (1993) - [j4]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. J. Comb. Theory B 58(1): 40-45 (1993) - 1992
- [j3]Guoli Ding:
Subgraphs and well-quasi-ordering. J. Graph Theory 16(5): 489-502 (1992) - [j2]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. SIAM J. Discret. Math. 5(1): 112-116 (1992) - 1991
- [j1]Guoli Ding:
Covering the edges with consecutive sets. J. Graph Theory 15(5): 559-562 (1991) - [c1]Guoli Ding:
The immersion relation on webs. Graph Structure Theory 1991: 517-524
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-14 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
