Alex Scott

Navedeno

	Vse	Od leta 2019
Navedbe	4425	2474
indeks h	34	24
indeks i10	114	73

580

290

145

435

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 28 14 26 38 49 63 62 83 107 73 123 113 169 197 210 205 252 276 290 320 423 571 571

Javni dostop

Prikaži vse

87 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Maria ChudnovskyPrinceton UniversityPreverjeni e-poštni naslov na math.princeton.edu
Sophie SpirklUniversity of WaterlooPreverjeni e-poštni naslov na uwaterloo.ca
Tung H. NguyenPrinceton UniversityPreverjeni e-poštni naslov na princeton.edu
Carla GroenlandTU DelftPreverjeni e-poštni naslov na tudelft.nl
Andrew J. RadcliffeProfessor of Mathematics, University of Nebraska-LincolnPreverjeni e-poštni naslov na math.unl.edu
Gregory SorkinLondon School of Economics and Political SciencePreverjeni e-poštni naslov na lse.ac.uk
David R. WoodSchool of Mathematics, Monash UniversityPreverjeni e-poštni naslov na monash.edu
Tom JohnstonUniversity of BristolPreverjeni e-poštni naslov na bristol.ac.uk
Alan D. SokalProfessor of Physics, New York University; Professor of Mathematics, University College LondonPreverjeni e-poštni naslov na nyu.edu
Marek KarpinskiProfessor of Computer Science, University of BonnPreverjeni e-poštni naslov na cs.uni-bonn.de
Stéphan ThomasséÉcole Normale Supérieure de LyonPreverjeni e-poštni naslov na ens-lyon.fr
Jacob FoxStanford UniversityPreverjeni e-poštni naslov na stanford.edu
António GirãoResearch fellow, University of OxfordPreverjeni e-poštni naslov na maths.ox.ac.uk
Kitty MeeksUniversity of GlasgowPreverjeni e-poštni naslov na glasgow.ac.uk
Bruce ReedMcGill UniversityPreverjeni e-poštni naslov na cs.mcgill.ca
Freddie IllingworthPostdoc, University of OxfordPreverjeni e-poštni naslov na maths.ox.ac.uk
Benjamin SudakovETH, ZurichPreverjeni e-poštni naslov na math.ethz.ch
Martin LoeblProfessor of Informatics, Charles University, PraguePreverjeni e-poštni naslov na kam.mff.cuni.cz
Dániel KorándiUniversity of Oxford, UKPreverjeni e-poštni naslov na maths.ox.ac.uk
Marthe BonamyLaBRI, CNRS, Université BordeauxPreverjeni e-poštni naslov na u-bordeaux.fr

Spremljaj

Alex Scott

Professor of Mathematics, University of Oxford

Preverjeni e-poštni naslov na maths.ox.ac.uk - Domača stran

Combinatorics graph theory probability algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma AD Scott, AD Sokal Journal of Statistical Physics 118, 1151-1261, 2005	246	2005
Approximation hardness of short symmetric instances of MAX-3SAT P Berman, M Karpinski, A Scott	223	2004
A survey of ‐boundedness A Scott, P Seymour Journal of Graph Theory 95 (3), 473-504, 2020	188	2020
Induced trees in graphs of large chromatic number AD Scott Journal of Graph Theory 24 (4), 297-311, 1997	121	1997
Problems and results on judicious partitions B Bollobás, AD Scott Random Structures & Algorithms 21 (3‐4), 414-430, 2002	109	2002
A bound for the cops and robbers problem A Scott, B Sudakov SIAM Journal on Discrete Mathematics 25 (3), 1438-1442, 2011	104	2011
Better bounds for Max Cut B Bollobás, AD Scott Contemporary combinatorics 10, 185, 2002	92	2002
Induced subgraphs of graphs with large chromatic number. I. Odd holes A Scott, P Seymour Journal of Combinatorial Theory, Series B 121, 68-84, 2016	85	2016
Tournaments and colouring E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ... Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013	78	2013
Exact bounds for judicious partitions of graphs B Bollobás, AD Scott Combinatorica 19 (4), 473-486, 1999	76	1999
Szemerédi's regularity lemma for matrices and sparse graphs A Scott Combinatorics, Probability and Computing 20 (3), 455-466, 2011	71	2011
Judicious partitions and related problems. AD Scott BCC, 95-117, 2005	70	2005
Reversals and transpositions over finite alphabets AJ Radcliffe, AD Scott, EL Wilmer SIAM journal on discrete mathematics 19 (1), 224-244, 2005	70	2005
Approximation hardness and satisfiability of bounded occurrence instances of SAT PR Berman, AD Scott, M Karpinski SIS-2003-269, 2003	67	2003
Induced subgraphs of graphs with large chromatic number. III. Long holes M Chudnovsky, A Scott, P Seymour Combinatorica 37 (6), 1057-1072, 2017	54	2017
On separating systems B Bollobás, A Scott European Journal of Combinatorics 28 (4), 1068-1071, 2007	52	2007
Feedback from nature: an optimal distributed algorithm for maximal independent set selection A Scott, P Jeavons, L Xu Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013	51	2013
Max cut for random graphs with a planted partition B Bollobás, AD Scott Combinatorics, Probability and Computing 13 (4-5), 451-474, 2004	49	2004
Linear-programming design and analysis of fast algorithms for Max 2-CSP AD Scott, GB Sorkin Discrete Optimization 4 (3-4), 260-287, 2007	46	2007
Judicious partitions of bounded‐degree graphs B Bollobás, AD Scott Journal of Graph Theory 46 (2), 131-143, 2004	45	2004

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji