Professor Gonzalez was born in Monterrey, Mexico. He was one of the first set of students to receive a computer science undergraduate degree in Mexico. He has been a member of the faculty at OU, Penn State, and UT Dallas, and has spent sabbatical leave at the ITESM Monterrey (Mexico) and U. Utrecht (the Netherlands). He joined UCSB in 1984. His work is published in top CS journals and conferences, and he is the editor of handbooks, journals and numerous conference proceedings.
The main research contributions of Professor Gonzalez include the development of exact and approximation algorithms, and establishing complexity results for a wide range of problems arising in several different application areas. These problems include: message dissemination under the multicasting mode; scheduling structured and parallel processor systems; component placement and wire routing; and problems arising in computational geometry, graphs, partitioning, clustering, covering, code minimization, compression, statistical testing, etc. He published the first set of in-approximability results, as well as numerous classical algorithms and techniques for solving clustering, scheduling, wire routing, computational geometry and graph problems.
Honors and Awards
CS Outstanding Faculty Teaching Award (1987, 1994, 2001)