The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guoli Ding: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guoli Ding
    The immersion relation on webs. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:517-524 [Conf]
  2. R. F. Lax, Guoli Ding, Peter P. Chen, Jianhua Chen
    Approximating Pseudo-Boolean Functions on Non-Uniform Domains. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1754-1755 [Conf]
  3. Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
    A Min-Max Relation on Packing Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:126-135 [Conf]
  4. Guoli Ding, Jianhua Chen, Robert Lax, Peter P. Chen
    Efficient Learning of Pseudo-Boolean Functions from Limited Training Data. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2005, pp:323-331 [Conf]
  5. Guoli Ding
    Bounding the Number of Bases of a Matroid. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:159-165 [Journal]
  6. Guoli Ding
    Bounding the Number of Circuits of a Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:331-341 [Journal]
  7. Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
    Partitioning Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:1-12 [Journal]
  8. Guoli Ding, Paul D. Seymour, Peter Winkler
    Bounding the Vertex Cover Number of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:23-34 [Journal]
  9. Guoli Ding, Peter P. Chen
    Generating r-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:329-343 [Journal]
  10. Guoli Ding
    On interval clutters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:89-102 [Journal]
  11. Guoli Ding, Peter P. Chen
    Unavoidable doubly connected large graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:1-12 [Journal]
  12. Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
    Partitioning into graphs with only small components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:231-243 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
  14. Guoli Ding
    Excluding a Long Double Path Minor. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:11-23 [Journal]
  15. Guoli Ding, Bogdan Oporowski, James G. Oxley
    On Infinite Antichains of Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:21-40 [Journal]
  16. Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
    Unavoidable Minors of Large 3-Connected Binary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:334-360 [Journal]
  17. Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan
    Unavoidable Minors of Large 3-Connected Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:244-293 [Journal]
  18. Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan
    Surfaces, Tree-Width, Clique-Minors, and Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:221-246 [Journal]
  19. Guoli Ding, Alexander Schrijver, Paul D. Seymour
    Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:1, pp:40-45 [Journal]
  20. Guoli Ding, Zhenzhen Xu, Wenan Zang
    Packing cycles in graphs, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:244-253 [Journal]
  21. Guoli Ding, Wenan Zang
    Packing Cycles in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:381-407 [Journal]
  22. Guoli Ding, Alexander Schrijver, Paul D. Seymour
    Disjoint Paths in a Planar Graph - A General Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:112-116 [Journal]
  23. Peter P. Chen, Guoli Ding
    The best expert versus the smartest algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:361-380 [Journal]
  24. Steven S. Seiden, Peter P. Chen, R. F. Lax, Jianhua Chen, Guoli Ding
    New bounds for randomized busing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:63-81 [Journal]
  25. Guoli Ding, Peter L. Hammer
    Matroids arisen from matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:211-217 [Journal]
  26. Guoli Ding
    Disjoint circuits on a Klein bottle and a theorem on posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:81-91 [Journal]
  27. Guoli Ding
    Clutters with tau2=2tau. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:141-152 [Journal]
  28. Guoli Ding
    Stable sets versus independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:73-87 [Journal]
  29. Guoli Ding
    Monotone clutters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:119, n:1-3, pp:67-77 [Journal]
  30. Guoli Ding, Bogdan Oporowski
    On tree-partitions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:45-58 [Journal]
  31. Guoli Ding, Jianhua Chen, R. F. Lax, Peter P. Chen
    Graph-theoretic method for merging security system specifications. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:10, pp:2152-2166 [Journal]

  32. Empirical Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. [Citation Graph (, )][DBLP]


  33. Learning Terrorist Profiles by Optimization with Two Objectives. [Citation Graph (, )][DBLP]


  34. Local Soft Belief Updating for Relational Classification. [Citation Graph (, )][DBLP]


  35. Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. [Citation Graph (, )][DBLP]


  36. Fuzzy Clustering and Iterative Relational Classification for Terrorist Profiling. [Citation Graph (, )][DBLP]


  37. A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. [Citation Graph (, )][DBLP]


  38. Splitter Theorems for Cubic Graphs. [Citation Graph (, )][DBLP]


  39. Formulas for approximating pseudo-Boolean random variables. [Citation Graph (, )][DBLP]


  40. The box-TDI system associated with 2-edge connected spanning subgraphs. [Citation Graph (, )][DBLP]


  41. Transforms of pseudo-Boolean random variables. [Citation Graph (, )][DBLP]


  42. On canonical antichains. [Citation Graph (, )][DBLP]


  43. The edge version of Hadwiger's conjecture. [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.102secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002