user avatar
user avatar
user avatar
Marcus Ritt
  • Member for 11 years, 7 months
  • Last seen more than a month ago
  • Porto Alegre, Brazil
17 votes
Accepted

How hard is counting the number of vertex covers after a small perturbation?

15 votes

NEXP-complete problems

10 votes

Finding cliques in a big graph

7 votes

Funny TCS-related papers etc?

7 votes

Models of random graphs, for real computer networks

7 votes
Accepted

Exercises of polynomial and turing reductions

6 votes

Feynman and the logarithm

6 votes

P with integer factorization oracle

5 votes
Accepted

Kernighan–Lin algorithm and multiple gain functions

5 votes
Accepted

Functional Sparse-Matrix with good performance?

5 votes
Accepted

Finding the longest path between two nodes in a bidirectional unweighted graph

5 votes

Co-NP-completeness of minimal TSP tour?

4 votes

Difference between Multiple Knapsack problem and Multidimensional Knapsack Problem

4 votes

What is the "right" definition of upper and lower bounds?

4 votes
Accepted

Is there a local variant of TSP?

4 votes
Accepted

Applications and benchmarks for binary quadratic program algorithms

3 votes

What videos should everybody watch?

2 votes

Are there problems without efficient algorithms, where existence theorems have proved such algorithms must exist?

2 votes

graphs from real-life problems

2 votes

Shortest paths with structured dependence on earlier path

2 votes

Packing rectangles into convex polygons but without rotations