Dr Sergey Kitaev

Reader

Computer and Information Sciences

Personal statement

I am a Reader in Combinatorics and the Director of Internationalisation in the Department of Computer and Information Sciences.

My research interests are in Combinatorics, Graph Theory, Discrete Analysis and Formal Languages.

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.  

Expertise

Has expertise in:

    • Discrete Mathematics
    • Enumerative Combinatorics
    • Bijective Combinatorics
    • Algebraic Combinatorics
    • Graph Theory
    • Discrete Analysis
    • Formal Languages

Prizes and awards

Most cited article published by the Journal of Combinatorial Theory, Series A
Recipient
2018
Global engagements fund grant of £1013
Recipient
2018
London Mathematical Society grant of £700
Recipient
2018
Strathclyde Teaching Excellence Award 2018
Recipient
2018
AMS most cited mathematician by the graduation year
Recipient
2018
EMS grant of £850 to support British Combinatorial Conference 2017
Recipient
2017

more prizes and awards

Publications

On k-11-representable graphs
Cheon Gi-Sang, Kim Jinha, Kim Minki, Kitaev Sergey, Pyatkin Artem
Journal of Combinatorics, pp. 1-19 (2018)
On a greedy algorithm to construct universal cycles for permutations
Gao Alice LL, Kitaev Sergey, Steiner Wolfgang, Zhang Philip B
International Journal of Foundations of Computer Science (2018)
On the representation number of a crown graph
Glen Marc, Kitaev Sergey, Pyatkin Artem
Discrete Applied Mathematics Vol 244, pp. 89-93 (2018)
https://doi.org/10.1016/j.dam.2018.03.013
Графы, представимые в виде слов : обзор результатов
Kitaev Sergey, Pyatkin Artem
Diskretnyi Analiz i Issledovanie Operatsii Vol 25, pp. 19-53 (2018)
https://doi.org/10.17377/daio.2018.25.588
On pattern avoiding indecomposable permutations
Gao Alice L L, Kitaev Sergey, Zhang Philip B
Integers: Electronic Journal of Combinatorial Number Theory Vol 18 (2018)
A note on p-Ascent Sequences
Kitaev Sergey, Remmel Jeffrey
Journal of Combinatorics Vol 8, pp. 487-506 (2017)
https://doi.org/10.4310/JOC.2017.v8.n3.a5

more publications

Teaching

  • Combinatorics
  • Graph Theory
  • Discrete Mathematics
  • Computability and Complexity
  • Algorithms
  • Business Analytics

Research interests

  • Combinatorics
  • Graph Theory
  • Discrete Analysis
  • Formal Languages 

Professional activities

13th International Conference on Language and Automata Theory and Applications
Participant
25/3/2019
Theoretical and Computational Discrete Mathematics (TCDM 2018)
Participant
14/9/2018
5th International Conference on Riordan Arrays and Related Topics (5 RART 2018)
Participant
25/6/2018
British Mathematical Colloquium 2018
Participant
11/6/2018
One-Day Meeting in Combinatorics, Sungkyunkwan University
Speaker
13/9/2017
A comprehensive introduction to the theory of word-representable graphs
Speaker
7/8/2017

more professional activities

Projects

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

more projects

Address

Computer and Information Sciences
Livingstone Tower

Location Map

View University of Strathclyde in a larger map