Dr. Standa Živný

Biography

Standa Živný is a Professor and Fellow Tutor at Merton College, University of Oxford, specializing in theoretical computer science and discrete mathematics. His research interests focus on algorithms, computational complexity, and homomorphism problems, particularly at the intersection of mathematical structures and constraint satisfaction problems (CSPs). He has explored various computational issues, including linear programming problems, combinatorial optimization, and counting homomorphism problems, contributing significant publications that address these challenges. He supervises students with strong backgrounds in theoretical computer science and is actively involved in academic service, including leadership roles within the department and organizing seminars on algorithms and complexity. Standa has been awarded several grants, including ERC grants for his innovative research in approximability and satisfiability problems. With a commitment to teaching and mentoring, he has supervised numerous students and served on various committees, reflecting his dedication to advancing the fields of computer science and mathematics.

Research Interests

Experience