Theoretical Computer Science
Meta user
Network profile
690
reputation
5
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.

4
answers
2
questions
~5k
people reached
  • Oxford, United Kingdom
  • zivny.cz
  • Member for 8 years, 10 months
  • 140 profile views
  • Last seen May 8 '18 at 8:18

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

Top tags (15)

Score 32
Posts 3
Posts % 50
Score 32
Posts 1
Score 24
Posts 3
Score 12
Posts 2
Score 12
Posts 1
Score 12
Posts 1
View all tags →

Top posts (6) All Questions Answers | Votes Newest

32 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
8 Submodular functions: reference request Aug 10 '11
4 What relation is between constraint satisfaction problems and constraint programming? Dec 9 '10

Badges (18)

Gold

—

Silver

5

Rarest

Bronze

13

Rarest

View all badges →