Theoretical Computer Science
Profile Activity
Meta user
Network profile
935
reputation
6
13

Standa Zivny

I'm a faculty at Oxford's Department of Computer Science. My research is in the area of algorithms and computational complexity. In particular, I work on convex relaxations, discrete optimisation, and complexity of constraint satisfaction problems.

5
answers
2
questions
~6k
people reached

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

Top tags (16)

Score 34
Posts 3
Posts % 43
Score 34
Posts 1
Score 26
Posts 3
Score 17
Posts 2
Score 12
Posts 2
Score 12
Posts 1
View all tags →

Top posts (7)

All Questions Answers
Votes Newest
34 Which SAT problems are easy? Jan 18 '11
13 Classes of graphs with easy Hamiltonian cycle but NP-hard TSP Dec 7 '10
12 Maximal classes for which largest independent set can be found in polynomial time? Oct 27 '10
9 Is Max-Cut APX-complete on triangle-free graphs? Oct 16 '11
9 Submodular functions: reference request Aug 10 '11
8 Counting avoiding improper 3-colorings Aug 29 '19
5 What relation is between constraint satisfaction problems and constraint programming? Dec 9 '10

Badges (19)

Gold

—

Silver

6

Rarest

Bronze

13

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.