Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Andrew D. King
@article{DBLP:journals/fcomp/ChernBRFK23, author = {Kevin Chern and Kelly Boothby and Jack Raymond and Pau Farr{\'{e}} and Andrew D. King}, title = {Tutorial: calibration refinement in quantum annealing}, journal = {Frontiers Comput. Sci.}, volume = {5}, year = {2023}, url = {https://doi.org/10.3389/fcomp.2023.1238988}, doi = {10.3389/FCOMP.2023.1238988}, timestamp = {Wed, 03 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fcomp/ChernBRFK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-03044, author = {Jack Raymond and Radomir Stevanovic and William Bernoudy and Kelly Boothby and Catherine C. McGeoch and Andrew J. Berkley and Pau Farr{\'{e}} and Andrew D. King}, title = {Hybrid quantum annealing for larger-than-QPU lattice-structured problems}, journal = {CoRR}, volume = {abs/2202.03044}, year = {2022}, url = {https://arxiv.org/abs/2202.03044}, eprinttype = {arXiv}, eprint = {2202.03044}, timestamp = {Thu, 10 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-03044.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/qce/RaymondNRK20, author = {Jack Raymond and Ndiam{\'{e}} Ndiaye and Gautam Rayaprolu and Andrew D. King}, title = {Improving performance of logical qubits by parameter tuning and topology compensation}, booktitle = {{IEEE} International Conference on Quantum Computing and Engineering, {QCE} 2020, Denver, CO, USA, October 12-16, 2020}, pages = {295--305}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/QCE49297.2020.00044}, doi = {10.1109/QCE49297.2020.00044}, timestamp = {Mon, 20 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/qce/RaymondNRK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1911-03446, author = {Andrew D. King and Jack Raymond and Trevor Lanting and Sergei V. Isakov and Masoud Mohseni and Gabriel Poulin{-}Lamarre and Sara Ejtemaee and William Bernoudy and Isil Ozfidan and Anatoly Yu. Smirnov and Mauricio Reis and Fabio Altomare and Michael Babcock and Catia Baron and Andrew J. Berkley and Kelly Boothby and Paul I. Bunyk and Holly Christiani and Colin Enderud and Bram Evert and Richard Harris and Emile Hoskinson and Shuiyuan Huang and Kais Jooya and Ali Khodabandelou and Nicolas Ladizinsky and Ryan Li and Paul Aaron Lott and Allison J. R. MacDonald and Danica Marsden and Gaelen Marsden and Teresa Medina and Reza Molavi and Richard Neufeld and Mana Norouzpour and Travis Oh and Igor Pavlov and Ilya Perminov and Thomas Prescott and Chris Rich and Yuki Sato and Benjamin Sheldan and George Sterling and Loren J. Swenson and Nicholas Tsai and Mark H. Volkmann and Jed D. Whittaker and Warren Wilkinson and Jason Yao and Hartmut Neven and Jeremy P. Hilton and Eric Ladizinsky and Mark W. Johnson and Mohammad H. Amin}, title = {Scaling advantage in quantum simulation of geometrically frustrated magnets}, journal = {CoRR}, volume = {abs/1911.03446}, year = {2019}, url = {http://arxiv.org/abs/1911.03446}, eprinttype = {arXiv}, eprint = {1911.03446}, timestamp = {Wed, 08 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-03446.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-08422, author = {Andrew D. King and William Bernoudy and James King and Andrew J. Berkley and Trevor Lanting}, title = {Emulating the coherent Ising machine with a mean-field algorithm}, journal = {CoRR}, volume = {abs/1806.08422}, year = {2018}, url = {http://arxiv.org/abs/1806.08422}, eprinttype = {arXiv}, eprint = {1806.08422}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-08422.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HuynhKOV17, author = {Tony Huynh and Andrew D. King and Sang{-}il Oum and Maryam Verdian{-}Rizi}, title = {Strongly Even-Cycle Decomposable Graphs}, journal = {J. Graph Theory}, volume = {84}, number = {2}, pages = {158--175}, year = {2017}, url = {https://doi.org/10.1002/jgt.22018}, doi = {10.1002/JGT.22018}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HuynhKOV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KingR16, author = {Andrew D. King and Bruce A. Reed}, title = {A Short Proof That {\(\chi\)} Can be Bounded {\(\epsilon\)} Away from {\(\Delta\)} + 1 toward {\(\omega\)}}, journal = {J. Graph Theory}, volume = {81}, number = {1}, pages = {30--34}, year = {2016}, url = {https://doi.org/10.1002/jgt.21858}, doi = {10.1002/JGT.21858}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KingR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qip/BoothbyKR16, author = {Tomas Boothby and Andrew D. King and Aidan Roy}, title = {Fast clique minor generation in Chimera qubit connectivity graphs}, journal = {Quantum Inf. Process.}, volume = {15}, number = {1}, pages = {495--508}, year = {2016}, url = {https://doi.org/10.1007/s11128-015-1150-6}, doi = {10.1007/S11128-015-1150-6}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qip/BoothbyKR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KingR15, author = {Andrew D. King and Bruce A. Reed}, title = {Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on {\(\omega\)}, {\(\Delta\)}, and {\(\chi\)}}, journal = {J. Graph Theory}, volume = {78}, number = {3}, pages = {157--194}, year = {2015}, url = {https://doi.org/10.1002/jgt.21797}, doi = {10.1002/JGT.21797}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KingR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/DouglassKR15, author = {Adam Douglass and Andrew D. King and Jack Raymond}, editor = {Marijn Heule and Sean A. Weaver}, title = {Constructing {SAT} Filters with a Quantum Annealer}, booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9340}, pages = {104--120}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-24318-4\_9}, doi = {10.1007/978-3-319-24318-4\_9}, timestamp = {Tue, 21 May 2019 09:04:41 +0200}, biburl = {https://dblp.org/rec/conf/sat/DouglassKR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/King15a, author = {Andrew D. King}, title = {Performance of a quantum annealer on range-limited constraint satisfaction problems}, journal = {CoRR}, volume = {abs/1502.02098}, year = {2015}, url = {http://arxiv.org/abs/1502.02098}, eprinttype = {arXiv}, eprint = {1502.02098}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/King15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BoothbyKR15, author = {Tomas Boothby and Andrew D. King and Aidan Roy}, title = {Fast clique minor generation in Chimera qubit connectivity graphs}, journal = {CoRR}, volume = {abs/1507.04774}, year = {2015}, url = {http://arxiv.org/abs/1507.04774}, eprinttype = {arXiv}, eprint = {1507.04774}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BoothbyKR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/EdwardsK14, author = {Katherine Edwards and Andrew D. King}, title = {A Superlocal Version of Reed's Conjecture}, journal = {Electron. J. Comb.}, volume = {21}, number = {4}, pages = {4}, year = {2014}, url = {https://doi.org/10.37236/2666}, doi = {10.37236/2666}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/EdwardsK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HavetKLT14, author = {Fr{\'{e}}d{\'{e}}ric Havet and Andrew D. King and Mathieu Liedloff and Ioan Todinca}, title = {(Circular) backbone colouring: Forest backbones in planar graphs}, journal = {Discret. Appl. Math.}, volume = {169}, pages = {119--134}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2014.01.011}, doi = {10.1016/J.DAM.2014.01.011}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HavetKLT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/HavetK14, author = {Fr{\'{e}}d{\'{e}}ric Havet and Andrew D. King}, title = {List circular backbone colouring}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {16}, number = {1}, pages = {89--104}, year = {2014}, url = {https://doi.org/10.46298/dmtcs.1258}, doi = {10.46298/DMTCS.1258}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/HavetK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KingM14, author = {Andrew D. King and Catherine C. McGeoch}, title = {Algorithm engineering for a quantum annealing platform}, journal = {CoRR}, volume = {abs/1410.2628}, year = {2014}, url = {http://arxiv.org/abs/1410.2628}, eprinttype = {arXiv}, eprint = {1410.2628}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KingM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KennedyK13, author = {W. Sean Kennedy and Andrew D. King}, title = {Finding a smallest odd hole in a claw-free graph using global structure}, journal = {Discret. Appl. Math.}, volume = {161}, number = {16-17}, pages = {2492--2498}, year = {2013}, url = {https://doi.org/10.1016/j.dam.2013.04.026}, doi = {10.1016/J.DAM.2013.04.026}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KennedyK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KingR13, author = {Andrew D. King and Bruce A. Reed}, title = {Asymptotics of the Chromatic Number for Quasi-Line Graphs}, journal = {J. Graph Theory}, volume = {73}, number = {3}, pages = {327--341}, year = {2013}, url = {https://doi.org/10.1002/jgt.21679}, doi = {10.1002/JGT.21679}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KingR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChristofidesEK13, author = {Demetres Christofides and Katherine Edwards and Andrew D. King}, title = {A Note on Hitting Maximum and Maximal Cliques With a Stable Set}, journal = {J. Graph Theory}, volume = {73}, number = {3}, pages = {354--360}, year = {2013}, url = {https://doi.org/10.1002/jgt.21684}, doi = {10.1002/JGT.21684}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChristofidesEK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/ChudnovskyKPS13, author = {Maria Chudnovsky and Andrew D. King and Matthieu Plumettaz and Paul D. Seymour}, title = {A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {1}, pages = {95--108}, year = {2013}, url = {https://doi.org/10.1137/110847585}, doi = {10.1137/110847585}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/ChudnovskyKPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/EdwardsK13, author = {Katherine Edwards and Andrew D. King}, title = {Bounding the Fractional Chromatic Number of K\({}_{\mbox{Delta}}\)-Free Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {2}, pages = {1184--1208}, year = {2013}, url = {https://doi.org/10.1137/120882068}, doi = {10.1137/120882068}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/EdwardsK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KingLP12, author = {Andrew D. King and Linyuan Lu and Xing Peng}, title = {A Fractional Analogue of Brooks' Theorem}, journal = {{SIAM} J. Discret. Math.}, volume = {26}, number = {2}, pages = {452--471}, year = {2012}, url = {https://doi.org/10.1137/110827879}, doi = {10.1137/110827879}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KingLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-2384, author = {Katherine Edwards and Andrew D. King}, title = {Bounding the fractional chromatic number of K\({}_{\mbox{{\(\Delta\)}}}\)-free graphs}, journal = {CoRR}, volume = {abs/1206.2384}, year = {2012}, url = {http://arxiv.org/abs/1206.2384}, eprinttype = {arXiv}, eprint = {1206.2384}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-2384.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1208-5188, author = {Katherine Edwards and Andrew D. King}, title = {A superlocal version of Reed's Conjecture}, journal = {CoRR}, volume = {abs/1208.5188}, year = {2012}, url = {http://arxiv.org/abs/1208.5188}, eprinttype = {arXiv}, eprint = {1208.5188}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1208-5188.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1209-0160, author = {Tony Huynh and Andrew D. King and Sang{-}il Oum and Maryam Verdian{-}Rizi}, title = {Strongly even cycle decomposable graphs}, journal = {CoRR}, volume = {abs/1209.0160}, year = {2012}, url = {http://arxiv.org/abs/1209.0160}, eprinttype = {arXiv}, eprint = {1209.0160}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1209-0160.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-1410, author = {Andrew D. King and Bruce A. Reed}, title = {A short proof that {\(\chi\)} can be bounded {\(\epsilon\)} away from {\(\Delta\)}+1 towards {\(\omega\)}}, journal = {CoRR}, volume = {abs/1211.1410}, year = {2012}, url = {http://arxiv.org/abs/1211.1410}, eprinttype = {arXiv}, eprint = {1211.1410}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-1410.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-3036, author = {Andrew D. King and Bruce A. Reed}, title = {Claw-free graphs, skeletal graphs, and a stronger conjecture on {\textdollar}{\(\omega\)}{\textdollar}, {\textdollar}{\(\Delta\)}{\textdollar}, and {\textdollar}{\(\chi\)}{\textdollar}}, journal = {CoRR}, volume = {abs/1212.3036}, year = {2012}, url = {http://arxiv.org/abs/1212.3036}, eprinttype = {arXiv}, eprint = {1212.3036}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-3036.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KaiserKK11, author = {Tom{\'{a}}s Kaiser and Andrew D. King and Daniel Kr{\'{a}}l'}, title = {Fractional total colourings of graphs of high girth}, journal = {J. Comb. Theory, Ser. {B}}, volume = {101}, number = {6}, pages = {383--402}, year = {2011}, url = {https://doi.org/10.1016/j.jctb.2010.12.005}, doi = {10.1016/J.JCTB.2010.12.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/KaiserKK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/King11, author = {Andrew D. King}, title = {Hitting all maximum cliques with a stable set using lopsided independent transversals}, journal = {J. Graph Theory}, volume = {67}, number = {4}, pages = {300--305}, year = {2011}, url = {https://doi.org/10.1002/jgt.20532}, doi = {10.1002/JGT.20532}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/King11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1102-0805, author = {Andrew D. King and Bruce A. Reed}, title = {Asymptotics of the chromatic number for quasi-line graphs}, journal = {CoRR}, volume = {abs/1102.0805}, year = {2011}, url = {http://arxiv.org/abs/1102.0805}, eprinttype = {arXiv}, eprint = {1102.0805}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1102-0805.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1103-6222, author = {W. Sean Kennedy and Andrew D. King}, title = {Finding a smallest odd hole in a claw-free graph using global structure}, journal = {CoRR}, volume = {abs/1103.6222}, year = {2011}, url = {http://arxiv.org/abs/1103.6222}, eprinttype = {arXiv}, eprint = {1103.6222}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1103-6222.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1109-2112, author = {Maria Chudnovsky and Andrew D. King and Matthieu Plumettaz and Paul D. Seymour}, title = {A local strengthening of Reed's {\(\omega\)}, {\(\Delta\)}, {\(\chi\)} conjecture for quasi-line graphs}, journal = {CoRR}, volume = {abs/1109.2112}, year = {2011}, url = {http://arxiv.org/abs/1109.2112}, eprinttype = {arXiv}, eprint = {1109.2112}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1109-2112.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1109-3092, author = {Demetres Christofides and Katherine Edwards and Andrew D. King}, title = {A note on hitting maximum and maximal cliques with a stable set}, journal = {CoRR}, volume = {abs/1109.3092}, year = {2011}, url = {http://arxiv.org/abs/1109.3092}, eprinttype = {arXiv}, eprint = {1109.3092}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1109-3092.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1110-5111, author = {Maria Chudnovsky and Andrew D. King}, title = {Optimal antithickenings of claw-free trigraphs}, journal = {CoRR}, volume = {abs/1110.5111}, year = {2011}, url = {http://arxiv.org/abs/1110.5111}, eprinttype = {arXiv}, eprint = {1110.5111}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1110-5111.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Addario-BerryKKLR10, author = {Louigi Addario{-}Berry and W. Sean Kennedy and Andrew D. King and Zhentao Li and Bruce A. Reed}, title = {Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph}, journal = {Discret. Appl. Math.}, volume = {158}, number = {7}, pages = {765--770}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2008.08.020}, doi = {10.1016/J.DAM.2008.08.020}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Addario-BerryKKLR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EsperetGK10, author = {Louis Esperet and John Gimbel and Andrew D. King}, title = {Covering line graphs with equivalence relations}, journal = {Discret. Appl. Math.}, volume = {158}, number = {17}, pages = {1902--1907}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2010.08.012}, doi = {10.1016/J.DAM.2010.08.012}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/EsperetGK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KingM10, author = {Andrew D. King and Gary MacGillivray}, title = {The firefighter problem for cubic graphs}, journal = {Discret. Math.}, volume = {310}, number = {3}, pages = {614--621}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2009.05.007}, doi = {10.1016/J.DISC.2009.05.007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KingM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0911-1741, author = {Andrew D. King}, title = {Hitting all maximum cliques with a stable set using lopsided independent transversals}, journal = {CoRR}, volume = {abs/0911.1741}, year = {2009}, url = {http://arxiv.org/abs/0911.1741}, eprinttype = {arXiv}, eprint = {0911.1741}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0911-1741.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KingR08, author = {Andrew D. King and Bruce A. Reed}, title = {Bounding chi in terms of omega and delta for quasi-line graphs}, journal = {J. Graph Theory}, volume = {59}, number = {3}, pages = {215--228}, year = {2008}, url = {https://doi.org/10.1002/jgt.20334}, doi = {10.1002/JGT.20334}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KingR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FinbowKMR07, author = {Stephen Finbow and Andrew D. King and Gary MacGillivray and Romeo Rizzi}, title = {The firefighter problem for graphs of maximum degree three}, journal = {Discret. Math.}, volume = {307}, number = {16}, pages = {2094--2105}, year = {2007}, url = {https://doi.org/10.1016/j.disc.2005.12.053}, doi = {10.1016/J.DISC.2005.12.053}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FinbowKMR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KingRV07, author = {Andrew D. King and Bruce A. Reed and Adrian Vetta}, title = {An upper bound for the chromatic number of line graphs}, journal = {Eur. J. Comb.}, volume = {28}, number = {8}, pages = {2182--2187}, year = {2007}, url = {https://doi.org/10.1016/j.ejc.2007.04.014}, doi = {10.1016/J.EJC.2007.04.014}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/KingRV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KingR07, author = {Andrew D. King and Bruce A. Reed}, title = {Asymptotics of the chromatic number for quasi-line graphs}, journal = {Electron. Notes Discret. Math.}, volume = {29}, pages = {327--331}, year = {2007}, url = {https://doi.org/10.1016/j.endm.2007.07.056}, doi = {10.1016/J.ENDM.2007.07.056}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KingR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/King06, author = {Andrew D. King}, title = {Generating indecomposable permutations}, journal = {Discret. Math.}, volume = {306}, number = {5}, pages = {508--518}, year = {2006}, url = {https://doi.org/10.1016/j.disc.2006.01.005}, doi = {10.1016/J.DISC.2006.01.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/King06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bioinformatics/KingPJ04, author = {Andrew D. King and Natasa Przulj and Igor Jurisica}, title = {Protein complex prediction via cost-based clustering}, journal = {Bioinform.}, volume = {20}, number = {17}, pages = {3013--3020}, year = {2004}, url = {https://doi.org/10.1093/bioinformatics/bth351}, doi = {10.1093/BIOINFORMATICS/BTH351}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bioinformatics/KingPJ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.