Bela Bollobas

Professor of Mathematics
Senior Fellow of Trinity College, Cambridge University, UK

Chair of Excellence in Combinatorics at the University of Memphis, USA

visiting scolar at
Microsoft in Redmond, USA and the Institute of Advanced Study in Princeton, USA

He did his undergraduate work in Budapest and Cambridge, and his doctorates are from these universities as well. In 1969, he left Hungary for England, and for over 25 years taught at Cambridge, where he had close to thirty research students.

Dr. Bollobas expertise includes graph theory, extremal and probabilistic combinatorics, partial orders, percolation, and isoperimetric inequalities. His mathematical taste was greatly influenced by the late Professor Paul Erdos, with whom he collaborated for over 35 years.

He has published close to 350 research papers* and several books.

He is the founder and Editor-in-Chief of the international journal Combinatorics, Probability and Computing, and he
serves on the editorial boards of seven other journals.

Nowadays, in addition to Memphis, he spends much time in Cambridge and Budapest, and he is a frequent visitor to Microsoft in Redmond and the Institute for Advanced Study in Princeton.

An interview in the Institute of Mathematics, Singapore

273. The degree sequence of a scale-free random graph process. Random
Structures Algorithms 18 (2001), 279-290. (with O. Riordan, J. Spencer,
and G. Tusnady)

259. Euler circuits and DNA sequencing by hybridization, Discrete Applied
Mathematics 104 (2000), 63-96 (with Richard Arratia, Don Coppersmith,
and Gregory B. Sorkin).