|
Professor Alex Scott
Personal Web Page
eMail:
Alexander [dot] Scott [-at-] maths [dot] ox [dot] ac [dot] uk
Contact Form
Phone Number(s):
Reception/Secretary: +44 1865 273525
Direct: +44 1865 (6)15314
Office:
RI.0.26
Departmental Address:
Mathematical Institute
24-29 St Giles'
Oxford
OX1 3LB
England
|
Research Interests:
Combinatorics, probability and related areas
Recent Publications (from MathSciNet):
-
MR2784637 Scott, Alexander Szemerédi's regularity lemma for matrices and sparse graphs.
Combin. Probab. Comput. 20 (2011), no. 3, 455–466, 05C75
-
MR2791447 Bollobás, Béla; Scott, Alex Intersections of graphs.
J. Graph Theory 66 (2011), no. 4, 261–282, 05D05 (05C80 05D40 05E15)
-
MR2651810 (2011h:05200) Bollobás, Béla; Scott, Alex Max $k$k-cut and judicious $k$k-partitions.
Discrete Math. 310 (2010), no. 15-16, 2126–2139. (Reviewer: Jaroslav Ivančo), 05C70 (05C35)
-
MR2573437 (2010k:90018) Aldous, David J.; McDiarmid, Colin; Scott, Alex Uniform multicommodity flow through the complete graph with random
edge-capacities.
Oper. Res. Lett. 37 (2009), no. 5, 299–302, 90B15
-
MR2571908 (2011c:68177) Scott, Alexander D.; Sorkin, Gregory B. Polynomial constraint satisfaction problems, graph bisection, and the
Ising partition function.
ACM Trans. Algorithms 5 (2009), no. 4, Art. 45, 27 pp. (Reviewer: Martin C. Cooper), 68T20 (05C70 05C85 68Q25)
-
MR2529396 (2010i:05167) Scott, Alexander D.; Sokal, Alan D. Some variants of the exponential formula, with application to the
multivariate Tutte polynomial (alias Potts model).
Sém. Lothar. Combin. 61A (2009/10), Art. B61Ae, 33 pp, 05C30 (06A07 82B20)
-
MR2389229 (2008j:05003) Combinatorics and probability.
Celebrating Béla Bollobás's 60th birthday.
Papers from the Conference "Combinatorics in Cambridge'' held in
Cambridge, August 4–7, 2003.
Including reprints from Combin. Probab. Comput. 14–16
(2005/2007).
Edited by Graham Brightwell, Imre Leader, Alexander Scott and Andrew
Thomason.
Cambridge University Press, Cambridge, 2007. xxvi+633 pp. ISBN: 978-0-521-87207-2; 0-521-87207-3, 05-06 (60-06 60C05)
-
MR2374035 (2009b:68196) Scott, Alexander D.; Sorkin, Gregory B. Linear-programming design and analysis of fast algorithms for Max
2-CSP.
Discrete Optim. 4 (2007), no. 3-4, 260–287, 68T20 (68Q25 90C05)
-
MR2311991 (2008f:05074) Alon, Noga; Bollobás, Béla; Gyárfás, András; Lehel, Jenő; Scott, Alex Maximum directed cuts in acyclic digraphs.
J. Graph Theory 55 (2007), no. 1, 1–13. (Reviewer: Daniel Turzík), 05C20
-
MR2305574 (2008g:05209) Bollobás, Béla; Scott, Alex On separating systems.
European J. Combin. 28 (2007), no. 4, 1068–1071. (Reviewer: Ákos Seress), 05D05
More publications
|
