William H. Cunningham - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2008

An algorithm for packing non-zero ::::A:::: -paths in group-labelled graphsMaria Chudnovsky, William H. Cunningham, Jim Geelen. combinatorica, 28(2):145-161, 2008. [doi]

2007

On Integer Programming and the Branch-Width of the Constraint MatrixWilliam H. Cunningham, Jim Geelen. ipco 2007: 158-166 [doi]

2006

Optimal 3-terminal cuts and linear programmingKevin K. H. Cheung, William H. Cunningham, Lawrence Tang. mp, 106(1):1-23, 2006. [doi]

2004

To Adrian Bondy and U. S. R. MurtyWilliam H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason. JCT, 90(1):1, 2004. [doi]

2002

Matching, matroids, and extensionsWilliam H. Cunningham. mp, 91(3):515-542, 2002. [doi]

2000

Restricted 2-factor polytopesWilliam H. Cunningham, Yaoguang Wang. mp, 87(1):87-111, 2000. [doi]

1999

Optimal 3-Terminal Cuts and Linear ProgrammingWilliam H. Cunningham, Lawrence Tang. ipco 1999: 114-125 [doi]

1998

Principally Unimodular Skew-Symmetric MatricesAndré Bouchet, William H. Cunningham, James F. Geelen. combinatorica, 18(4):461-486, 1998. [doi]

Integral Solutions of Linear Complementarity ProblemsWilliam H. Cunningham, James F. Geelen. mor, 23(1):61-68, 1998. [doi]

1997

Wheel inequalitites for stable set polytopesEddie Cheng, William H. Cunningham. mp, 77:389-421, 1997.

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

1996

The Optimal Path-Matching ProblemWilliam H. Cunningham, James F. Geelen. focs 1996: 78-85

1995

Delta-Matroids, Jump Systems, Bisubmodular PolyhedraAndré Bouchet, William H. Cunningham. siamdm, 8(1):17-32, 1995. [doi]

Ladders for Travelling SalesmenSylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang. siamjo, 5(2):408-420, 1995. [doi]

Separation Problems for the Stable Set PolytopeEddie Cheng, William H. Cunningham. ipco 1995: 65-79

1994

A Faster Algorithm for Computing the Strength of a NetworkEddie Cheng, William H. Cunningham. ipl, 49(4):209-212, 1994.

A separation algorithm for the matchable set polytopeWilliam H. Cunningham, Jan Green-Krótki. mp, 65:139-150, 1994.

1993

A linear programming and rounding approach to max 2-satJoseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang. dimacs 1996: 395-414

1992

Subgraph Degree-Sequence PolyhedraWilliam H. Cunningham, Fan Zhang. ipco 1992: 246-259

1991

Small Travelling Salesman PolytopesSylvia C. Boyd, William H. Cunningham. mor, 16(2):259-271, 1991. [doi]

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

1990

Computing the binding number of a graphWilliam H. Cunningham. DAM, 27(3):283-285, 1990. [doi]

1989

The Optimal Multiterminal Cut ProblemWilliam H. Cunningham. dimacs 1991: 105-120

1987

Short Cocircuits in Binary MatroidsRobert E. Bixby, William H. Cunningham. ejc, 8(3):213-225, 1987. [doi]

1986

Improved Bounds for Matroid Partition and Intersection AlgorithmsWilliam H. Cunningham. SICOMP, 15(4):948-957, 1986.

Dominants and submissives of matching polyhedraWilliam H. Cunningham, Jan Green-Krótki. mp, 36(2):228-237, 1986. [doi]

1985

The Partial Order of a Polymatroid Extreme PointRobert E. Bixby, William H. Cunningham, Donald M. Topkis. mor, 10(3):367-378, 1985. [doi]

Compositions for perfect graphsGérard Cornuéjols, William H. Cunningham. DM, 55(3):245-254, 1985. [doi]

On submodular function minimizationWilliam H. Cunningham. combinatorica, 5(3):185-192, 1985.

Optimal Attach and Reinforcement of a NetworkWilliam H. Cunningham. JACM, 32(3):549-561, July 1985. [doi]

Minimum cuts, modular functions, and matroid polyhedraWilliam H. Cunningham. networks, 15(2):205-215, 1985. [doi]

A Primal-Dual Algorithm for Submodular FlowsWilliam H. Cunningham, András Frank. mor, 10(2):251-262, 1985. [doi]

1984

Testing membership in matroid polyhedraWilliam H. Cunningham. JCT, 36(2):161-188, 1984. [doi]

1983

Reductions to 1-matching polyhedraJuláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki. networks, 13(4):455-473, 1983. [doi]

Decompostiton of submodular functionsWilliam H. Cunningham. combinatorica, 3(1):53-68, 1983.

On cycling in the network simplex methodWilliam H. Cunningham, John G. Klincewicz. mp, 26(2):182-189, 1983. [doi]

Technical Note - A Class of Linear Programs Convertible to Network ProblemsWilliam H. Cunningham. ior, 31(2):387-391, 1983. [doi]

1981

On matroid connectivityWilliam H. Cunningham. JCT, 30(1):94-99, 1981. [doi]

1980

Converting Linear Programs to Network ProblemsRobert E. Bixby, William H. Cunningham. mor, 5(3):321-357, 1980. [doi]

1976

A network simplex methodWilliam H. Cunningham. mp, 11(1):105-116, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL