Protein complex prediction via cost-based clustering. - Andrew D. King; Natasa Przulj; Igor Jurisica (Bioinform., 2004)

Generating indecomposable permutations. - Andrew D. King (Discret. Math., 2006)

The firefighter problem for graphs of maximum degree three. - Stephen Finbow; Andrew D. King; Gary MacGillivray; Romeo Rizzi (Discret. Math., 2007)

An upper bound for the chromatic number of line graphs. - Andrew D. King; Bruce A. Reed; Adrian Vetta (Eur. J. Comb., 2007)

Bounding chi in terms of omega and delta for quasi-line graphs. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2008)

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. - Louigi Addario-Berry; W. Sean Kennedy; Andrew D. King; Zhentao Li; Bruce A. Reed (Discret. Appl. Math., 2010)

Covering line graphs with equivalence relations. - Louis Esperet; John Gimbel; Andrew D. King (Discret. Appl. Math., 2010)

The firefighter problem for cubic graphs. - Andrew D. King; Gary MacGillivray (Discret. Math., 2010)

A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs - Maria Chudnovsky; Andrew D. King; Matthieu Plumettaz; Paul D. Seymour (CoRR, 2011)

Optimal antithickenings of claw-free trigraphs - Maria Chudnovsky; Andrew D. King (CoRR, 2011)

Fractional total colourings of graphs of high girth. - Tomás Kaiser; Andrew D. King; Daniel Král' (J. Comb. Theory B, 2011)

Hitting all maximum cliques with a stable set using lopsided independent transversals. - Andrew D. King (J. Graph Theory, 2011)

Bounding the fractional chromatic number of KΔ-free graphs - Katherine Edwards; Andrew D. King (CoRR, 2012)

A short proof that χ can be bounded ε away from Δ+1 towards ω - Andrew D. King; Bruce A. Reed (CoRR, 2012)

A Fractional Analogue of Brooks' Theorem. - Andrew D. King; Linyuan Lu; Xing Peng (SIAM J. Discret. Math., 2012)

Finding a smallest odd hole in a claw-free graph using global structure. - W. Sean Kennedy; Andrew D. King (Discret. Appl. Math., 2013)

A Note on Hitting Maximum and Maximal Cliques With a Stable Set. - Demetres Christofides; Katherine Edwards; Andrew D. King (J. Graph Theory, 2013)

Asymptotics of the Chromatic Number for Quasi-Line Graphs. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2013)

A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. - Maria Chudnovsky; Andrew D. King; Matthieu Plumettaz; Paul D. Seymour (SIAM J. Discret. Math., 2013)

Bounding the Fractional Chromatic Number of KDelta-Free Graphs. - Katherine Edwards; Andrew D. King (SIAM J. Discret. Math., 2013)

A Superlocal Version of Reed's Conjecture. - Katherine Edwards; Andrew D. King (Electron. J. Comb., 2014)

Algorithm engineering for a quantum annealing platform. - Andrew D. King; Catherine C. McGeoch (CoRR, 2014)

(Circular) backbone colouring: Forest backbones in planar graphs. - Frédéric Havet; Andrew D. King; Mathieu Liedloff; Ioan Todinca (Discret. Appl. Math., 2014)

List circular backbone colouring. - Frédéric Havet; Andrew D. King (Discret. Math. Theor. Comput. Sci., 2014)

Constructing SAT Filters with a Quantum Annealer. - Adam Douglass; Andrew D. King; Jack Raymond (SAT, 2015)

Performance of a quantum annealer on range-limited constraint satisfaction problems. - Andrew D. King (CoRR, 2015)

Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2015)

A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. - Andrew D. King; Bruce A. Reed (J. Graph Theory, 2016)

Fast clique minor generation in Chimera qubit connectivity graphs. - Tomas Boothby; Andrew D. King; Aidan Roy (Quantum Inf. Process., 2016)

Strongly Even-Cycle Decomposable Graphs. - Tony Huynh; Andrew D. King; Sang-il Oum; Maryam Verdian-Rizi (J. Graph Theory, 2017)

Emulating the coherent Ising machine with a mean-field algorithm. - Andrew D. King; William Bernoudy; James King; Andrew J. Berkley; Trevor Lanting (CoRR, 2018)

Scaling advantage in quantum simulation of geometrically frustrated magnets. - Andrew D. King; Jack Raymond; Trevor Lanting; Sergei V. Isakov; Masoud Mohseni; Gabriel Poulin-Lamarre; Sara Ejtemaee; William Bernoudy; Isil Ozfidan; Anatoly Yu. Smirnov; Mauricio Reis; Fabio Altomare; et al. (CoRR, 2019)

Improving performance of logical qubits by parameter tuning and topology compensation. - Jack Raymond; Ndiamé Ndiaye; Gautam Rayaprolu; Andrew D. King (QCE, 2020)

Hybrid quantum annealing for larger-than-QPU lattice-structured problems. - Jack Raymond; Radomir Stevanovic; William Bernoudy; Kelly Boothby; Catherine C. McGeoch; Andrew J. Berkley; Pau Farré; Andrew D. King (CoRR, 2022)

Tutorial: calibration refinement in quantum annealing. - Kevin Chern; Kelly Boothby; Jack Raymond; Pau Farré; Andrew D. King (Frontiers Comput. Sci., 2023)

Blockchain with proof of quantum work. - Mohammad H. Amin; Jack Raymond; Daniel Kinn; Firas Hamze; Kelsey Hamer; Joel Pasvolsky; William Bernoudy; Andrew D. King; Samuel Kortas (CoRR, 2025)