Standa Zivny

Standa Živný

Professor of Computer Science
Tutorial Fellow at Jesus College
University of Oxford

Email: standa • zivny @ cs • ox • ac • uk
Phone: +44 (0)1865 610724


RESEARCH

I am interested in algorithms and computational complexity, particularly in convex relaxations, discrete and combinatorial optimisation, graph homomorphisms, and submodularity. Most of my work lies at the intersection of the above, namely it is on constraint satisfaction problems (CSP) in its many forms (approximation, counting, decision, optimisation, promise).

From the available courses in Oxford's Department of Computer Science, the relevant courses are Computational Complexity and Probability and Computing (I used to lecture the latter).

Get in touch if you are interested in doing an undergraduate project, a master dissertation, or a PhD in algorithms, discrete mathematics, or computational complexity. I'm happy to supervise students with a strong background in theoretical computer science and/or (any branch of) mathematics.

I currently serve, among many other roles, as the Director of Teaching.

All my publications are available online. My CV is available here.


GRANTS


SERVICE

Conferences Programme Committees

Journal Editorial

Organiser

Other


SUPERVISION AND MENTORING

PhD Students

Postdocs

BSc and MSc Students

Research Internships

College Lecturers


TEACHING

Lectures

Classes

Tutorials


Trivia

My official first name is Stanislav but I go by Standa /'stʌn.da/, which is a commonly used Czech variant/diminutive of Stanislav.

My last name Živný /'ʒiv.ni:/ has two diacritics called the caron and acute accent respectively; this can be achieved in LaTeX by \v{Z}ivn\'{y}.

For various reasons I try to minimise travel but you can always visit me (virtually) in Oxford.