Theoretical Computer Science
M. kanté
Profile Activity
Stats
996
reputation
8k
reached
17
answers
0
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

This user doesn’t have any gold badges yet.
6
silver badges
9
bronze badges
View all badges

Top tags (25)

Score 53
Posts 11
Posts % 65
Score 40
Posts 8
Score 22
Posts 5
Score 18
Posts 2
Score 17
Posts 4
Score 17
Posts 2
View all tags →

Top posts (17)

All Questions Answers
Votes Newest
18 Modular Decomposition and Clique-width Apr 27 '11
10 Conclusions from reverse mathematical strength of graph minor theorem Oct 30 '17
8 Is counting simple cycles in $P$ for graphs of bounded tree width? May 10 '19
7 Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic? Feb 21 '18
5 What are graph grammars? Oct 30 '17
5 Problems in quasi-polynomial time that could conceivably be in P (without causing collapses or violating widely held beliefs) Nov 18 '15
5 Fast treewidth algorithms Jul 30 '13
4 Complexity of Acyclic Hypergraph Isomorphism Dec 14 '18
4 Maximum subgraph problem with unknown complexity Dec 17 '19
4 Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees? Jan 21 '20
View all questions and answers →

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.