Miroslav Fiedler

1973–2009

A researcher in the Science corpus: 5 papers; trusts 1 researcher and is trusted by 8 researchers here, as inferred from the citation graph.

Whom Miroslav Fiedler trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Carl Dean Meyer
2. Jiri Rohn

Who trusts Miroslav Fiedler overall

1. Mark Newman
2. Wenwu Yu
3. Ulrike von Luxburg
4. Jure Leskovec
5. Santo Fortunato
6. Guanrong Chen
7. Reza Olfati-Saber
8. Leo Liberti
9. Aaron Clauset
10. Olga Sorkine-Hornung

Papers from Miroslav Fiedler's perspective

Ordered by how strongly the researchers Miroslav Fiedler trusts endorse each paper. Same corpus, a different order for every researcher.

1. Linear Programming and Extensions
2. Computing the norm ∥A∥∞,1 is NP-hard
3. HOW GOOD IS THE SIMPLEX ALGORITHM
4. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
5. Matrix Analysis and Applied Linear Algebra
6. accuracy and stability of numerical algorithms
7. Linked: The New Science of Networks
8. Deeper Inside PageRank
9. Searching the Web (ACM Trans. Internet Techn.)
10. The algebraic eigenvalue problem

Their papers

• Spectral radius and Hamiltonicity of graphs (2009) — 152 citations
• A note on companion matrices (2003) — 122 citations
• Linear Optimization Problems with Inexact Data (2006) — 346 citations
• Eigenvalues of Nonnegative Symmetric Matrices (1974)
• Algebraic connectivity of graphs (1973)