| 2007 |
|---|
| 39 | EE | Graham Brightwell,
Konstantinos Panagiotou,
Angelika Steger:
On extremal subgraphs of random graphs.
SODA 2007: 477-485 |
| 2006 |
|---|
| 38 | EE | Graham Brightwell,
Jan van den Heuvel,
Leen Stougie:
A Linear Bound On The Diameter Of The Transportation Polytope.
Combinatorica 26(2): 133-139 (2006) |
| 37 | EE | Noga Alon,
Graham Brightwell,
Hal A. Kierstead,
Alexandr V. Kostochka,
Peter Winkler:
Dominating sets in k-majority tournaments.
J. Comb. Theory, Ser. B 96(3): 374-387 (2006) |
| 36 | EE | Béla Bollobás,
Graham Brightwell:
How many graphs are unions of k-cliques?
Journal of Graph Theory 52(2): 87-107 (2006) |
| 2005 |
|---|
| 35 | EE | Graham Brightwell,
Peter Winkler:
Counting Eulerian Circuits is #P-Complete.
ALENEX/ANALCO 2005: 259-262 |
| 2004 |
|---|
| 34 | EE | Graham Brightwell,
Peter Winkler:
Note on Counting Eulerian Circuits
CoRR cs.CC/0405067: (2004) |
| 33 | EE | Graham Brightwell,
Peter Winkler:
A second threshold for the hard-core model on a Bethe lattice.
Random Struct. Algorithms 24(3): 303-314 (2004) |
| 2003 |
|---|
| 32 | | 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) |
| 31 | EE | Airat Bekmetjev,
Graham Brightwell,
Andrzej Czygrinow,
Glenn Hurlbert:
Thresholds for families of multisets, with an application to graph pebbling.
Discrete Mathematics 269(1-3): 21-34 (2003) |
| 30 | EE | Graham Brightwell,
Prasad Tetali:
The Number of Linear Extensions of the Boolean Lattice.
Order 20(4): 333-345 (2003) |
| 29 | EE | Béla Bollobás,
Graham Brightwell:
The number of k-SAT functions.
Random Struct. Algorithms 22(3): 227-247 (2003) |
| 2002 |
|---|
| 28 | EE | Graham Brightwell,
William T. Trotter:
A combinatorial approach to correlation inequalities.
Discrete Mathematics 257(2-3): 311-327 (2002) |
| 2000 |
|---|
| 27 | EE | Graham Brightwell,
Peter Winkler:
Gibbs Measures and Dismantlable Graphs.
J. Comb. Theory, Ser. B 78(1): 141-166 (2000) |
| 1999 |
|---|
| 26 | EE | Graham Brightwell:
Balanced pairs in partial orders.
Discrete Mathematics 201(1-3): 25-52 (1999) |
| 25 | EE | Graham Brightwell,
David A. Grable,
Hans Jürgen Prömel:
Forbidden induced partial orders.
Discrete Mathematics 201(1-3): 53-80 (1999) |
| 24 | EE | Béla Bollobás,
Graham Brightwell,
Alexander Sidorenko:
Geometrical Techniques for Estimating Numbers of Linear Extensions.
Eur. J. Comb. 20(5): 329-335 (1999) |
| 23 | EE | Graham Brightwell,
Peter Winkler:
Graph Homomorphisms and Phase Transitions.
J. Comb. Theory, Ser. B 77(2): 221-262 (1999) |
| 1997 |
|---|
| 22 | EE | Béla Bollobás,
Graham Brightwell:
Random Walks and Electrical Resistances in Products of Graphs.
Discrete Applied Mathematics 73(1): 69-79 (1997) |
| 21 | EE | Béla Bollobás,
Graham Brightwell:
The Structure of Random Graph Orders.
SIAM J. Discrete Math. 10(2): 318-335 (1997) |
| 20 | EE | Graham Brightwell,
William T. Trotter:
The Order Dimension of Planar Maps.
SIAM J. Discrete Math. 10(4): 515-528 (1997) |
| 1996 |
|---|
| 19 | EE | Graham Brightwell,
Hans Jürgen Prömel,
Angelika Steger:
The Average Number of Linear Extensions of a Partial Order.
J. Comb. Theory, Ser. A 73(2): 193-206 (1996) |
| 1995 |
|---|
| 18 | EE | Martin Anthony,
Graham Brightwell,
John Shawe-Taylor:
On Specifying Boolean Functions by Labelled Examples.
Discrete Applied Mathematics 61(1): 1-25 (1995) |
| 17 | EE | Martin Anthony,
Graham Brightwell,
Colin Cooper:
The vapnik-chervonenkis dimension of a random graph.
Discrete Mathematics 138(1-3): 43-56 (1995) |
| 16 | | Graham Brightwell:
Random Graph Orders Do Not Satisfy a 0-1 Law.
Random Struct. Algorithms 6(2/3): 231-238 (1995) |
| 1994 |
|---|
| 15 | EE | Graham Brightwell:
Linear extensions of random orders.
Discrete Mathematics 125(1-3): 87-96 (1994) |
| 1993 |
|---|
| 14 | | Béla Bollobás,
Graham Brightwell:
Cycles through specified vertices.
Combinatorica 13(2): 147-155 (1993) |
| 13 | | Graham Brightwell,
Yoshiharu Kohayakawa:
Ramsey Properties of Orientations of Graphs.
Random Struct. Algorithms 4(4): 413-428 (1993) |
| 12 | | Graham Brightwell,
Edward R. Scheinerman:
Representations of Planar Graphs.
SIAM J. Discrete Math. 6(2): 214-229 (1993) |
| 11 | | Graham Brightwell,
William T. Trotter:
The Order Dimension of Convex Polytopes.
SIAM J. Discrete Math. 6(2): 230-245 (1993) |
| 1992 |
|---|
| 10 | EE | Martin Anthony,
Graham Brightwell,
David A. Cohen,
John Shawe-Taylor:
On Exact Specification by Examples.
COLT 1992: 311-318 |
| 9 | | Graham Brightwell,
Teunis J. Ott,
Peter Winkler:
Target Shooting with Programmed Random Variables
STOC 1992: 691-698 |
| 8 | | Graham Brightwell,
Colin Wright:
The 1/3-2/3 Conjecture for 5-Thin Posets.
SIAM J. Discrete Math. 5(4): 467-474 (1992) |
| 1991 |
|---|
| 7 | | Graham Brightwell,
Peter Winkler:
Counting Linear Extensions is \#P-Complete
STOC 1991: 175-181 |
| 6 | EE | Graham Brightwell,
Jaroslav Nesetril:
Reorientations of covering graphs.
Discrete Mathematics 88(2-3): 129-132 (1991) |
| 1990 |
|---|
| 5 | | Graham Brightwell,
Peter Winkler:
Maximum itting Time for Random Wlaks on Graphs.
Random Struct. Algorithms 1(3): 263-276 (1990) |
| 4 | | Béla Bollobás,
Graham Brightwell:
Parallel Selection with High Probability.
SIAM J. Discrete Math. 3(1): 21-31 (1990) |
| 1989 |
|---|
| 3 | EE | Béla Bollobás,
Graham Brightwell:
Long cycles in graphs with no subgraphs of minimal degree 3.
Discrete Mathematics 75(1-3): 47-53 (1989) |
| 1988 |
|---|
| 2 | EE | Graham Brightwell:
Linear extensions of infinite posets.
Discrete Mathematics 70(2): 113-136 (1988) |
| 1 | | Béla Bollobás,
Graham Brightwell:
Transitive Orientations of Graphs.
SIAM J. Comput. 17(6): 1119-1133 (1988) |
