Theoretical Computer Science
Meta user
Network profile
906
reputation
6
9

M. kanté

Apparently, this user prefers to keep an air of mystery about them.

15
answers
0
questions
~5k
people reached
  • Clermont-Ferrand, France
  • isima.fr/~kante
  • Member for 8 years, 3 months
  • 139 profile views
  • Last seen Jul 16 at 10:35

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

Top tags (23)

Score 44
Posts 9
Posts % 60
Score 35
Posts 7
Score 18
Posts 4
Score 18
Posts 2
Score 17
Posts 2
Score 13
Posts 3
View all tags →

Top posts (15) 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
7 Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic? Feb 21 '18
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 What are graph grammars? Oct 30 '17
4 Complexity of Acyclic Hypergraph Isomorphism Dec 14 '18
3 Counting/Enumerating Minimal Edge Covers Nov 6 '18
3 Computing the union closure Nov 13 '12
View all questions and answers →

Badges (15)

Gold

—

Silver

6

Rarest

Bronze

9

Rarest

View all badges →