A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Mathematics of Operations Research, Vol. 41, No. 1 (February 2016), pp. 146-173 (28 pages) This paper investigates the problem of maximizing expected terminal utility in a (generically incomplete) ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...