William H. Cunningham

According to our database, William H. Cunningham authored at least 39 papers between 1976 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2008

An algorithm for packing non-zero <i>A</i> -paths in group-labelled graphs.

Maria Chudnovsky, William H. Cunningham, Jim Geelen

Comb., 2008

2007

On Integer Programming and the Branch-Width of the Constraint Matrix.

William H. Cunningham, Jim Geelen

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Optimal 3-terminal cuts and linear programming.

Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang

Math. Program., 2006

2004

To Adrian Bondy and U. S. R. Murty.

William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason

J. Comb. Theory B, 2004

2002

Matching, matroids, and extensions.

William H. Cunningham

Math. Program., 2002

2000

Restricted 2-factor polytopes.

William H. Cunningham, Yaoguang Wang

Math. Program., 2000

1999

Optimal 3-Terminal Cuts and Linear Programming.

William H. Cunningham, Lawrence Tang

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Integral Solutions of Linear Complementarity Problems.

William H. Cunningham, James F. Geelen

Math. Oper. Res., 1998

Principally Unimodular Skew-Symmetric Matrices.

André Bouchet, William H. Cunningham, James F. Geelen

Comb., 1998

1997

Wheel inequalitites for stable set polytopes.

Eddie Cheng, William H. Cunningham

Math. Program., 1997

The Optimal Path-Matching Problem.

William H. Cunningham, James F. Geelen

Comb., 1997

1995

Ladders for Travelling Salesmen.

Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang

SIAM J. Optim., 1995

Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra.

André Bouchet, William H. Cunningham

SIAM J. Discret. Math., 1995

Separation Problems for the Stable Set Polytope.

Eddie Cheng, William H. Cunningham

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

A separation algorithm for the matchable set polytope.

William H. Cunningham, Jan Green-Krótki

Math. Program., 1994

A Faster Algorithm for Computing the Strength of a Network.

Eddie Cheng, William H. Cunningham

Inf. Process. Lett., 1994

1993

A linear programming and rounding approach to max 2-sat.

Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang

Proceedings of the Cliques, 1993

1992

Subgraph Degree-Sequence Polyhedra.

William H. Cunningham, Fan Zhang

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Small Travelling Salesman Polytopes.

Sylvia C. Boyd, William H. Cunningham

Math. Oper. Res., 1991

b-matching degree-sequence polyhedra.

William H. Cunningham, Jan Green-Krótki

Comb., 1991

1990

Computing the binding number of a graph.

William H. Cunningham

Discret. Appl. Math., 1990

1989

The Optimal Multiterminal Cut Problem.

William H. Cunningham

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1987

Short Cocircuits in Binary Matroids.

Robert E. Bixby, William H. Cunningham

Eur. J. Comb., 1987

1986

Improved Bounds for Matroid Partition and Intersection Algorithms.

William H. Cunningham

SIAM J. Comput., 1986

Dominants and submissives of matching polyhedra.

William H. Cunningham, Jan Green-Krótki

Math. Program., 1986

1985

Optimal Attach and Reinforcement of a Network

William H. Cunningham

J. ACM, July, 1985

Minimum cuts, modular functions, and matroid polyhedra.

William H. Cunningham

Networks, 1985

A Primal-Dual Algorithm for Submodular Flows.

William H. Cunningham, András Frank

Math. Oper. Res., 1985

The Partial Order of a Polymatroid Extreme Point.

Robert E. Bixby, William H. Cunningham, Donald M. Topkis

Math. Oper. Res., 1985

Compositions for perfect graphs.

Gérard Cornuéjols, William H. Cunningham

Discret. Math., 1985

On submodular function minimization.

William H. Cunningham

Comb., 1985

1984

Testing membership in matroid polyhedra.

William H. Cunningham

J. Comb. Theory B, 1984

1983

Reductions to 1-matching polyhedra.

Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki

Networks, 1983

On cycling in the network simplex method.

William H. Cunningham, John G. Klincewicz

Math. Program., 1983

Technical Note - A Class of Linear Programs Convertible to Network Problems.

William H. Cunningham

Oper. Res., 1983

Decompostiton of submodular functions.

William H. Cunningham

Comb., 1983

1981

On matroid connectivity.

William H. Cunningham

J. Comb. Theory B, 1981

1980

Converting Linear Programs to Network Problems.

Robert E. Bixby, William H. Cunningham

Math. Oper. Res., 1980

1976

A network simplex method.

William H. Cunningham

Math. Program., 1976