A network simplex method. - William H. Cunningham (Math. Program., 1976)

Converting Linear Programs to Network Problems. - Robert E. Bixby; William H. Cunningham (Math. Oper. Res., 1980)

On matroid connectivity. - William H. Cunningham (J. Comb. Theory B, 1981)

Decompostiton of submodular functions. - William H. Cunningham (Comb., 1983)

Technical Note - A Class of Linear Programs Convertible to Network Problems. - William H. Cunningham (Oper. Res., 1983)

On cycling in the network simplex method. - William H. Cunningham; John G. Klincewicz (Math. Program., 1983)

Reductions to 1-matching polyhedra. - Juláan Aráoz; William H. Cunningham; Jack Edmonds 001; Jan Green-Krótki (Networks, 1983)

Testing membership in matroid polyhedra. - William H. Cunningham (J. Comb. Theory B, 1984)

On submodular function minimization. - William H. Cunningham (Comb., 1985)

Compositions for perfect graphs. - Gérard Cornuéjols; William H. Cunningham (Discret. Math., 1985)

The Partial Order of a Polymatroid Extreme Point. - Robert E. Bixby; William H. Cunningham; Donald M. Topkis (Math. Oper. Res., 1985)

A Primal-Dual Algorithm for Submodular Flows. - William H. Cunningham; András Frank (Math. Oper. Res., 1985)

Minimum cuts, modular functions, and matroid polyhedra. - William H. Cunningham (Networks, 1985)

Optimal Attach and Reinforcement of a Network - William H. Cunningham (J. ACM, 1985)

Dominants and submissives of matching polyhedra. - William H. Cunningham; Jan Green-Krótki (Math. Program., 1986)

Improved Bounds for Matroid Partition and Intersection Algorithms. - William H. Cunningham (SIAM J. Comput., 1986)

Short Cocircuits in Binary Matroids. - Robert E. Bixby; William H. Cunningham (Eur. J. Comb., 1987)

The Optimal Multiterminal Cut Problem. - William H. Cunningham (Reliability Of Computer And Communication Networks, 1989)

Computing the binding number of a graph. - William H. Cunningham (Discret. Appl. Math., 1990)

b-matching degree-sequence polyhedra. - William H. Cunningham; Jan Green-Krótki (Comb., 1991)

Small Travelling Salesman Polytopes. - Sylvia C. Boyd; William H. Cunningham (Math. Oper. Res., 1991)

Subgraph Degree-Sequence Polyhedra. - William H. Cunningham; Fan Zhang (IPCO, 1992)

A linear programming and rounding approach to max 2-sat. - Joseph Cheriyan; William H. Cunningham; Levent Tunçel; Yaoguang Wang (Cliques, Coloring, and Satisfiability, 1993)

A Faster Algorithm for Computing the Strength of a Network. - Eddie Cheng 001; William H. Cunningham (Inf. Process. Lett., 1994)

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

Separation Problems for the Stable Set Polytope. - Eddie Cheng 001; William H. Cunningham (IPCO, 1995)

Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. - André Bouchet; William H. Cunningham (SIAM J. Discret. Math., 1995)

Ladders for Travelling Salesmen. - Sylvia C. Boyd; William H. Cunningham; Maurice Queyranne; Yaoguang Wang (SIAM J. Optim., 1995)

The Optimal Path-Matching Problem. - William H. Cunningham; James F. Geelen (Comb., 1997)

Wheel inequalitites for stable set polytopes. - Eddie Cheng 001; William H. Cunningham (Math. Program., 1997)

Principally Unimodular Skew-Symmetric Matrices. - André Bouchet; William H. Cunningham; James F. Geelen (Comb., 1998)

Integral Solutions of Linear Complementarity Problems. - William H. Cunningham; James F. Geelen (Math. Oper. Res., 1998)

Optimal 3-Terminal Cuts and Linear Programming. - William H. Cunningham; Lawrence Tang (IPCO, 1999)

Restricted 2-factor polytopes. - William H. Cunningham; Yaoguang Wang (Math. Program., 2000)

Matching, matroids, and extensions. - William H. Cunningham (Math. Program., 2002)

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

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

On Integer Programming and the Branch-Width of the Constraint Matrix. - William H. Cunningham; Jim Geelen (IPCO, 2007)

An algorithm for packing non-zero A -paths in group-labelled graphs. - Maria Chudnovsky; William H. Cunningham; Jim Geelen (Comb., 2008)