Results from the 2022 Developer Survey are now available
Theoretical Computer Science
user avatar
user avatar
user avatar
Juho
  • Member for 11 years
  • Last seen more than a month ago
Profile Activity
Stats
3,160
reputation
95k
reached
29
answers
11
questions
Communities
View all
About

A student.

Badges
View all badges
2
gold badges
25
silver badges
35
bronze badges
Top tags
View all tags
65
Score
16
Posts
40
Posts %
53
Score
9
Posts
22
Posts %
48
Score
5
Posts
12
Posts %
39
Score
10
Posts
25
Posts %
28
Score
5
Posts
12
Posts %
27
Score
8
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
25
NP-hard problems on paths
Feb 4, 2014
question
19
What separates easy global problems from hard global problems on graphs of bounded treewidth?
Sep 24, 2014
answer
14
What are good approximation algorithms for the subset sum problem so far?
Mar 1, 2012
question
13
Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?
Jun 9, 2015
question
13
Gentle introduction to the algorithmic aspects of tree-depth
Jul 7, 2015
question
12
Graph classes for which the diameter can be computed in linear time
Jun 30, 2013
answer
11
Finding number of cycles of length $k$ in a graph
Oct 24, 2013
answer
10
Graphs in which all shortest paths are unique
May 16, 2013
answer
9
How do the state-of-the-art pathfinding algorithms for changing graphs (D*, D*-Lite, LPA*, etc) differ?
Jun 28, 2012
answer
9
Shortest Equivalent CNF Formula
Jan 22, 2012
Top network posts
View all network posts
73
How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect
34
Is there a name for the class of algorithms that are the most efficient for a particular task?
34
How to measure "sortedness"
29
Has there been a computer search for a 5-chromatic unit distance graph?
29
Is there a reason to spread your research into multiple journals instead of just one?

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.