# Computing My Erdős Number

One of the things that academics due to waste time is figure out how many degrees of seperation there are between them and the famous (and very prolific) mathematician Paul Erdős, where each degree is "published a paper with". This is their Erdős number, which is analagous to the Six Degrees of Kevin Bacon game, except the people are a lot more boring and a lot less attractive (except me, of course, being both handsome and exciting!) So to pitch in my contribution, here's how I compute my Erdős number of**four**.

- Paul Erdős published a paper with Foong Frances Yao.

Minimal decompositions of two graphs into pairwise isomorphic subgraphs.

*Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing*

(Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 3--18, Congress. Numer., XXIII--XXIV, Utilitas Math., Winnipeg, Man., 1979.

- Foong Frances Yao published a paper with David Dobkin

Partitioning Space for Range Queries*SIAM Journal On Computing*.

Volume 18, Issue 2 (April 1989) pp. 371 -- 384.

- David Dobkin published a paper with Szymon Rusinkiewicz

A Reflective Symmetry Descriptor for 3D Models

*Algorithmica*

Vol. 38, No. 1, Oct. 2003.

- Szymon Ruskinkiewicz published a paper with me

Pose-independent Simplification of Articulated Meshes

*Symposium on Interactive 3D Graphics (I3D)*, 2005.