Skip to main content
Share Your Experience: Take the 2024 Developer Survey
M. kanté's user avatar
M. kanté's user avatar
M. kanté's user avatar
M. kanté
  • Member for 13 years, 1 month
  • Last seen more than 1 year ago
18 votes
Accepted

Modular Decomposition and Clique-width

10 votes
Accepted

Conclusions from reverse mathematical strength of graph minor theorem

8 votes
Accepted

Is counting simple cycles in $P$ for graphs of bounded tree width?

7 votes

Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second Order Logic?

6 votes

Problems in quasi-polynomial time that could conceivably be in P (without causing collapses or violating widely held beliefs)

5 votes

Fast treewidth algorithms

5 votes

What are graph grammars?

5 votes
Accepted

Complexity of Acyclic Hypergraph Isomorphism

4 votes

Maximum subgraph problem with unknown complexity

4 votes

Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees?

3 votes

Parameterized complexity of tree/branch decomposition

3 votes

Counting/Enumerating Minimal Edge Covers

3 votes
Accepted

Computing the union closure

2 votes

FPT algorithm for Partial k-tree Isomorphism

2 votes

checking isomorphism between K regular graph

1 vote

Gröbner bases in TCS?

1 vote

Finding All Cliques of an Undirected Graph

0 votes

Number of k-expressions of graph (clique Width)