user avatar
user avatar
user avatar
Andrew D. King
  • Member for 11 years, 9 months
  • Last seen more than a week ago
8 votes
Accepted

Is it enough to sort for polynomially many 0-1 sequences for a sorting network?

3 votes
Accepted

Max-cut equivalence with most likely assignment to an Ising model

5 votes
Accepted

Finding balanced disjoint cycles in bridgeless cubic graphs

5 votes
Accepted

How to find the first $k$ points of high enough level using a priority search tree?

14 votes

NP-hard problems on trees

6 votes
Accepted

Decomposition by Clique Separators

5 votes

Approximate graph colouring with a promised upper bound on maximum independent set

2 votes

Maximum-clique practical applications

11 votes
Accepted

Any relation between the size of maximum independent set and the chromatic number on graph of bounded degree?

11 votes

Conjectures implying Four Color Theorem

4 votes
Accepted

Given a network flow, are there bounds on the change in weight on nodes?

10 votes

Is feedback vertex set problem is solvable in polynomial time for some special graph

4 votes
Accepted

Combinatorial Independent set Algorithms for sub-classes of perfect graphs

2 votes

Minimum maximal solutions of LPs

1 vote

Sorting array of distances by proximity to each other

4 votes

Is there a direct/natural reduction to count non-bipartite perfect matchings using the permanent?