Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
M. kanté
  • Member for 11 years, 1 month
  • Last seen this week
Profile Activity
Stats
1,026
reputation
9k
reached
18
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
7
silver badges
10
bronze badges
Top tags
View all tags
53
Score
11
Posts
61
Posts %
40
Score
8
Posts
44
Posts %
22
Score
5
Posts
28
Posts %
20
Score
5
Posts
28
Posts %
18
Score
2
Posts
11
Posts %
17
Score
2
Posts
11
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
18
Modular Decomposition and Clique-width
Apr 27, 2011
answer
10
Conclusions from reverse mathematical strength of graph minor theorem
Oct 30, 2017
answer
8
Is counting simple cycles in $P$ for graphs of bounded tree width?
May 10, 2019
answer
7
Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic?
Feb 21, 2018
answer
5
What are graph grammars?
Oct 30, 2017
answer
5
Problems in quasi-polynomial time that could conceivably be in P (without causing collapses or violating widely held beliefs)
Nov 18, 2015
answer
5
Fast treewidth algorithms
Jul 30, 2013
answer
4
Complexity of Acyclic Hypergraph Isomorphism
Dec 14, 2018
answer
4
Maximum subgraph problem with unknown complexity
Dec 17, 2019
answer
4
Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees?
Jan 21, 2020

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.