I am a Reader in Combinatorics in the Department of Mathematics and Statistics. My research interests include, but are not limited to, Combinatorics, Graph Theory, Discrete Analysis, Formal Languages, Optimisation and Satellite Constellations.
Recent research has included studies in the theory of patterns in combinatorial structures and the theory of word-representable graphs. In paritcular, my book Patterns in Permutations and Words, published by Springer (EATCS monographs in Theoretical Computer Science book series) in 2011, is the first comprehensive source over results and trends in the fast-growing field of patterns in permutations and words. My other book Words and Graphs, published by Springer (EATCS monographs in Theoretical Computer Science book series) in 2015, is a comprehansive introduction to the theory of word-representable graphs that I pioneered alone, a field enjoying ever greater attention by other researchers, and with the ultimate goal of finding applications for analysis of algorithms on graphs and robot scheduling. Also, I'm involved in a project on optimal distribution of resources accross a city or a region, and in an investigation of manoeuvrable constellations of small satellites for responsive Earth observation.
See my personal page for more information.
- Graph Theory
- Discrete Analysis
- Formal Languages
- On k-11-representable graphs
- On partially ordered patterns of length 4 and 5 in permutations
- Uniform distribution of resources
- Enumerative Combinatorics and Applications (Journal)
- Peer reviewer
- Computational challenges in the theory of word-representable graphs
- Equidistributions on planar maps via involutions on description trees
More professional activities
- Riordan graphs
- Kitaev, Sergey (Principal Investigator)
- The theory of Riordan matrices is used to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The Riordan graphs are proved to have a number of interesting (fractal) properties, which can be useful in creating computer networks with certain desirable features, or in obtaining useful information when designing algorithms to compute values of graph invariants. The main focus of the project is study of structural and spectral properties of families of Riordan graphs obtained from infinite Riordan graphs.
- 22-Jan-2017 - 21-Jan-2019
- Global Engagements: Sergey Kitaev University of California, San Diego (UCSD)
- Kitaev, Sergey (Academic)
- The main goal of the proposal is to develop a formal agreement on cooperation between the Department of Mathematics at the UCSD and the Computer and Information Sciences Department at Strathclyde.
- 07-Jan-2014 - 06-Jan-2015
Mathematics and Statistics
View University of Strathclyde in a larger map