default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew D. King
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Kevin Chern, Kelly Boothby, Jack Raymond, Pau Farré, Andrew D. King:
Tutorial: calibration refinement in quantum annealing. Frontiers Comput. Sci. 5 (2023)- 2022
- [i17]Jack Raymond, Radomir Stevanovic, William Bernoudy, Kelly Boothby, Catherine C. McGeoch, Andrew J. Berkley, Pau Farré, Andrew D. King:
Hybrid quantum annealing for larger-than-QPU lattice-structured problems. CoRR abs/2202.03044 (2022) - 2020
- [c2]Jack Raymond
, Ndiamé Ndiaye, Gautam Rayaprolu, Andrew D. King:
Improving performance of logical qubits by parameter tuning and topology compensation. QCE 2020: 295-305
2010 – 2019
- 2019
- [i16]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, Michael Babcock, Catia Baron, Andrew J. Berkley, Kelly Boothby, Paul I. Bunyk, Holly Christiani, Colin Enderud, Bram Evert, Richard Harris, Emile Hoskinson, Shuiyuan Huang, Kais Jooya, Ali Khodabandelou, Nicolas Ladizinsky, Ryan Li, Paul Aaron Lott, Allison J. R. MacDonald, Danica Marsden, Gaelen Marsden, Teresa Medina, Reza Molavi, Richard Neufeld, Mana Norouzpour, Travis Oh, Igor Pavlov, Ilya Perminov, Thomas Prescott, Chris Rich, Yuki Sato, Benjamin Sheldan, George Sterling, Loren J. Swenson, Nicholas Tsai, Mark H. Volkmann, Jed D. Whittaker, Warren Wilkinson, Jason Yao, Hartmut Neven, Jeremy P. Hilton, Eric Ladizinsky, Mark W. Johnson, Mohammad H. Amin:
Scaling advantage in quantum simulation of geometrically frustrated magnets. CoRR abs/1911.03446 (2019) - 2018
- [i15]Andrew D. King, William Bernoudy, James King, Andrew J. Berkley, Trevor Lanting:
Emulating the coherent Ising machine with a mean-field algorithm. CoRR abs/1806.08422 (2018) - 2017
- [j24]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly Even-Cycle Decomposable Graphs. J. Graph Theory 84(2): 158-175 (2017) - 2016
- [j23]Andrew D. King, Bruce A. Reed:
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. J. Graph Theory 81(1): 30-34 (2016) - [j22]Tomas Boothby, Andrew D. King, Aidan Roy:
Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Inf. Process. 15(1): 495-508 (2016) - 2015
- [j21]Andrew D. King, Bruce A. Reed:
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ. J. Graph Theory 78(3): 157-194 (2015) - [c1]Adam Douglass, Andrew D. King, Jack Raymond:
Constructing SAT Filters with a Quantum Annealer. SAT 2015: 104-120 - [i14]Andrew D. King:
Performance of a quantum annealer on range-limited constraint satisfaction problems. CoRR abs/1502.02098 (2015) - [i13]Tomas Boothby, Andrew D. King, Aidan Roy:
Fast clique minor generation in Chimera qubit connectivity graphs. CoRR abs/1507.04774 (2015) - 2014
- [j20]Katherine Edwards, Andrew D. King:
A Superlocal Version of Reed's Conjecture. Electron. J. Comb. 21(4): 4 (2014) - [j19]Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca:
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169: 119-134 (2014) - [j18]Frédéric Havet, Andrew D. King:
List circular backbone colouring. Discret. Math. Theor. Comput. Sci. 16(1): 89-104 (2014) - [i12]Andrew D. King, Catherine C. McGeoch:
Algorithm engineering for a quantum annealing platform. CoRR abs/1410.2628 (2014) - 2013
- [j17]W. Sean Kennedy, Andrew D. King:
Finding a smallest odd hole in a claw-free graph using global structure. Discret. Appl. Math. 161(16-17): 2492-2498 (2013) - [j16]Andrew D. King, Bruce A. Reed:
Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory 73(3): 327-341 (2013) - [j15]Demetres Christofides, Katherine Edwards, Andrew D. King:
A Note on Hitting Maximum and Maximal Cliques With a Stable Set. J. Graph Theory 73(3): 354-360 (2013) - [j14]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. SIAM J. Discret. Math. 27(1): 95-108 (2013) - [j13]Katherine Edwards, Andrew D. King:
Bounding the Fractional Chromatic Number of KDelta-Free Graphs. SIAM J. Discret. Math. 27(2): 1184-1208 (2013) - 2012
- [j12]Andrew D. King, Linyuan Lu, Xing Peng:
A Fractional Analogue of Brooks' Theorem. SIAM J. Discret. Math. 26(2): 452-471 (2012) - [i11]Katherine Edwards, Andrew D. King:
Bounding the fractional chromatic number of KΔ-free graphs. CoRR abs/1206.2384 (2012) - [i10]Katherine Edwards, Andrew D. King:
A superlocal version of Reed's Conjecture. CoRR abs/1208.5188 (2012) - [i9]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly even cycle decomposable graphs. CoRR abs/1209.0160 (2012) - [i8]Andrew D. King, Bruce A. Reed:
A short proof that χ can be bounded ε away from Δ+1 towards ω. CoRR abs/1211.1410 (2012) - [i7]Andrew D. King, Bruce A. Reed:
Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$. CoRR abs/1212.3036 (2012) - 2011
- [j11]Tomás Kaiser, Andrew D. King, Daniel Král':
Fractional total colourings of graphs of high girth. J. Comb. Theory B 101(6): 383-402 (2011) - [j10]Andrew D. King:
Hitting all maximum cliques with a stable set using lopsided independent transversals. J. Graph Theory 67(4): 300-305 (2011) - [i6]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. CoRR abs/1102.0805 (2011) - [i5]W. Sean Kennedy, Andrew D. King:
Finding a smallest odd hole in a claw-free graph using global structure. CoRR abs/1103.6222 (2011) - [i4]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs. CoRR abs/1109.2112 (2011) - [i3]Demetres Christofides, Katherine Edwards, Andrew D. King:
A note on hitting maximum and maximal cliques with a stable set. CoRR abs/1109.3092 (2011) - [i2]Maria Chudnovsky, Andrew D. King:
Optimal antithickenings of claw-free trigraphs. CoRR abs/1110.5111 (2011) - 2010
- [j9]Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed:
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7): 765-770 (2010) - [j8]Louis Esperet, John Gimbel, Andrew D. King:
Covering line graphs with equivalence relations. Discret. Appl. Math. 158(17): 1902-1907 (2010) - [j7]Andrew D. King, Gary MacGillivray:
The firefighter problem for cubic graphs. Discret. Math. 310(3): 614-621 (2010)
2000 – 2009
- 2009
- [i1]Andrew D. King:
Hitting all maximum cliques with a stable set using lopsided independent transversals. CoRR abs/0911.1741 (2009) - 2008
- [j6]Andrew D. King, Bruce A. Reed:
Bounding chi in terms of omega and delta for quasi-line graphs. J. Graph Theory 59(3): 215-228 (2008) - 2007
- [j5]Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi:
The firefighter problem for graphs of maximum degree three. Discret. Math. 307(16): 2094-2105 (2007) - [j4]Andrew D. King, Bruce A. Reed, Adrian Vetta:
An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007) - [j3]Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs. Electron. Notes Discret. Math. 29: 327-331 (2007) - 2006
- [j2]Andrew D. King:
Generating indecomposable permutations. Discret. Math. 306(5): 508-518 (2006) - 2004
- [j1]Andrew D. King, Natasa Przulj, Igor Jurisica:
Protein complex prediction via cost-based clustering. Bioinform. 20(17): 3013-3020 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
