My path to Paul Erdös:

1. Anderson, J.M.; Erdös, Paul; Pinkus, Allan; Shisha, Oved

The closed linear span of $\{x^k-c_k\}_1^{\infty}$.
J. Approximation Theory 43, 75-80 (1985).
Zentralblatt MATH review.
2. Elsner, Ludwig; Hershkowitz, Daniel; Pinkus, Allan

Functional inequalities for spectral radii of nonnegative matrices.
Linear Algebra Appl. 129, 103-130 (1990).
Zentralblatt MATH review.
3. Watkins, David S.; Elsner, Ludwig

Theory of decomposition and bulge-chasing algorithms for the generalized eigenvalue problem.
SIAM J. Matrix Anal. Appl. 15, No.3, 943-967 (1994).
Zentralblatt MATH review.
4. Benner, Peter; Faßbender, Heike; Watkins, David S.

Two connections between the $SR$ and $HR$ eigenvalue algorithms.
Linear Algebra Appl. 272, 17-32 (1998).
Zentralblatt MATH review.

1. Erdös, Paul; Fajtlowicz, Siemion; Hoffman, Alan J.

Maximum degree in graphs of diameter 2.
Networks 10, 87-90 (1980).
Zentralblatt MATH review.
2. Hoffman, Alan J.; Varga, Richard S.

Patterns of dependence in generalizations of Gerschgorin's theorem.
SIAM J. Numer. Anal. 7, 571-574 (1970).
Zentralblatt MATH review.
3. Varga, Richard S.; Saff, E.B.; Mehrmann, Volker

Incomplete factorizations of matrices and connections with H-matrices.
SIAM J. Numer. Anal. 17, 787-793 (1980).
Zentralblatt MATH review.
4. Benner, Peter; Mehrmann, Volker; Xu, Hongguo

A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils.
Numer. Math. 78, No.3, 329-358 (1998).
Zentralblatt MATH review.