Skip to main content
Juho's user avatar
Juho's user avatar
Juho's user avatar
Juho
  • Member for 12 years, 10 months
  • Last seen more than a month ago
25 votes

NP-hard problems on paths

14 votes
Accepted

What are good approximation algorithms for the subset sum problem so far?

11 votes
Accepted

Finding number of cycles of length $k$ in a graph

10 votes

Graphs in which all shortest paths are unique

9 votes

How do the state-of-the-art pathfinding algorithms for changing graphs (D*, D*-Lite, LPA*, etc) differ?

9 votes

Shortest Equivalent CNF Formula

8 votes

Parameterized complexity from P to NP-hard and back again

8 votes

Additive combinatorics applications in algorithm design

7 votes

Conceptually simple linear-time suffix tree constructions

7 votes

Is there any link between TCS and Sustainable Energy research?

7 votes
Accepted

Worst-case asymptotic-complexity of the Set-cover problem?

7 votes

Hardest problems to approximate

6 votes
Accepted

Number of permutations which have the same Kendall-Tau distance

6 votes

Optimal greedy algorithms for NP-hard problems

5 votes
Accepted

Analysis of Comb Sort?

5 votes

An algorithm for getting $n$ primes

5 votes
Accepted

Kolmogorov Complexity of an arbitrary string

4 votes

SAT algorithms not based on DPLL

4 votes

Minimum amount of colors preventing an equilateral uniformly colored subtriangle

4 votes
Accepted

Distribution of variable sized images/boxes(only aspect ratio given) on a 2D area

4 votes

Does a chordal graph where the size of minimal separators is constrained have name?

3 votes

Graph classes for which the diameter can be computed in linear time

3 votes
Accepted

is Facebook friendship graph connected?

3 votes
Accepted

Reference Request: complexity results on finding $(1+\epsilon) \log n$ size clique in $G(n,1/2)$

2 votes

Clique graph of bipartite graphs

2 votes

Cover Time of Directed Graphs

1 vote
Accepted

What is meant by "if there exists a $\rho$-approximation algorithm with $\rho < 2$, then P = NP"?

1 vote

Implications of a problem being in XP when parameterized by diameter

0 votes

Parametrized complexity of the 2-Long Paths Problem