The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William T. Trotter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
    On Determinism versus Non-Determinism and Related Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:429-438 [Conf]
  2. Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter
    Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:73-82 [Conf]
  3. Henry A. Kierstead, Endre Szemerédi, William T. Trotter
    On coloring graphs with locally small chromatic number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:183-185 [Journal]
  4. Endre Szemerédi, William T. Trotter
    Extremal problems in discrete geometry. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:3, pp:381-392 [Journal]
  5. Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor
    Regressions and monotone chains: a ramsey - type extermal problem for partial orders. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:117-119 [Journal]
  6. Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
    Spanning Trees of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  7. Henry A. Kierstead, William T. Trotter
    Competitive Colorings of Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  8. William T. Trotter, Peter Winkler
    Ramsey Theory and Sequences of Random Variables. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:221-238 [Journal]
  9. Richard A. Brualdi, Hyung Chan Jung, William T. Trotter
    On the poset of all posets on n elements. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:111-123 [Journal]
  10. Fan R. K. Chung, Endre Szemerédi, William T. Trotter
    The Number of Different Distances Determined by a Set of Points in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:1-11 [Journal]
  11. 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]
  12. Peter C. Fishburn, William T. Trotter
    Containment orders for similar ellipses with a common center. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:129-136 [Journal]
  13. Henry A. Kierstead, William T. Trotter
    Interval orders and dimension. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:179-188 [Journal]
  14. Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
    A Note on Graph Pebbling. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:219-225 [Journal]
  15. Kenneth P. Bogart, Issie Rabinovich, William T. Trotter
    A Bound on the Dimension of Interval Orders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:3, pp:319-328 [Journal]
  16. Dwight Duffus, Hal A. Kierstead, William T. Trotter
    Fibres and ordered set coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:158-164 [Journal]
  17. Peter C. Fishburn, William T. Trotter
    Dimensions of hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:278-295 [Journal]
  18. Jerrold R. Griggs, Jürgen Stahl, William T. Trotter
    A Sperner Theorem on Unrelated Chains of Subsets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:36, n:1, pp:124-127 [Journal]
  19. William T. Trotter
    Irreducible Posets with Large Height Exist. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:3, pp:337-344 [Journal]
  20. William T. Trotter
    A Generalization of Hiraguchi's: Inequality for Posets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:1, pp:114-123 [Journal]
  21. William T. Trotter, John I. Moore
    The dimension of planar posets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:1, pp:54-67 [Journal]
  22. William T. Trotter
    A Forbidden Subposet Characterization of an Order-Dimension Inequality. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1976, v:10, n:, pp:91-96 [Journal]
  23. Stefan Felsner, William T. Trotter
    Dimension, Graph and Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:2, pp:167-177 [Journal]
  24. Paul Erdös, Henry A. Kierstead, William T. Trotter
    The Dimension of Random Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:3, pp:254-276 [Journal]
  25. 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]
  26. 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]
  27. Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
    On-Line Coloring and Recursive Graph Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:72-89 [Journal]
  28. Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
    On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:485-498 [Journal]
  29. Stefan Felsner, William T. Trotter
    Posets and planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:273-284 [Journal]
  30. Stephen B. Maurer, Issie Rabinovich, William T. Trotter
    A generalization of Turán's theorem to directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:2, pp:167-189 [Journal]
  31. Stephen B. Maurer, I. Rabinovitch, William T. Trotter
    Large minimal realizers of a partial order II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:3, pp:297-313 [Journal]
  32. William T. Trotter
    Stacks and splits of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:229-256 [Journal]
  33. William T. Trotter, Ted R. Monroe
    A combinatorial problem involving graphs and matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:1, pp:87-101 [Journal]
  34. William T. Trotter
    The dimension of the Cartesian product of partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:53, n:, pp:255-263 [Journal]
  35. Hal A. Kierstead, William T. Trotter
    A Ramsey theoretic problem for finite ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:217-223 [Journal]
  36. William T. Trotter, Douglas B. West
    Poset boxicity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:105-107 [Journal]
  37. Vojtech Rödl, William T. Trotter
    A note on ranking functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:3, pp:307-309 [Journal]
  38. László Lovász, Michael E. Saks, William T. Trotter
    An on-line graph coloring algorithm with sublinear performance ratio. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:319-325 [Journal]
  39. Geir Agnarsson, Stefan Felsner, William T. Trotter
    The maximum number of edges in a graph of bounded dimension, with applications to ring theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:5-19 [Journal]
  40. William T. Trotter
    Editorial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:1-3 [Journal]
  41. Stefan Felsner, Peter C. Fishburn, William T. Trotter
    Finite three dimensional partial orders which are not sphere orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:101-132 [Journal]
  42. Peter C. Fishburn, William T. Trotter
    Split semiorders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:111-126 [Journal]
  43. Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter
    The maximum number of edges in 2K2-free graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:129-135 [Journal]
  44. Hal A. Kierstead, William T. Trotter
    Colorful induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:165-169 [Journal]
  45. Peter C. Fishburn, William T. Trotter
    Linear extensions of semiorders: a maximization problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:25-40 [Journal]
  46. James H. Schmerl, William T. Trotter
    Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:191-205 [Journal]
  47. Stefan Felsner, William T. Trotter
    Colorings of diagrams of interval orders and alpha-sequences of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:144, n:1-3, pp:23-31 [Journal]
  48. Stefan Felsner, William T. Trotter
    On the fractional dimension of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:101-117 [Journal]

  49. Segment Orders. [Citation Graph (, )][DBLP]


  50. Adjacency posets of planar graphs. [Citation Graph (, )][DBLP]


  51. On the size of maximal antichains and the number of pairwise disjoint maximal chains. [Citation Graph (, )][DBLP]


Search in 0.507secs, Finished in 0.511secs
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