Theoretical Computer Science
Nathann Cohen
  • Member for 11 years, 2 months
  • Last seen more than 3 years ago
Profile Activity
Stats
1,431
reputation
28k
reached
27
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
7
bronze badges
Top tags
View all tags
63
Score
16
Posts
59
Posts %
62
Score
15
Posts
56
Posts %
44
Score
8
Posts
30
Posts %
23
Score
4
Posts
15
Posts %
15
Score
3
Posts
11
Posts %
15
Score
2
Posts
7
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
13
Are there good implementations for easy subclasses of NP-hard graph problems
Apr 21 '11
12
Decompose a complete graph into smaller cliques
Sep 7 '14
8
Shortest paths disallowing each edge
May 31 '11
8
Number of non-isomorphic connected graphs of $n$ nodes and $m$ edges
Apr 5 '11
7
Finding cliques in a big graph
May 2 '11
7
Bounds on sum of squares of node degrees in undirected graphs
May 4 '12
6
Smallest set that intersects some given sets
Oct 15 '12
6
Does there exist polytime algorithm for this partitioning problem?
May 7 '11
6
LP relaxation of independent set
Feb 27 '11
5
Generation of unlabeled acyclic digraphs
Feb 26 '11
Top network posts
View all network posts
16
Fast evaluation of polynomials
12
Constructing Steiner Triple Systems Algorithmically
10
A conjectured criterion for 4-colorable graphs
7
Families of subsets of $\{1,\dots,n\}$ with regular intersections
7
What is this operation on graphs called?

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.