# Jack Edmonds

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

- IEEE Conference on Computer Vision and Patternâ€¦
- 2016

We present recursive recurrent neural networks with attention modeling (R2AM) for lexicon-free optical character recognition inâ€¦Â (More)

Is this relevant?

2010

2010

- Graphs and Combinatorics
- 2010

KÃ¶nig-EgervÃ¡ry graphs are those whose maximum matchings are equicardinal to their minimumorder coverings by vertices. Edmonds [Jâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

Combinatorial optimization searches for an optimum object in a finite collection of objects. Typically, the collection has aâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

A strong stable set in a graph G is a stable set that contains a vertex of every maximal clique of G. A Meyniel obstruction is anâ€¦Â (More)

Is this relevant?

2003

2003

- Lecture Notes in Computer Science
- 2003

properties of linear independence. Beautiful paper. And various people had gone on studying the properties of these algebraicâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Real Time Technology and Applicationsâ€¦
- 2003

The use of feedback control theory for performance guarantees in QoS-aware systems has gained much attention in recent years. Inâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- FAST
- 2002

Modern computer systems are expected to be up continuously: even planned downtime to accomplish system reconfiguration isâ€¦Â (More)

Is this relevant?

2002

2002

Does Fund Size Erode Performance? Liquidity, Organizational Diseconomies and Active Money Management

- 2002

We investigate the effect of fund size on performance among active mutual funds. We first document that fund returns, both beforeâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 2001

â€œJack Edmonds has been one of the creators of the field of combinatorial optimization and polyhedral combinatorics. His 1965â€¦Â (More)

Is this relevant?

1973

1973

- Discrete Mathematics
- 1973

Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalitiesâ€¦Â (More)

Is this relevant?