Skip to content
Research Fellows Directory

Stanislav Zivny

Dr Stanislav Zivny

Research Fellow


University of Oxford

Research summary

My research are is algorithms, discrete optimisation and generally theoretical computer science. I study classes of (mostly discrete) optimisation problems and their computational complexity. Some problems admit efficient algorithms (such as finding a shortest path from one city to another in a complicated network) whereas others do not (such as finding a cheapest tour around all European capitals). My goal is to shed light on the generic reasons for (in)tractability and establish the precise borderline between tractable and intractable problems. In order to do so, I study mathematical properties of discrete objects such as graphs, relations, and functions. Apart from answering mathematical questions concerning these objects which are interesting in their own right, any class of problems that admits an efficient algorithm can be used in practice.

Grants awarded

Optimisation of Separable Functions

Scheme: University Research Fellowship

Dates: Oct 2013 - Sep 2018

Value: £409,721.75