The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
William H. Cunningham: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. William H. Cunningham, James F. Geelen
    The Optimal Path-Matching Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:78-85 [Conf]
  2. Eddie Cheng, William H. Cunningham
    Separation Problems for the Stable Set Polytope. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:65-79 [Conf]
  3. William H. Cunningham, Lawrence Tang
    Optimal 3-Terminal Cuts and Linear Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:114-125 [Conf]
  4. William H. Cunningham, Fan Zhang
    Subgraph Degree-Sequence Polyhedra. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:246-259 [Conf]
  5. William H. Cunningham
    Decompostiton of submodular functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:53-68 [Journal]
  6. William H. Cunningham
    On submodular function minimization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:185-192 [Journal]
  7. William H. Cunningham, Jan Green-Krótki
    b-matching degree-sequence polyhedra. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:3, pp:219-230 [Journal]
  8. William H. Cunningham, James F. Geelen
    The Optimal Path-Matching Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:315-337 [Journal]
  9. André Bouchet, William H. Cunningham, James F. Geelen
    Principally Unimodular Skew-Symmetric Matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:461-486 [Journal]
  10. Eddie Cheng, William H. Cunningham
    A Faster Algorithm for Computing the Strength of a Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:4, pp:209-212 [Journal]
  11. William H. Cunningham
    Optimal Attach and Reinforcement of a Network [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:549-561 [Journal]
  12. William H. Cunningham
    Testing membership in matroid polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:2, pp:161-188 [Journal]
  13. William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
    To Adrian Bondy and U. S. R. Murty. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:1- [Journal]
  14. William H. Cunningham
    On matroid connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:94-99 [Journal]
  15. William H. Cunningham, Jan Green-Krótki
    A separation algorithm for the matchable set polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:65, n:, pp:139-150 [Journal]
  16. Eddie Cheng, William H. Cunningham
    Wheel inequalitites for stable set polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:389-421 [Journal]
  17. Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
    Optimal 3-terminal cuts and linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:1, pp:1-23 [Journal]
  18. William H. Cunningham
    Improved Bounds for Matroid Partition and Intersection Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:948-957 [Journal]
  19. André Bouchet, William H. Cunningham
    Delta-Matroids, Jump Systems, Bisubmodular Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:17-32 [Journal]
  20. William H. Cunningham, Jim Geelen
    On Integer Programming and the Branch-Width of the Constraint Matrix. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:158-166 [Conf]
  21. Gérard Cornuéjols, William H. Cunningham
    Compositions for perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:3, pp:245-254 [Journal]

  22. An algorithm for packing non-zero A -paths in group-labelled graphs. [Citation Graph (, )][DBLP]


  23. Computing the binding number of a graph. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002