Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen
  • Member for 12 years
  • Last seen more than 4 years ago
12 votes
Accepted

Decompose a complete graph into smaller cliques

2 votes

Implementations of Undirected Disjoint Paths

3 votes
Accepted

Approximate Maximum Weight Matching

3 votes

Fast treewidth algorithms

6 votes

Smallest set that intersects some given sets

7 votes

Bounds on sum of squares of node degrees in undirected graphs

2 votes

Max-Flow and Graph Orientation:

5 votes

All pair shortest path problem for large number of nodes

3 votes

Maximum-clique practical applications

1 vote

Longest circuit in a directed graph

5 votes

Postselection in geometric complexity theory

2 votes
Accepted

Longest path in Complete Directed Graphs

1 vote

Shortest Path Algorithm for large graph but short paths

8 votes

Shortest paths disallowing each edge

4 votes

Exact algorithm for edge coloring

6 votes
Accepted

Does there exist polytime algorithm for this partitioning problem?

7 votes

Finding cliques in a big graph

13 votes
Accepted

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

2 votes

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

4 votes

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

8 votes
Accepted

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

2 votes

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

6 votes

LP relaxation of independent set

5 votes
Accepted

Generation of unlabeled acyclic digraphs

3 votes

Any references for techniques in FPT reductions?

0 votes

Finding maximum weight arborescence in an edge-weighted DAG

1 vote
Accepted

Data-structure for functions of independent sets