About
Dr Viktor Zamaraev is a researcher at Durham University specializing in theoretical computer science and graph theory. His work focuses on implicit graph representations, adjacency labeling schemes, and algorithmic complexity.
- Probabilistic Universal Graphs (ICMS Grant, April 2023)
- Decomposition Techniques for Graphs with Bounded Width (Royal Society, 2023-2025)
He co-ordinates the MEng Group Project (COMP591) and MSc Group Project (COMP530), emphasizing practical applications of his theoretical research. His recent publications explore temporal networks, graph complementation, and optimization via linear programming.
Dr Zamaraev’s research spans adjacency labeling schemes, computational complexity, and graph algorithms, with contributions to understanding lower bounds and optimal representations for small graph classes. He actively collaborates with institutions like the International Centre for Mathematical Sciences and the Royal Society.
