William T. Trotter

Publications Available On-Line

84. The order dimension of convex polytopes, SIAM J. Discrete Math. 6 (1993), 230-245 (with G. Brightwell).
86. Balancing pairs in partially ordered sets, in Combinatorics, Paul Erdos is Eighty, Bolyai Society Mathematical Studies, 1993, 145-157 (with S. Felsner).
89. On-line coloring and recursive graph theory, SIAM J. Discrete Math. 7 (1994), 72-89 (with H. Kierstead and S. Penrice).
93. On the fractional dimension of partially ordered sets, Discrete Math. 136 (1994), 101-117 (with S. Felsner).
94. The dimension of suborders of the boolean lattice, Order 11 (1994), 127- 134 (with G. Brightwell, H. Kierstead and A. Kostochka).
96. Colorings of diagrams of interval orders and alpha-sequences of sets, Discrete Math. 144 (1995), 23--31 (with S. Felsner).
97. Balancing pairs and the cross product conjecture, Order 12 (1995), 327--349 (with G. R. Brightwell and S. Felsner).
99. On-line and first fit coloring of graphs which do not induce P5, SIAM J. Discrete Math. 8 (1995), 485-498 (with H. Kierstead and S. Penrice).
100. Graphs and partially ordered sets: recent results and new directions, Congressus Numerantium 116 (1996), 253--278.
101. The order dimension of planar maps, SIAM J. Discrete Math. 10 (1997), 515--528 (with G. R. Brightwell).
102. Applications of the probabilistic method to partially ordered sets, in The Mathematics of Paul Erdos, II, R. L.Graham and J.Nesetril, eds., Algorithms and Combinatorics, Vol. 14, Springer Verlag, Berlin (1997), 214--228.
103. New perspectives on interval orders and interval graphs, in Surveys in Combinatorics, R. A. Bailey, ed., London Mathematical Society Lecture Note Series 241 (1997), 237--286.
104. Dimensions of split semiorders Order 14 (1997), 171--178 (with P. C. Fishburn).
105. Ramsey theory and sequences of random variables, Probability, Combinatorics and Computing 7 (1998), 221--238 (with P. M. Winkler).
106. Geometric containment orders: A survey, Order 15 (1998-99), 167--182 (with P. C. Fishburn).
107. Split semiorders, Discrete Math. 195 (1999), 111--126 (with P. C. Fishburn).
108. Finite three dimensional partial orders which are not sphere orders, Discrete Math. 201 (1999), 101--132 (with S. Felsner and P. C. Fishburn).
109. The maximum number of edges in a graph of bounded dimension, with applications to ring theory, Discrete Math. 201 (1999), 5--19 (with G. Agnarsson and S. Felsner).
110. Ramsey theory and partially ordered sets, in Contemporary Trends in Discrete Mathmatics, R. L. Graham, et al., eds., Dimacs Series in Discrete Mathematics and Theoretical Computer Science 49 (1999), 337--347.
111. Interval orders and dimension, Discrete Math. 213 (2000); 179-188 (with H. Kierstead).
112. Dimension, graph and hypergraph coloring, Order 17 (2000) 167-177 (with Stefan Felsner).
113. Spanning trees of bounded degree, Electronic Journal of Combinatorics 8 (2001) no. 1, Research Paper 33 (with A. Czygrinow, G. Fan, G. Hurlbert and H. Kierstead).
114. Competitive colorings of oriented graphs, Electronic Journal of Combinatorics 8 (2001) no.2, Research Paper 12 (with H. A. Kierstead).
115. A Note on Graph Pebbling, Graphs and Combinatorics 18 (2002), 219 - 225 (with A. Czygrinow, G. Hurlbert and H. Kierstead).
116. Containment orders for similar ellipses with a common center, Discrete Math. 256 (2002), 129 - 136 (with Peter Fishburn).
117. A new approach to correlation inequalities, Discrete Math. 257 (2002), 311 - 327 (with G. R. Brightwell).
118. Posets and Planar Graphs, J. Graph Theory 47 (2005), 273--284 (with Stefan Felsner).
119. Bar k -Visibility Graphs, J. Graph Algorithms, to appear (with A. Dean, W. Evans, E. Gethner, J. Laison and M. Safari).

Updated January 20, 2007.