Andrew D. King

Orcid: 0000-0001-8362-8941

According to our database1, Andrew D. King authored at least 35 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Tutorial: calibration refinement in quantum annealing.
Frontiers Comput. Sci., 2023

2022
Hybrid quantum annealing for larger-than-QPU lattice-structured problems.
CoRR, 2022

2020
Improving performance of logical qubits by parameter tuning and topology compensation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

2019
Scaling advantage in quantum simulation of geometrically frustrated magnets.
CoRR, 2019

2018
Emulating the coherent Ising machine with a mean-field algorithm.
CoRR, 2018

2017
Strongly Even-Cycle Decomposable Graphs.
J. Graph Theory, 2017

2016
Fast clique minor generation in Chimera qubit connectivity graphs.
Quantum Inf. Process., 2016

A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω.
J. Graph Theory, 2016

2015
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ.
J. Graph Theory, 2015

Performance of a quantum annealer on range-limited constraint satisfaction problems.
CoRR, 2015

Constructing SAT Filters with a Quantum Annealer.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

2014
List circular backbone colouring.
Discret. Math. Theor. Comput. Sci., 2014

(Circular) backbone colouring: Forest backbones in planar graphs.
Discret. Appl. Math., 2014

Algorithm engineering for a quantum annealing platform.
CoRR, 2014

A Superlocal Version of Reed's Conjecture.
Electron. J. Comb., 2014

2013
Bounding the Fractional Chromatic Number of K<sub>Delta</sub>-Free Graphs.
SIAM J. Discret. Math., 2013

A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.
SIAM J. Discret. Math., 2013

A Note on Hitting Maximum and Maximal Cliques With a Stable Set.
J. Graph Theory, 2013

Finding a smallest odd hole in a claw-free graph using global structure.
Discret. Appl. Math., 2013

2012
A Fractional Analogue of Brooks' Theorem.
SIAM J. Discret. Math., 2012

A short proof that χ can be bounded ε away from Δ+1 towards ω
CoRR, 2012

Bounding the fractional chromatic number of K<sub>Δ</sub>-free graphs
CoRR, 2012

2011
Hitting all maximum cliques with a stable set using lopsided independent transversals.
J. Graph Theory, 2011

Fractional total colourings of graphs of high girth.
J. Comb. Theory, Ser. B, 2011

Optimal antithickenings of claw-free trigraphs
CoRR, 2011

A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs
CoRR, 2011

2010
The firefighter problem for cubic graphs.
Discret. Math., 2010

Covering line graphs with equivalence relations.
Discret. Appl. Math., 2010

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph.
Discret. Appl. Math., 2010

2008
Bounding chi in terms of omega and delta for quasi-line graphs.
J. Graph Theory, 2008

2007
Asymptotics of the chromatic number for quasi-line graphs.
Electron. Notes Discret. Math., 2007

An upper bound for the chromatic number of line graphs.
Eur. J. Comb., 2007

The firefighter problem for graphs of maximum degree three.
Discret. Math., 2007

2006
Generating indecomposable permutations.
Discret. Math., 2006

2004
Protein complex prediction via cost-based clustering.
Bioinform., 2004


  Loading...