Skip to main content
Theoretical Computer Science
someone's user avatar
someone's user avatar
someone's user avatar
someone
  • Member for 13 years, 10 months
  • Last seen more than 2 years ago
Profile Activity
Stats
1,424
reputation
30k
reached
12
answers
3
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
12
silver badges
19
bronze badges
Top tags
View all tags
44
Score
5
Posts
33
Posts %
35
Score
5
Posts
33
Posts %
33
Score
5
Posts
33
Posts %
23
Score
2
Posts
13
Posts %
18
Score
5
Posts
33
Posts %
17
Score
1
Posts
7
Posts %
Top posts
View all questions and answers
answer
20
Complexity of "is a graph a product"
Mar 30, 2012
question
17
Connectivity of graphs by edge and vertex removal
Dec 13, 2011
answer
17
Sorting algorithm, such that each element is compared $O(\log n)$ times, and doesn't depend on a sorting network
Oct 31, 2012
answer
16
Hard Problems for higher genus graphs
Sep 3, 2012
question
11
Inapproximability of multiterminal cut
Feb 15, 2012
answer
11
Powerful Algorithms too complex to implement
Jan 23, 2011
answer
9
Open access journals
Dec 18, 2011
answer
7
What is simplest polynomial algorithm for PLANARITY?
Jun 27, 2014
answer
6
Construction of graph embeddings with non-intersecting edges
Mar 7, 2011
answer
5
For a given algorithm with expected runtime M, does there exist (in theory) an algorithm with equivalent guaranteed runtime?
Sep 20, 2012
Top network posts
View all network posts
9
Numbering theorems with page numbers