Viktor Zamaraev

Viktor Zamaraev is a Lecturer in the Department of Computer Science at the University of Liverpool since 2019. Previous roles include Research Associate at Durham University (2017-2019), Research Fellow at the University of Warwick's Mathematics Institute (2014-2017), and concurrent appointments as Associate Professor at Higher School of Economics, Assistant Professor at Lobachevsky State University of Nizhni Novgorod, and Researcher at LATNA (2011-2014).

His educational background features:

• Ph.D. in Theoretical Computer Science from Lobachevsky State University of Nizhni Novgorod (2009-2012)
• M.Sc. in Applied Mathematics from Lobachevsky State University of Nizhni Novgorod (2003-2009)

Zamaraev specializes in theoretical computer science with concentrated expertise in discrete mathematics and graph theory. His research examines structural properties of graph classes, combinatorial optimization, and algorithmic complexity in network analysis, often bridging abstract theory with computational applications. He frequently investigates width parameters and extremal graph problems, evidenced by recurring invitations to major combinatorics and algorithms conferences.

His seminar engagement pattern since 2010 reveals consistent focus on graph algorithms across institutions like Oxford, Warwick, and Bristol, with notable invited presentations at the European Congress of Mathematics (2021) and International Conference on Network Analysis (2021).

No scientific awards are documented in the source material.

The text provides no details about student advising or research grants. His industry experience includes software design roles at Mera (2004-2007), Intel (2007-2008), and Auslogics Software (2009), suggesting early career industry-academia integration.

He was affiliated with the Laboratory of Algorithms and Technologies for Networks Analysis (LATNA) at Higher School of Economics from 2011 to 2014, where he contributed to Russia-based network analysis research before moving to UK institutions.