… Neil Robertson studied chemistry at the University of Edinburgh and obtained his PhD there
in 1992. He then carried out postdoctoral work at the Freie Universität Berlin and University …

We introduce an invariant of graphs called the tree-width, and use it to obtain a polynomially
bounded algorithm to test if a graph has a subgraph contractible to H, where H is any fixed …

… Neil Robertson Neil Robertson studied chemistry at The University of Edinburgh then
undertook postdoctoral work at the Freie Universität Berlin and University of Wales Bangor where …

By combining genome-wide association data from 8,130 individuals with type 2 diabetes (T2D)
and 38,987 controls of European descent and following up previously unidentified meta-…

Background: High-quality epidemiologic data worldwide are needed to improve our
understanding of disease risk, support health policy to meet the diverse needs of people with …

Most common human traits and diseases have a polygenic pattern of inheritance: DNA
sequence variants at many genetic loci influence the phenotype. Genome-wide association (GWA…

We expanded GWAS discovery for type 2 diabetes (T2D) by combining data from 898,130
European-descent individuals (9% cases), after imputation to high-density reference panels. …

We describe an algorithm, which for fixed k≥ 0 has running time O (| V (G)| 3), to solve the
following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually …

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the
size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an …

Using the ImmunoChip custom genotyping array, we analyzed 14,498 subjects with multiple
sclerosis and 24,091 healthy controls for 161,311 autosomal variants and identified 135 …