William H. Cunningham

41 papers A* 1B 5Journal 33Unranked 2
YearRankTypeTitle / Venue / Authors
2008 J jnl
An algorithm for packing non-zero
Comb.
Maria Chudnovsky, William H. Cunningham, Jim Geelen
2007 B conf
On Integer Programming and the Branch-Width of the Constraint Matrix.
IPCO
William H. Cunningham, Jim Geelen
2006 J jnl
Optimal 3-terminal cuts and linear programming.
Math. Program.
Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
2004 J jnl
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory B
William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
2002 J jnl
Matching, matroids, and extensions.
Math. Program.
William H. Cunningham
2000 J jnl
Restricted 2-factor polytopes.
Math. Program.
William H. Cunningham, Yaoguang Wang
1999 B conf
Optimal 3-Terminal Cuts and Linear Programming.
IPCO
William H. Cunningham, Lawrence Tang
1998 J jnl
Integral Solutions of Linear Complementarity Problems.
Math. Oper. Res.
William H. Cunningham, James F. Geelen
1998 J jnl
Principally Unimodular Skew-Symmetric Matrices.
Comb.
André Bouchet, William H. Cunningham, James F. Geelen
1997 J jnl
The Optimal Path-Matching Problem.
Comb.
William H. Cunningham, James F. Geelen
1997 J jnl
Wheel inequalitites for stable set polytopes.
Math. Program.
Eddie Cheng, William H. Cunningham
1996 B ed.
Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings
IPCO
William H. Cunningham, S. Thomas McCormick, Maurice Queyranne
1996 A* conf
The Optimal Path-Matching Problem.
FOCS
William H. Cunningham, James F. Geelen
1995 J jnl
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra.
SIAM J. Discret. Math.
André Bouchet, William H. Cunningham
1995 J jnl
Ladders for Travelling Salesmen.
SIAM J. Optim.
Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang
1995 B conf
Separation Problems for the Stable Set Polytope.
IPCO
Eddie Cheng, William H. Cunningham
1994 J jnl
A Faster Algorithm for Computing the Strength of a Network.
Inf. Process. Lett.
Eddie Cheng, William H. Cunningham
1994 J jnl
A separation algorithm for the matchable set polytope.
Math. Program.
William H. Cunningham, Jan Green-Krótki
1993 — conf
A linear programming and rounding approach to max 2-sat.
Cliques, Coloring, and Satisfiability
Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang
1992 B conf
Subgraph Degree-Sequence Polyhedra.
IPCO
William H. Cunningham, Fan Zhang
1991 J jnl
Small Travelling Salesman Polytopes.
Math. Oper. Res.
Sylvia C. Boyd, William H. Cunningham
1991 J jnl
b-matching degree-sequence polyhedra.
Comb.
William H. Cunningham, Jan Green-Krótki
1990 J jnl
Computing the binding number of a graph.
Discret. Appl. Math.
William H. Cunningham
1989 — conf
The Optimal Multiterminal Cut Problem.
Reliability Of Computer And Communication Networks
William H. Cunningham
1987 J jnl
Short Cocircuits in Binary Matroids.
Eur. J. Comb.
Robert E. Bixby, William H. Cunningham
1986 J jnl
Dominants and submissives of matching polyhedra.
Math. Program.
William H. Cunningham, Jan Green-Krótki
1986 J jnl
Improved Bounds for Matroid Partition and Intersection Algorithms.
SIAM J. Comput.
William H. Cunningham
1985 J jnl
A Primal-Dual Algorithm for Submodular Flows.
Math. Oper. Res.
William H. Cunningham, András Frank
1985 J jnl
Compositions for perfect graphs.
Discret. Math.
Gérard Cornuéjols, William H. Cunningham
1985 J jnl
Minimum cuts, modular functions, and matroid polyhedra.
Networks
William H. Cunningham
1985 J jnl
On submodular function minimization.
Comb.
William H. Cunningham
1985 J jnl
Optimal Attach and Reinforcement of a Network
J. ACM
William H. Cunningham
1985 J jnl
The Partial Order of a Polymatroid Extreme Point.
Math. Oper. Res.
Robert E. Bixby, William H. Cunningham, Donald M. Topkis
1984 J jnl
Testing membership in matroid polyhedra.
J. Comb. Theory B
William H. Cunningham
1983 J jnl
Decompostiton of submodular functions.
Comb.
William H. Cunningham
1983 J jnl
On cycling in the network simplex method.
Math. Program.
William H. Cunningham, John G. Klincewicz
1983 J jnl
Reductions to 1-matching polyhedra.
Networks
Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki
1983 J jnl
Technical Note - A Class of Linear Programs Convertible to Network Problems.
Oper. Res.
William H. Cunningham
1981 J jnl
On matroid connectivity.
J. Comb. Theory B
William H. Cunningham
1980 J jnl
Converting Linear Programs to Network Problems.
Math. Oper. Res.
Robert E. Bixby, William H. Cunningham
1976 J jnl
A network simplex method.
Math. Program.
William H. Cunningham