The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Graham Brightwell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Introduction. [Citation Graph (, )][DBLP]


  41. Average relational distance in linear extensions of posets. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002