Gregory Gutin | |
---|---|
Born | 17 January 1957 |
Citizenship | British and Israeli |
Alma mater | Tel Aviv University |
Scientific career | |
Fields | Theoretical Computer Science and Mathematics |
Institutions | Brunel University London Royal Holloway University of London |
Doctoral advisor | Noga Alon |
Doctoral students | Eun Jung Kim |
Gregory Z. Gutin (born 17 January 1957) is a scholar in theoretical computer science and discrete mathematics. He received his PhD in Mathematics in 1993 from Tel Aviv University under the supervision of Noga Alon. Since September 2000 Gutin has been Professor in Computer Science at Royal Holloway, University of London.
Gutin's research interests are in algorithms and complexity, access control, graph theory and combinatorial optimization.
Publications
- Gutin, G.; Punnen, A. P. (May 2006). The Traveling Salesman Problem and Its Variations. Springer. ISBN 978-0-306-48213-7.
- Bang-Jensen, Jørgen; Gutin, Gregory Z. (December 2008). Digraphs: Theory, Algorithms and Applications. Springer. ISBN 978-1-84800-998-1.
- Bang-Jensen, J.; Gutin, G. (2018). Classes of Directed Graphs. Springer. ISBN 978-3-319-71840-8.
Awards and honours
Gutin was the recipient of the Royal Society Wolfson Research Merit Award in 2014,[1] and the best paper awards at SACMAT 2015,[2] 2016[3] and 2021.[4] In January 2017 there was a workshop celebrating Gutin's 60th birthday.[5] In 2017, he became a member of Academia Europaea.[6]
References
- ↑ "Gregory Gutin". Royal Society. Retrieved 10 July 2017.
- ↑ "Symposium on Access control Models and Technologies". Sacmat.org. Retrieved 10 July 2017.
- ↑ "Symposium on Access control Models and Technologies". Sacmat.org. Retrieved 10 July 2017.
- ↑ "Symposium on Access control Models and Technologies". Sacmat.org. Retrieved 21 March 2022.
- ↑ "Gregory Gutin's 60th Birthday ConferenceGregory Gutin's 60th Birthday Conference | January 7th & 8th 2017". Gutin60.ma.rhul.ac.uk. 8 January 2017. Retrieved 10 July 2017.
- ↑ "G. Gutin's Academia Europaea webpage".
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.