The Stack Overflow podcast is back! Listen to an interview with our new CEO.

Profile Activity

M. kanté

Network profile

Reputation

906

916
623
331

2016
2017
2018
2019

Top tag

graph-algorithms

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

6

9

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

8 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Answers (15)

Votes Activity Newest

18	Modular Decomposition and Clique-width
10	Conclusions from reverse mathematical strength of graph minor theorem
8	Is counting simple cycles in $P$ for graphs of bounded tree width?
7	Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic?
5	Problems in quasi-polynomial time that could conceivably be in P (without causing collapses or violating widely held beliefs)

View more →

Reputation (906)

This user has no recent positive reputation changes

View more →

Questions (0)

Votes Activity Newest

This user has not asked any questions

Tags (23)

44 graph-algorithms × 9	13 treewidth × 3
35 graph-theory × 7	11 reference-request × 3
18 cc.complexity-theory × 4	11 counting-complexity × 2
18 cliquewidth × 2	8 time-complexity
17 lo.logic × 2	7 ds.algorithms × 2

View more →

Accounts (2)

	Theoretical Computer Science	906 rep	6 silver badges9 bronze badges
	Computer Science	101 rep

Badges (8)

Recent Class Name

Yearling × 4	Commentator
Enlightened × 2	Supporter
Nice Answer × 2	Critic
Caucus × 3	Teacher

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (8)

all time			by type
3	up		3	question
5	down		5	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled