default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam H. Cunningham
Person information
- affiliation: University of Waterloo, Department of Combinatorics and Optimization
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j33]Maria Chudnovsky
, William H. Cunningham, Jim Geelen:
An algorithm for packing non-zero A -paths in group-labelled graphs. Comb. 28(2): 145-161 (2008)- 2007
- [c7]William H. Cunningham, Jim Geelen:
On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166 - 2006
- [j32]Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang:
Optimal 3-terminal cuts and linear programming. Math. Program. 106(1): 1-23 (2006) - 2004
- [j31]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 B 90(1): 1 (2004) - 2002
- [j30]William H. Cunningham:
Matching, matroids, and extensions. Math. Program. 91(3): 515-542 (2002) - 2000
- [j29]William H. Cunningham, Yaoguang Wang:
Restricted 2-factor polytopes. Math. Program. 87(1): 87-111 (2000)
1990 – 1999
- 1999
- [c6]William H. Cunningham, Lawrence Tang:
Optimal 3-Terminal Cuts and Linear Programming. IPCO 1999: 114-125 - 1998
- [j28]André Bouchet, William H. Cunningham, James F. Geelen:
Principally Unimodular Skew-Symmetric Matrices. Comb. 18(4): 461-486 (1998) - [j27]William H. Cunningham, James F. Geelen:
Integral Solutions of Linear Complementarity Problems. Math. Oper. Res. 23(1): 61-68 (1998) - 1997
- [j26]William H. Cunningham, James F. Geelen:
The Optimal Path-Matching Problem. Comb. 17(3): 315-337 (1997) - [j25]Eddie Cheng, William H. Cunningham:
Wheel inequalitites for stable set polytopes. Math. Program. 77: 389-421 (1997) - 1996
- [c5]William H. Cunningham, James F. Geelen:
The Optimal Path-Matching Problem. FOCS 1996: 78-85 - [e1]William H. Cunningham, S. Thomas McCormick, Maurice Queyranne:
Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1084, Springer 1996, ISBN 3-540-61310-2 [contents] - 1995
- [j24]André Bouchet, William H. Cunningham:
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discret. Math. 8(1): 17-32 (1995) - [j23]Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang:
Ladders for Travelling Salesmen. SIAM J. Optim. 5(2): 408-420 (1995) - [c4]Eddie Cheng, William H. Cunningham:
Separation Problems for the Stable Set Polytope. IPCO 1995: 65-79 - 1994
- [j22]Eddie Cheng, William H. Cunningham:
A Faster Algorithm for Computing the Strength of a Network. Inf. Process. Lett. 49(4): 209-212 (1994) - [j21]William H. Cunningham, Jan Green-Krótki:
A separation algorithm for the matchable set polytope. Math. Program. 65: 139-150 (1994) - 1993
- [c3]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: 395-413 - 1992
- [c2]William H. Cunningham, Fan Zhang:
Subgraph Degree-Sequence Polyhedra. IPCO 1992: 246-259 - 1991
- [j20]William H. Cunningham, Jan Green-Krótki:
b-matching degree-sequence polyhedra. Comb. 11(3): 219-230 (1991) - [j19]Sylvia C. Boyd, William H. Cunningham:
Small Travelling Salesman Polytopes. Math. Oper. Res. 16(2): 259-271 (1991) - 1990
- [j18]William H. Cunningham:
Computing the binding number of a graph. Discret. Appl. Math. 27(3): 283-285 (1990)
1980 – 1989
- 1989
- [c1]William H. Cunningham:
The Optimal Multiterminal Cut Problem. Reliability Of Computer And Communication Networks 1989: 105-120 - 1987
- [j17]Robert E. Bixby, William H. Cunningham:
Short Cocircuits in Binary Matroids. Eur. J. Comb. 8(3): 213-225 (1987) - 1986
- [j16]William H. Cunningham, Jan Green-Krótki:
Dominants and submissives of matching polyhedra. Math. Program. 36(2): 228-237 (1986) - [j15]William H. Cunningham:
Improved Bounds for Matroid Partition and Intersection Algorithms. SIAM J. Comput. 15(4): 948-957 (1986) - 1985
- [j14]William H. Cunningham:
On submodular function minimization. Comb. 5(3): 185-192 (1985) - [j13]Gérard Cornuéjols, William H. Cunningham:
Compositions for perfect graphs. Discret. Math. 55(3): 245-254 (1985) - [j12]William H. Cunningham:
Optimal Attach and Reinforcement of a Network. J. ACM 32(3): 549-561 (1985) - [j11]William H. Cunningham, András Frank:
A Primal-Dual Algorithm for Submodular Flows. Math. Oper. Res. 10(2): 251-262 (1985) - [j10]Robert E. Bixby, William H. Cunningham, Donald M. Topkis:
The Partial Order of a Polymatroid Extreme Point. Math. Oper. Res. 10(3): 367-378 (1985) - [j9]William H. Cunningham:
Minimum cuts, modular functions, and matroid polyhedra. Networks 15(2): 205-215 (1985) - 1984
- [j8]William H. Cunningham:
Testing membership in matroid polyhedra. J. Comb. Theory B 36(2): 161-188 (1984) - 1983
- [j7]William H. Cunningham:
Decompostiton of submodular functions. Comb. 3(1): 53-68 (1983) - [j6]William H. Cunningham:
Technical Note - A Class of Linear Programs Convertible to Network Problems. Oper. Res. 31(2): 387-391 (1983) - [j5]William H. Cunningham, John G. Klincewicz:
On cycling in the network simplex method. Math. Program. 26(2): 182-189 (1983) - [j4]Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki:
Reductions to 1-matching polyhedra. Networks 13(4): 455-473 (1983) - 1981
- [j3]William H. Cunningham:
On matroid connectivity. J. Comb. Theory B 30(1): 94-99 (1981) - 1980
- [j2]Robert E. Bixby, William H. Cunningham:
Converting Linear Programs to Network Problems. Math. Oper. Res. 5(3): 321-357 (1980)
1970 – 1979
- 1976
- [j1]William H. Cunningham:
A network simplex method. Math. Program. 11(1): 105-116 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
