Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDAlex D. Scott
Alexander D. Scott – Alexander Scott 0001 – Alex Scott 0001
Person information
- affiliation: University of Oxford, Mathematical Institute, UK
Other persons with the same name
- Alexander Scott 0002
![[0000-0002-7630-9464]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-7630-9464")
— Cedars-Sinai Medical Center, Angeles, CA, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j110]Maria Chudnovsky, Patrick Hompe, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Concatenating Bipartite Graphs. Electron. J. Comb. 29(2) (2022)- [j109]Michal Przykucki, Alexander Roberts, Alex Scott:
Shotgun reconstruction in the hypercube. Random Struct. Algorithms 60(1): 117-150 (2022) - [j108]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs VI: Excluding an Ordered Tree. SIAM J. Discret. Math. 36(1): 170-187 (2022) - [j107]Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan:
A Note on Infinite Antichain Density. SIAM J. Discret. Math. 36(1): 573-577 (2022) - 2021
- [j106]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Detecting a Long Odd Hole. Comb. 41(1): 1-30 (2021) - [j105]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41(3): 379-405 (2021) - [j104]Hannah Guggiari, Alex Scott:
Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree. Electron. J. Comb. 28(1): 1 (2021) - [j103]Tom Johnston, Alex D. Scott:
Lipschitz bijections between boolean functions. Comb. Probab. Comput. 30(4): 513-525 (2021) - [j102]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j101]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
A note on simplicial cliques. Discret. Math. 344(9): 112470 (2021) - [j100]Natasha Morrison, Alexander Roberts, Alex D. Scott:
Maximising the number of cycles in graphs with forbidden subgraphs. J. Comb. Theory, Ser. B 147: 201-237 (2021) - [j99]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory, Ser. B 150: 195-243 (2021) - [j98]Carla Groenland, Hannah Guggiari, Alex D. Scott:
Size reconstructibility of graphs. J. Graph Theory 96(2): 326-337 (2021) - [j97]Colin McDiarmid, Alex Scott, Paul Withers:
The component structure of dense random subgraphs of the hypercube. Random Struct. Algorithms 59(1): 3-24 (2021) - [j96]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Finding a Shortest Odd Hole. ACM Trans. Algorithms 17(2): 13:1-13:21 (2021) - [c8]Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott:
Active clustering for labeling training data. NeurIPS 2021: 8469-8480 - [c7]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability, and reachability. STOC 2021: 1109-1117 - [i21]Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein:
Active clustering for labeling training data. CoRR abs/2110.14521 (2021) - 2020
- [j95]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XIII. New brooms. Eur. J. Comb. 84 (2020) - [j94]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Detecting an Odd Hole. J. ACM 67(1): 5:1-5:12 (2020) - [j93]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B 140: 84-97 (2020) - [j92]Marthe Bonamy, Natasha Morrison, Alex Scott:
Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory, Ser. A 174: 105252 (2020) - [j91]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. J. Comb. Theory, Ser. B 142: 43-55 (2020) - [j90]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. VI. Banana trees. J. Comb. Theory, Ser. B 145: 487-510 (2020) - [j89]Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - [j88]Alex Scott, Paul D. Seymour:
A survey of χ-boundedness. J. Graph Theory 95(3): 473-504 (2020) - [i20]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability and reachability. CoRR abs/2012.01764 (2020) - [i19]Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott:
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR abs/2012.02435 (2020)
2010 – 2019
- 2019
- [j87]Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - [j86]Alex D. Scott, Paul D. Seymour:
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. Comb. 39(5): 1105-1132 (2019) - [j85]Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood:
Clustered Colouring in Minor-Closed Classes. Comb. 39(6): 1387-1412 (2019) - [j84]Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - [j83]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XI. Orientations. Eur. J. Comb. 76: 53-61 (2019) - [j82]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Disjoint paths in unions of tournaments. J. Comb. Theory, Ser. B 135: 238-255 (2019) - [j81]Bruce A. Reed, Alex Scott, Paul D. Seymour:
Near-domination in graphs. J. Comb. Theory, Ser. A 165: 392-407 (2019) - [j80]Alex Scott, Paul D. Seymour, David R. Wood:
Bad news for chordal partitions. J. Graph Theory 90(1): 5-12 (2019) - [j79]Hannah Guggiari, Alex Scott:
Maximising -colourings of graphs. J. Graph Theory 92(2): 172-185 (2019) - [j78]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J. Graph Theory 92(3): 237-254 (2019) - 2018
- [j77]Humberto Naves, Oleg Pikhurko, Alex Scott:
How unproportional must a graph be? Eur. J. Comb. 73: 138-152 (2018) - [j76]Alexander Roberts, Alex Scott:
Stability results for graphs with a critical edge. Eur. J. Comb. 74: 27-38 (2018) - [j75]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. J. Comb. Theory, Ser. B 132: 180-235 (2018) - [j74]Jonathan A. Noel, Alex Scott, Benny Sudakov:
Supersaturation in posets and applications involving the container method. J. Comb. Theory, Ser. A 154: 247-284 (2018) - [i18]Carla Groenland, Alex Scott:
H-colouring Pt-free graphs in subexponential time. CoRR abs/1803.05396 (2018) - [i17]Alex Scott, David R. Wood:
Better bounds for poset dimension and boxicity. CoRR abs/1804.03271 (2018) - [i16]Tom Johnston, Alex Scott:
Lipschitz bijections between boolean functions. CoRR abs/1812.09215 (2018) - 2017
- [j73]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Comb. 37(6): 1057-1072 (2017) - [j72]Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. Electron. J. Comb. 24(2): 2 (2017) - [j71]Penny E. Haxell, Alex D. Scott:
A Note on Intersecting Hypergraphs with Large Cover Number. Electron. J. Comb. 24(3): 3 (2017) - [j70]Natasha Morrison, Jonathan A. Noel, Alex Scott:
Saturation in the Hypercube and Bootstrap Percolation. Comb. Probab. Comput. 26(1): 78-98 (2017) - [j69]Natasha Morrison, Alex Scott:
Maximising the number of induced cycles in a graph. J. Comb. Theory, Ser. B 126: 24-61 (2017) - [j68]Penny E. Haxell, Alexander D. Scott:
On Lower Bounds for the Matching Number of Subcubic Graphs. J. Graph Theory 85(2): 336-348 (2017) - [j67]Colin McDiarmid, Alex Scott, Paul Withers:
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50(3): 437-463 (2017) - [j66]Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. Random Struct. Algorithms 51(1): 3-13 (2017) - 2016
- [j65]Peter Jeavons, Alex Scott, Lei Xu:
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. Distributed Comput. 29(5): 377-393 (2016) - [j64]Colin McDiarmid, Alex Scott:
Random graphs from a block-stable class. Eur. J. Comb. 58: 96-106 (2016) - [j63]Kitty Meeks, Alexander Scott:
The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. 251: 91-103 (2016) - [j62]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. J. Comb. Theory, Ser. B 118: 109-128 (2016) - [j61]Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour:
Disjoint dijoins. J. Comb. Theory, Ser. B 120: 18-35 (2016) - [j60]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. I. Odd holes. J. Comb. Theory, Ser. B 121: 68-84 (2016) - [i15]Peter Jeavons, Alex D. Scott, Lei Xu:
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring. CoRR abs/1601.04306 (2016) - 2015
- [j59]Béla Bollobás, Alex D. Scott:
Intersections of random hypergraphs and tournaments. Eur. J. Comb. 44: 125-139 (2015) - [j58]Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott:
Disjoint induced subgraphs of the same order and size. Eur. J. Comb. 49: 153-166 (2015) - [j57]Béla Bollobás, Alex D. Scott:
Intersections of hypergraphs. J. Comb. Theory, Ser. B 110: 180-208 (2015) - 2014
- [j56]Natasha Morrison, Jonathan A. Noel, Alex Scott:
On Saturated k-Sperner Systems. Electron. J. Comb. 21(3): 3 (2014) - [j55]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Excluding pairs of graphs. J. Comb. Theory, Ser. B 106: 15-29 (2014) - [j54]Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. Theory Comput. Syst. 54(4): 731-753 (2014) - [j53]Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - [j52]Alex Scott, Elizabeth Wilmer:
Hypergraphs of Bounded Disjointness. SIAM J. Discret. Math. 28(1): 372-384 (2014) - [i14]Natasha Morrison, Jonathan A. Noel, Alex D. Scott:
On Saturated k-Sperner Systems. CoRR abs/1402.5646 (2014) - [i13]Colin McDiarmid, Alex D. Scott, Paul Withers:
Uniform multicommodity flow in the hypercube with random edge capacities. CoRR abs/1406.4433 (2014) - [i12]Natasha Morrison, Jonathan A. Noel, Alex Scott:
Saturation in the Hypercube and Bootstrap Percolation. CoRR abs/1408.5488 (2014) - 2013
- [j51]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory, Ser. B 103(1): 1-20 (2013) - [j50]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Substitution and χ-boundedness. J. Comb. Theory, Ser. B 103(5): 567-586 (2013) - [j49]Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40(3): 739-743 (2013) - [j48]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27(1): 240-256 (2013) - [j47]Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2×n boards. Theor. Comput. Sci. 500: 25-43 (2013) - [c6]Alex Scott, Peter Jeavons, Lei Xu:
Feedback from nature: an optimal distributed algorithm for maximal independent set selection. PODC 2013: 147-156 - 2012
- [j46]Penny E. Haxell, Alex D. Scott:
On Ryser's conjecture. Electron. J. Comb. 19(1): 23 (2012) - [j45]Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 57-87 (2012) - [j44]Kitty Meeks, Alexander Scott:
The complexity of flood-filling games on graphs. Discret. Appl. Math. 160(7-8): 959-969 (2012) - [j43]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71(1): 49-68 (2012) - [j42]Alex Scott, Mark Fey:
The minimal covering set in large tournaments. Soc. Choice Welf. 38(1): 1-9 (2012) - [c5]Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. FUN 2012: 282-292 - [i11]Kitty Meeks, Alexander Scott:
Spanning trees and the complexity of flood-filling games. CoRR abs/1203.2538 (2012) - [i10]Alex Scott, Peter Jeavons, Lei Xu:
Feedback from nature: an optimal distributed algorithm for maximal independent set selection. CoRR abs/1211.0235 (2012) - 2011
- [j41]Alexander Scott:
Szemerédi's Regularity Lemma for Matrices and Sparse Graphs. Comb. Probab. Comput. 20(3): 455-466 (2011) - [j40]Béla Bollobás, Alex D. Scott:
Intersections of graphs. J. Graph Theory 66(4): 261-282 (2011) - [j39]Alex Scott, Benny Sudakov:
A Bound for the Cops and Robbers Problem. SIAM J. Discret. Math. 25(3): 1438-1442 (2011) - [c4]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. ESA 2011: 799-810 - [i9]Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2xn boards. CoRR abs/1101.5518 (2011) - [i8]Kitty Meeks, Alexander Scott:
The complexity of flood-filling games on graphs. CoRR abs/1101.5876 (2011) - [i7]Kitty Meeks, Alexander Scott:
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth. CoRR abs/1110.4077 (2011) - 2010
- [j38]Béla Bollobás, Alex D. Scott:
Max k-cut and judicious k-partitions. Discret. Math. 310(15-16): 2126-2139 (2010) - [i6]Alexander D. Scott, Gregory B. Sorkin:
Structure of random r-SAT below the pure literal threshold. CoRR abs/1008.1260 (2010)
2000 – 2009
- 2009
- [j37]David J. Aldous, Colin McDiarmid, Alex D. Scott:
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37(5): 299-302 (2009) - [j36]Alexander D. Scott, Gregory B. Sorkin:
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. ACM Trans. Algorithms 5(4): 45:1-45:27 (2009) - 2007
- [j35]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational complexity of some restricted instances of 3-SAT. Discret. Appl. Math. 155(5): 649-653 (2007) - [j34]Alexander D. Scott, Gregory B. Sorkin:
Linear-programming design and analysis of fast algorithms for Max 2-CSP. Discret. Optim. 4(3-4): 260-287 (2007) - [j33]Béla Bollobás, Alex D. Scott:
On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007) - [j32]Pierre Charbit, Alex D. Scott:
Infinite Locally Random Graphs. Internet Math. 3(3): 321-331 (2007) - [j31]Béla Bollobás, Alex D. Scott:
Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97(2): 193-203 (2007) - [j30]Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott:
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55(1): 1-13 (2007) - 2006
- [j29]Alexander D. Scott, Alan D. Sokal:
On Dependency Graphs and the Lattice Gas. Comb. Probab. Comput. 15(1-2): 253-279 (2006) - [j28]Alexander D. Scott, Gregory B. Sorkin:
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. Comb. Probab. Comput. 15(1-2): 281-315 (2006) - [j27]A. J. Radcliffe, Alex D. Scott:
Reconstructing under Group Actions. Graphs Comb. 22(3): 399-419 (2006) - [c3]Alexander D. Scott, Gregory B. Sorkin:
An LP-Designed Algorithm for Constraint Satisfaction. ESA 2006: 588-599 - [i5]Alexander D. Scott, Gregory B. Sorkin:
Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems. CoRR abs/cs/0604079 (2006) - [i4]Alexander D. Scott, Gregory B. Sorkin:
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP. CoRR abs/cs/0604080 (2006) - 2005
- [c2]Alexander D. Scott:
Judicious partitions and related problems. BCC 2005: 95-117 - 2004
- [j26]Alexander D. Scott:
Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp. Comb. Probab. Comput. 13(1): 122 (2004) - [j25]Béla Bollobás, Alex D. Scott:
Max Cut for Random Graphs with a Planted Partition. Comb. Probab. Comput. 13(4-5): 451-474 (2004) - [j24]Béla Bollobás, Alex D. Scott:
Judicious partitions of bounded-degree graphs. J. Graph Theory 46(2): 131-143 (2004) - [i3]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational Complexity of Some Restricted Instances of 3SAT. Electron. Colloquium Comput. Complex.(111) (2004) - 2003
- [j23]Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott:
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12(5-6): 467-468 (2003) - [j22]Luke Pebody, A. J. Radcliffe, Alex D. Scott:
Finite Subsets of the Plane are 18-Reconstructible. SIAM J. Discret. Math. 16(2): 262-275 (2003) - [c1]Alex D. Scott, Gregory B. Sorkin:
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. RANDOM-APPROX 2003: 382-395 - [i2]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT. Electron. Colloquium Comput. Complex. 10(022) (2003) - [i1]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electron. Colloquium Comput. Complex.(049) (2003) - 2002
- [j21]Ronald J. Gould, Penny E. Haxell, Alex D. Scott:
A Note on Cycle Lengths in Graphs. Graphs Comb. 18(3): 491-498 (2002) - [j20]Béla Bollobás, Alex D. Scott:
Problems and results on judicious partitions. Random Struct. Algorithms 21(3-4): 414-430 (2002) - 2001
- [j19]Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott:
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22(1): 1-4 (2001) - [j18]Alex D. Scott:
On Induced Subgraphs with All Degrees Odd. Graphs Comb. 17(3): 539-553 (2001) - 2000
- [j17]Béla Bollobás, Alex D. Scott:
Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21(3): 289-300 (2000) - [j16]Alex D. Scott:
Subdivisions of Transitive Tournaments. Eur. J. Comb. 21(8): 1067-1071 (2000)
1990 – 1999
- 1999
- [j15]Béla Bollobás, Alex D. Scott:
Exact Bounds for Judicious Partitions of Graphs. Comb. 19(4): 473-486 (1999) - [j14]A. J. Radcliffe, Alex D. Scott:
Reconstructing Subsets of Reals. Electron. J. Comb. 6 (1999) - [j13]Alex D. Scott:
Induced Cycles and Chromatic Number. J. Comb. Theory, Ser. B 76(2): 150-154 (1999) - [j12]Alex D. Scott:
Another Simple Proof of a Theorem of Milner. J. Comb. Theory, Ser. A 87(2): 379-380 (1999) - 1998
- [j11]A. J. Radcliffe, Alex D. Scott:
Reconstructing Subsets of Zn. J. Comb. Theory, Ser. A