dblp.uni-trier.dewww.uni-trier.de

Alex D. Scott Vis

Alexander D. Scott

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
41EEPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational complexity of some restricted instances of 3-SAT. Discrete Applied Mathematics 155(5): 649-653 (2007)
40EEAlexander D. Scott, Gregory B. Sorkin: Linear-programming design and analysis of fast algorithms for Max 2-CSP. Discrete Optimization 4(3-4): 260-287 (2007)
39EEBéla Bollobás, Alex D. Scott: On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007)
38 Pierre Charbit, Alex D. Scott: Infinite Locally Random Graphs. Internet Mathematics 3(3): (2007)
37EEBéla Bollobás, Alex D. Scott: Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97(2): 193-203 (2007)
36EENoga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott: Maximum directed cuts in acyclic digraphs. Journal of Graph Theory 55(1): 1-13 (2007)
2006
35EEAlexander D. Scott, Gregory B. Sorkin: An LP-Designed Algorithm for Constraint Satisfaction. ESA 2006: 588-599
34EEAlexander D. Scott, Gregory B. Sorkin: Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems CoRR abs/cs/0604079: (2006)
33EEAlexander 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)
32EEAlexander D. Scott, Alan D. Sokal: On Dependency Graphs and the Lattice Gas. Combinatorics, Probability & Computing 15(1-2): 253-279 (2006)
31EEAlexander D. Scott, Gregory B. Sorkin: Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. Combinatorics, Probability & Computing 15(1-2): 281-315 (2006)
30EEA. J. Radcliffe, Alex D. Scott: Reconstructing under Group Actions. Graphs and Combinatorics 22(3): 399-419 (2006)
2005
29 Alexander D. Scott: Judicious partitions and related problems. Surveys in Combinatorics 2005: 95-117
2004
28 Alexander D. Scott: Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp. Combinatorics, Probability & Computing 13(1): 122 (2004)
27EEBéla Bollobás, Alex D. Scott: Max Cut for Random Graphs with a Planted Partition. Combinatorics, Probability & Computing 13(4-5): 451-474 (2004)
26EEPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational Complexity of Some Restricted Instances of 3SAT Electronic Colloquium on Computational Complexity (ECCC)(111): (2004)
25EEBéla Bollobás, Alex D. Scott: Judicious partitions of bounded-degree graphs. Journal of Graph Theory 46(2): 131-143 (2004)
2003
24EEAlex 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
23 Béla Bollobás, Graham Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott: Special Issue on Ramsey Theory. Combinatorics, Probability & Computing 12(5-6): 467-468 (2003)
22EEPiotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT Electronic Colloquium on Computational Complexity (ECCC) 10(022): (2003)
21EEPiotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness of Short Symmetric Instances of MAX-3SAT Electronic Colloquium on Computational Complexity (ECCC)(049): (2003)
20EELuke Pebody, A. J. Radcliffe, Alex D. Scott: Finite Subsets of the Plane are 18-Reconstructible. SIAM J. Discrete Math. 16(2): 262-275 (2003)
2002
19EEBéla Bollobás, Alex D. Scott: Problems and results on judicious partitions. Random Struct. Algorithms 21(3-4): 414-430 (2002)
2001
18EEPaul 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)
17EEAlex D. Scott: On Induced Subgraphs with All Degrees Odd. Graphs and Combinatorics 17(3): 539-553 (2001)
2000
16EEBéla Bollobás, Alex D. Scott: Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21(3): 289-300 (2000)
15EEAlex D. Scott: Subdivisions of Transitive Tournaments. Eur. J. Comb. 21(8): 1067-1071 (2000)
1999
14EEBéla Bollobás, Alex D. Scott: Exact Bounds for Judicious Partitions of Graphs. Combinatorica 19(4): 473-486 (1999)
13EEA. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Reals. Electr. J. Comb. 6: (1999)
12EEAlex D. Scott: Another Simple Proof of a Theorem of Milner. J. Comb. Theory, Ser. A 87(2): 379-380 (1999)
11EEAlex D. Scott: Induced Cycles and Chromatic Number. J. Comb. Theory, Ser. B 76(2): 150-154 (1999)
1998
10EEA. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Zn. J. Comb. Theory, Ser. A 83(2): 169-187 (1998)
1997
9EEAlex D. Scott: Better Bounds for Perpetual Gossiping. Discrete Applied Mathematics 75(2): 189-197 (1997)
8EEBéla Bollobás, Alex D. Scott: Independent sets and repeated degrees. Discrete Mathematics 170(1-3): 41-49 (1997)
7EEAlex D. Scott: Reconstructing sequences. Discrete Mathematics 175(1-3): 231-238 (1997)
6EEAlex D. Scott: On graph decompositions modulo k. Discrete Mathematics 175(1-3): 289-291 (1997)
5EEDavid M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo: All trees contain a large induced subgraph having all degrees 1 (mod k). Discrete Mathematics 175(1-3): 35-40 (1997)
4EEBéla Bollobás, Alex D. Scott: Judicious Partitions of Hypergraphs. J. Comb. Theory, Ser. A 78(1): 15-31 (1997)
1996
3EEBéla Bollobás, Alex D. Scott: A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. J. Comb. Theory, Ser. B 66(2): 283-292 (1996)
1995
2EEA. J. Radcliffe, Alex D. Scott: Every tree contains a large induced subgraph with all degrees odd. Discrete Mathematics 140(1-3): 275-279 (1995)
1992
1 Alex D. Scott: Large Induced Subgraphs with All Degrees Odd. Combinatorics, Probability & Computing 1: 335-349 (1992)

Coauthor Index

1Noga Alon [36]
2Paul N. Balister (Paul Balister) [18]
3David M. Berman [5]
4Piotr Berman [21] [22] [26] [41]
5Béla Bollobás [3] [4] [8] [14] [16] [18] [19] [23] [25] [27] [36] [37] [39]
6Graham Brightwell [23]
7Pierre Charbit [38]
8András Gyárfás [36]
9Marek Karpinski [21] [22] [26] [41]
10Yoshiharu Kohayakawa [23]
11Imre Leader [23]
12Jenö Lehel (Jeno Lehel) [36]
13Luke Pebody [20]
14A. J. Radcliffe [2] [5] [10] [13] [20] [30]
15Oliver Riordan [18]
16Alan D. Sokal [32]
17Gregory B. Sorkin [24] [31] [33] [34] [35] [40]
18Hong Wang [5]
19Larry Wargo [5]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)