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