Keynote Speaker

 

Gregory Gutin

 Royal Holloway, University of London, UK 

Talk Title:  The Workflow Satisfiability Problem with User-Independent Constraints

Abstract: The  Workflow Satisfiability Problem (WSP) is a problem of interest in access control of information security. In its simplest form, the problem coincides with the Constraint Satisfiability Problem, where the number of variables is usually much smaller than the number of values. Wang and Li (2010) were the first to study the WSP as a problem parameterized by the number of variables. This paper initiated very fruitful research surveyed by Cohen, Crampton, Gutin and Wahlstr{\"{o}}m (2017). In this talk we will briefly overview some more recent WSP algorithmic developments. 

Bio: Gregory Gutin's areas of interest include graph theory, algorithms and applications, parameterized, exact and approximation algorithms, and access control in information security. In 1993, he was awarded PhD in Mathematics from Tel Aviv University, where he was supervised by Prof Noga Alon. After postdoctoral research at University of Southern Denmark, he became a lecturer (Assistant Prof) at Dept of Mathematics, Brunel University London in 1996 and Professor at Dept of Computer Science, Royal Holloway, University of London in 2000. His awards include Kirkman Medal of International Institute of Combinatorics and Applications (1996) and Royal Society Wolfson Research Merit Award (2014). He was elected Member of Academia Europaea in 2017. He published a monograph on directed graphs (1st ed 2000, 2nd ed 2009) which appeared in Chinese in 2009, and more than 230 papers in journals and conferences.