We present an upgraded version (denoted as version 2.0) of the program HELAC-Onia for the automated computation of heavy-quarkonium helicity amplitudes within non-relativistic QCD...
We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen ...
Colin Cooper, Alan M. Frieze, Nate Ince, Svante Ja...
This paper addresses the following question for a given graph H: what is the minimum number f(H) such that every graph with average degree at least f(H) contains H as a minor? Due...