William H. Cunningham

Publication Activity (10 Years)

Years Active: 1976-2008
Publications (10 Years): 0

Publications

Maria Chudnovsky, William H. Cunningham, Jim Geelen
-paths in group-labelled graphs. Comb. 28 (2) (2008)
William H. Cunningham, Jim Geelen
On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO (2007)
Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
Optimal 3-terminal cuts and linear programming. Math. Program. 106 (1) (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) (2004)
William H. Cunningham
Matching, matroids, and extensions. Math. Program. 91 (3) (2002)
William H. Cunningham, Yaoguang Wang
Restricted 2-factor polytopes. Math. Program. 87 (1) (2000)
William H. Cunningham, Lawrence Tang
Optimal 3-Terminal Cuts and Linear Programming. IPCO (1999)
William H. Cunningham, James F. Geelen
Integral Solutions of Linear Complementarity Problems. Math. Oper. Res. 23 (1) (1998)
André Bouchet, William H. Cunningham, James F. Geelen
Principally Unimodular Skew-Symmetric Matrices. Comb. 18 (4) (1998)
William H. Cunningham, James F. Geelen
The Optimal Path-Matching Problem. Comb. 17 (3) (1997)
Eddie Cheng, William H. Cunningham
Wheel inequalitites for stable set polytopes. Math. Program. 77 (1997)
William H. Cunningham, James F. Geelen
The Optimal Path-Matching Problem. FOCS (1996)
Eddie Cheng, William H. Cunningham
Separation Problems for the Stable Set Polytope. IPCO (1995)
André Bouchet, William H. Cunningham
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discret. Math. 8 (1) (1995)
Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang
Ladders for Travelling Salesmen. SIAM J. Optim. 5 (2) (1995)
Eddie Cheng, William H. Cunningham
A Faster Algorithm for Computing the Strength of a Network. Inf. Process. Lett. 49 (4) (1994)
William H. Cunningham, Jan Green-Krótki
A separation algorithm for the matchable set polytope. Math. Program. 65 (1994)
Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang
A linear programming and rounding approach to max 2-sat. Cliques, Coloring, and Satisfiability (1993)
William H. Cunningham, Fan Zhang
Subgraph Degree-Sequence Polyhedra. IPCO (1992)
William H. Cunningham, Jan Green-Krótki
b-matching degree-sequence polyhedra. Comb. 11 (3) (1991)
Sylvia C. Boyd, William H. Cunningham
Small Travelling Salesman Polytopes. Math. Oper. Res. 16 (2) (1991)
William H. Cunningham
Computing the binding number of a graph. Discret. Appl. Math. 27 (3) (1990)
William H. Cunningham
The Optimal Multiterminal Cut Problem. Reliability Of Computer And Communication Networks (1989)
Robert E. Bixby, William H. Cunningham
Short Cocircuits in Binary Matroids. Eur. J. Comb. 8 (3) (1987)
William H. Cunningham, Jan Green-Krótki
Dominants and submissives of matching polyhedra. Math. Program. 36 (2) (1986)
William H. Cunningham
Improved Bounds for Matroid Partition and Intersection Algorithms. SIAM J. Comput. 15 (4) (1986)
William H. Cunningham, András Frank
A Primal-Dual Algorithm for Submodular Flows. Math. Oper. Res. 10 (2) (1985)
Gérard Cornuéjols, William H. Cunningham
Compositions for perfect graphs. Discret. Math. 55 (3) (1985)
William H. Cunningham
Optimal Attach and Reinforcement of a Network J. ACM 32 (3) (1985)
William H. Cunningham
On submodular function minimization. Comb. 5 (3) (1985)
Robert E. Bixby, William H. Cunningham, Donald M. Topkis
The Partial Order of a Polymatroid Extreme Point. Math. Oper. Res. 10 (3) (1985)
William H. Cunningham
Minimum cuts, modular functions, and matroid polyhedra. Networks 15 (2) (1985)
William H. Cunningham
Testing membership in matroid polyhedra. J. Comb. Theory, Ser. B 36 (2) (1984)
Juláan Aráoz, William H. Cunningham, Jack R. Edmonds, Jan Green-Krótki
Reductions to 1-matching polyhedra. Networks 13 (4) (1983)
William H. Cunningham
Decompostiton of submodular functions. Comb. 3 (1) (1983)
William H. Cunningham
Technical Note - A Class of Linear Programs Convertible to Network Problems. Oper. Res. 31 (2) (1983)
William H. Cunningham, John G. Klincewicz
On cycling in the network simplex method. Math. Program. 26 (2) (1983)
William H. Cunningham
On matroid connectivity. J. Comb. Theory, Ser. B 30 (1) (1981)
Robert E. Bixby, William H. Cunningham
Converting Linear Programs to Network Problems. Math. Oper. Res. 5 (3) (1980)
William H. Cunningham
A network simplex method. Math. Program. 11 (1) (1976)