The SCEAS System
| |||||||

## Search the dblp DataBase
William H. Cunningham:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- William H. Cunningham, James F. Geelen
**The Optimal Path-Matching Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:78-85 [Conf] - Eddie Cheng, William H. Cunningham
**Separation Problems for the Stable Set Polytope.**[Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:65-79 [Conf] - William H. Cunningham, Lawrence Tang
**Optimal 3-Terminal Cuts and Linear Programming.**[Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:114-125 [Conf] - William H. Cunningham, Fan Zhang
**Subgraph Degree-Sequence Polyhedra.**[Citation Graph (0, 0)][DBLP] IPCO, 1992, pp:246-259 [Conf] - William H. Cunningham
**Decompostiton of submodular functions.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1983, v:3, n:1, pp:53-68 [Journal] - William H. Cunningham
**On submodular function minimization.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1985, v:5, n:3, pp:185-192 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] **An algorithm for packing non-zero**[Citation Graph (, )][DBLP]*A*-paths in group-labelled graphs.**Computing the binding number of a graph.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |