default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack Edmonds 0001
Person information
- affiliation: University of Waterloo, Department of Combinatorics and Optimization, ON, Canada
Other persons with the same name
- Jack Edmonds 0002 — Santa Clara University, Department of Electrical and Computer Engineering, Santa Clara, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]Kathie Cameron
, Jack Edmonds:
A PPA parity theorem about trees in a bipartite graph. Discret. Appl. Math. 308: 107-110 (2022)- 2021
- [j22]Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu:
Understanding PPA-completeness. J. Comput. Syst. Sci. 115: 146-168 (2021)
2010 – 2019
- 2016
- [c8]Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu:
Understanding PPA-Completeness. CCC 2016: 23:1-23:25 - 2014
- [j21]Jack Edmonds, Laura Sanità:
Exponentiality of the exchange algorithm for finding another room-partitioning. Discret. Appl. Math. 164: 86-91 (2014) - 2010
- [j20]Jack Edmonds, Laura Sanità:
On Finding Another Room-Partitioning of the Vertices. Electron. Notes Discret. Math. 36: 1257-1264 (2010) - [j19]Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Sperner Oiks. Electron. Notes Discret. Math. 36: 1273-1280 (2010) - [j18]Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Scarf Oiks. Electron. Notes Discret. Math. 36: 1281-1288 (2010) - [j17]Jack Edmonds:
Euler Complexes (Oiks). Electron. Notes Discret. Math. 36: 1289-1293 (2010) - [p1]Jack Edmonds:
Matroid Partition. 50 Years of Integer Programming 2010: 199-217
2000 – 2009
- 2009
- [c7]Jack Edmonds:
Branching Systems. IWOCA 2009: 1 - 2008
- [j16]Kathie Cameron, Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph. Discret. Optim. 5(2): 290-292 (2008) - [j15]Jack Edmonds:
On Finding Another. Electron. Notes Discret. Math. 31: 181-182 (2008) - [c6]Jack Edmonds:
Euler Complexes. Bonn Workshop of Combinatorial Optimization 2008: 65-68 - 2005
- [j14]Kathie Cameron, Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly. Electron. Notes Discret. Math. 22: 553-556 (2005) - [i1]Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. CoRR abs/cs/0509023 (2005) - 2001
- [j13]Jack Edmonds:
Redundancy and Helly. Eur. J. Comb. 22(5): 679-685 (2001) - [c5]Jack Edmonds:
Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial Optimization 2001: 11-26 - [c4]Jack Edmonds, Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs. Combinatorial Optimization 2001: 27-30 - [c3]Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization 2001: 31-33
1990 – 1999
- 1999
- [c2]Kathie Cameron, Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes. SODA 1999: 872 - 1997
- [j12]Jack Edmonds, Monique Laurent, Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids. Discret. Math. 165-166: 219-226 (1997) - [j11]Kathie Cameron, Jack Edmonds:
Lambda composition. J. Graph Theory 26(1): 9-16 (1997) - 1992
- [j10]Kathie Cameron, Jack Edmonds:
Coflow polyhedra. Discret. Math. 101(1-3): 1-21 (1992) - 1990
- [c1]Kathie Cameron, Jack Edmonds:
Existentially Polytime Theorems. Polyhedral Combinatorics 1990: 83-100
1980 – 1989
- 1986
- [j9]Imre Bárány, Jack Edmonds, Laurence A. Wolsey:
Packing and covering a tree by subtrees. Comb. 6(3): 221-233 (1986) - 1985
- [j8]Julián Aráoz, Jack Edmonds:
A case of non-convergent dual changes in assignment problems. Discret. Appl. Math. 11(2): 95-102 (1985) - 1983
- [j7]Julián Aráoz, Jack Edmonds, Victor J. Griffin:
Polarities Given by Systems of Bilinear Inequalities. Math. Oper. Res. 8(1): 34-41 (1983) - [j6]Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki:
Reductions to 1-matching polyhedra. Networks 13(4): 455-473 (1983) - 1982
- [j5]Jack Edmonds, László Lovász, William R. Pulleyblank:
Brick decompositions and the matching rank of graphs. Comb. 2(3): 247-274 (1982) - [j4]Victor Griffin, Julián Aráoz, Jack Edmonds:
Polyhedral polarity defined by a general bilinear inequality. Math. Program. 23(1): 117-137 (1982)
1970 – 1979
- 1973
- [j3]Jack Edmonds, Ellis L. Johnson:
Matching, Euler tours and the Chinese postman. Math. Program. 5(1): 88-124 (1973) - 1972
- [j2]Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19(2): 248-264 (1972) - 1971
- [j1]Jack Edmonds:
Matroids and the greedy algorithm. Math. Program. 1(1): 127-136 (1971)
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-05-08 21:46 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:
