William H. Cunningham

Maria Chudnovsky, William H. Cunningham, Jim Geelen: An algorithm for packing non-zero A -paths in group-labelled graphs. Combinatorica 28(2): 145-161 (2008)

William H. Cunningham, Jim Geelen: On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166

Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang: Optimal 3-terminal cuts and linear programming. Math. Program. 106(1): 1-23 (2006)

William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason: To Adrian Bondy and U. S. R. Murty. J. Comb. Theory, Ser. B 90(1): 1 (2004)

William H. Cunningham, Lawrence Tang: Optimal 3-Terminal Cuts and Linear Programming. IPCO 1999: 114-125

André Bouchet, William H. Cunningham, James F. Geelen: Principally Unimodular Skew-Symmetric Matrices. Combinatorica 18(4): 461-486 (1998)

William H. Cunningham, James F. Geelen: The Optimal Path-Matching Problem. Combinatorica 17(3): 315-337 (1997)

Eddie Cheng, William H. Cunningham: Wheel inequalitites for stable set polytopes. Math. Program. 77: 389-421 (1997)

William H. Cunningham, James F. Geelen: The Optimal Path-Matching Problem. FOCS 1996: 78-85

William H. Cunningham, S. Thomas McCormick, Maurice Queyranne (Eds.): Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1084, Springer 1996, isbn 3-540-61310-2

André Bouchet, William H. Cunningham: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discrete Math. 8(1): 17-32 (1995)

Eddie Cheng, William H. Cunningham: Separation Problems for the Stable Set Polytope. IPCO 1995: 65-79

Eddie Cheng, William H. Cunningham: A Faster Algorithm for Computing the Strength of a Network. Inf. Process. Lett. 49(4): 209-212 (1994)

William H. Cunningham, Jan Green-Krótki: A separation algorithm for the matchable set polytope. Math. Program. 65: 139-150 (1994)

William H. Cunningham, Fan Zhang: Subgraph Degree-Sequence Polyhedra. IPCO 1992: 246-259

William H. Cunningham, Jan Green-Krótki: b-matching degree-sequence polyhedra. Combinatorica 11(3): 219-230 (1991)

William H. Cunningham: Computing the binding number of a graph. Discrete Applied Mathematics 27(3): 283-285 (1990)

William H. Cunningham: Improved Bounds for Matroid Partition and Intersection Algorithms. SIAM J. Comput. 15(4): 948-957 (1986)

William H. Cunningham: On submodular function minimization. Combinatorica 5(3): 185-192 (1985)

Gérard Cornuéjols, William H. Cunningham: Compositions for perfect graphs. Discrete Mathematics 55(3): 245-254 (1985)

William H. Cunningham: Optimal Attach and Reinforcement of a Network. J. ACM 32(3): 549-561 (1985)

William H. Cunningham: Minimum cuts, modular functions, and matroid polyhedra. Networks 15(2): 205-215 (1985)

William H. Cunningham: Testing membership in matroid polyhedra. J. Comb. Theory, Ser. B 36(2): 161-188 (1984)

William H. Cunningham: Decompostiton of submodular functions. Combinatorica 3(1): 53-68 (1983)

Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki: Reductions to 1-matching polyhedra. Networks 13(4): 455-473 (1983)

William H. Cunningham: On matroid connectivity. J. Comb. Theory, Ser. B 30(1): 94-99 (1981)