user avatar
user avatar
user avatar
Nathann Cohen
  • Member for 11 years, 11 months
  • Last seen more than 4 years ago
13 votes
Accepted

Are there good implementations for easy subclasses of NP-hard graph problems

12 votes
Accepted

Decompose a complete graph into smaller cliques

8 votes

Shortest paths disallowing each edge

8 votes
Accepted

Number of non-isomorphic connected graphs of $n$ nodes and $m$ edges

7 votes

Finding cliques in a big graph

7 votes

Bounds on sum of squares of node degrees in undirected graphs

6 votes

Smallest set that intersects some given sets

6 votes
Accepted

Does there exist polytime algorithm for this partitioning problem?

6 votes

LP relaxation of independent set

5 votes
Accepted

Generation of unlabeled acyclic digraphs

5 votes

Postselection in geometric complexity theory

5 votes

All pair shortest path problem for large number of nodes

4 votes

Exact algorithm for edge coloring

4 votes

Catalog of NP-complete problems, more up-to-date than Garey&Johnson?

3 votes

Any references for techniques in FPT reductions?

3 votes

Maximum-clique practical applications

3 votes

Fast treewidth algorithms

3 votes
Accepted

Approximate Maximum Weight Matching

2 votes

Implementations of Undirected Disjoint Paths

2 votes
Accepted

Longest path in Complete Directed Graphs

2 votes

Max-Flow and Graph Orientation:

2 votes

Finding the longest path between two nodes in a bidirectional unweighted graph

2 votes

What are the root difficulties in going from graphs to hypergraphs?

1 vote
Accepted

Data-structure for functions of independent sets

1 vote

Longest circuit in a directed graph

1 vote

Shortest Path Algorithm for large graph but short paths

0 votes

Finding maximum weight arborescence in an edge-weighted DAG