Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam T. Trotter
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[i10]Piotr Micek, Heather C. Smith Blake, William T. Trotter:
Boolean dimension and dim-boundedness: Planar cover graph with a zero. CoRR abs/2206.06942 (2022)- 2021
- [j98]Csaba Biró, Bartlomiej Bosek
, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young:
Planar Posets that are Accessible from Below Have Dimension at Most 6. Order 38(1): 21-36 (2021) - [j97]Heather C. Smith, William T. Trotter:
Fractional Local Dimension. Order 38(2): 329-350 (2021) - 2020
- [j96]Bartlomiej Bosek, Jaroslaw Grytczuk, William T. Trotter:
Local Dimension is Unbounded for Planar Posets. Electron. J. Comb. 27(4): 4 (2020) - [j95]Fidel Barrera-Cruz, Thomas Prag, Heather C. Smith, Libby Taylor, William T. Trotter:
Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension. Order 37(2): 243-269 (2020) - [j94]Tamás Mészáros, Piotr Micek, William T. Trotter:
Boolean Dimension, Components and Blocks. Order 37(2): 287-298 (2020)
2010 – 2019
- 2019
- [j93]Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. J. Comb. Theory, Ser. B 138: 206-218 (2019) - [j92]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Dimension of posets with planar cover graphs excluding two long incomparable chains. J. Comb. Theory, Ser. A 164: 1-23 (2019) - [j91]Fidel Barrera-Cruz, Rebecca E. Garcia, Pamela E. Harris, Bethany Kubik, Heather C. Smith, Shannon Talbott, Libby Taylor, William T. Trotter:
The Graph of Critical Pairs of a Crown. Order 36(3): 621-652 (2019) - [i9]Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. CoRR abs/1907.00380 (2019) - 2018
- [j90]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j89]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. 61: 415-420 (2017) - [j88]William T. Trotter, Bartosz Walczak:
Boolean Dimension and Local Dimension. Electron. Notes Discret. Math. 61: 1047-1053 (2017) - [j87]Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert:
On the Dimension of Posets with Cover Graphs of Treewidth 2. Order 34(2): 185-234 (2017) - [i8]William T. Trotter, Bartosz Walczak:
Boolean dimension and local dimension. CoRR abs/1705.09167 (2017) - [i7]Bartlomiej Bosek, Jaroslaw Grytczuk, William T. Trotter:
Local Dimension is Unbounded for Planar Posets. CoRR abs/1712.06099 (2017) - 2016
- [j86]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - [j85]Hal A. Kierstead, David A. Smith, William T. Trotter:
First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51: 236-254 (2016) - [j84]Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter:
Forcing Posets with Large Dimension to Contain Large Standard Examples. Graphs Comb. 32(3): 861-880 (2016) - [j83]Elad Cohen, Martin Charles Golumbic, William T. Trotter, Ruidong Wang:
Posets and VPG Graphs. Order 33(1): 39-49 (2016) - [j82]William T. Trotter, Ruidong Wang:
Dimension and Matchings in Comparability and Incomparability Graphs. Order 33(1): 101-119 (2016) - [j81]William T. Trotter, Ruidong Wang:
Planar Posets, Dimension, Breadth and the Number of Minimal Elements. Order 33(2): 333-346 (2016) - [i6]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang:
The dimension of posets with planar cover graphs excluding two long incomparable chains. CoRR abs/1608.08843 (2016) - 2015
- [j80]Stefan Felsner, William T. Trotter, Veit Wiechert:
The Dimension of Posets with Planar Cover Graphs. Graphs Comb. 31(4): 927-939 (2015) - [i5]William T. Trotter, Bartosz Walczak, Ruidong Wang:
Dimension and cut vertices: an application of Ramsey theory. CoRR abs/1505.08162 (2015) - 2014
- [j79]Noah Streib, William T. Trotter:
Dimension and height for posets with planar cover graphs. Eur. J. Comb. 35: 474-489 (2014) - [j78]Noah Streib, William T. Trotter:
Hamiltonian Cycles and Symmetric Chains in Boolean Lattices. Graphs Comb. 30(6): 1565-1586 (2014) - [j77]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory, Ser. B 105: 6-10 (2014) - [j76]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. J. Comb. Theory, Ser. A 128: 41-55 (2014) - [j75]William T. Trotter, Ruidong Wang:
Incidence Posets and Cover Graphs. Order 31(2): 279-287 (2014) - 2013
- [j74]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [j73]Stefan Felsner, Tomasz Krawczyk, William T. Trotter:
On-Line Dimension for Posets Excluding Two Long Incomparable Chains. Order 30(1): 1-12 (2013) - [p1]William T. Trotter:
Applications of the Probabilistic Method to Partially Ordered Sets. The Mathematics of Paul Erdős II 2013: 313-329 - [i4]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013) - 2012
- [i3]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. CoRR abs/1205.1824 (2012) - [i2]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i1]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012) - 2011
- [j72]Csaba Biró, William T. Trotter:
A combinatorial approach to height sequences in finite partially ordered sets. Discret. Math. 311(7): 563-569 (2011) - [j71]Noah Streib, William T. Trotter:
Dimension and Height for Posets with Planar Cover Graphs. Electron. Notes Discret. Math. 38: 807-812 (2011) - 2010
- [j70]Csaba Biró, William T. Trotter:
Segment Orders. Discret. Comput. Geom. 43(3): 680-704 (2010) - [j69]Stefan Felsner, Ching Man Li, William T. Trotter:
Adjacency posets of planar graphs. Discret. Math. 310(5): 1097-1104 (2010) - [j68]David M. Howard, William T. Trotter:
On the size of maximal antichains and the number of pairwise disjoint maximal chains. Discret. Math. 310(21): 2890-2894 (2010) - [j67]Csaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young:
Interval partitions and Stanley depth. J. Comb. Theory, Ser. A 117(4): 475-482 (2010) - [j66]Cornelia Dangelmayr, Stefan Felsner, William T. Trotter:
Intersection Graphs of Pseudosegments: Chordal Graphs. J. Graph Algorithms Appl. 14(2): 199-220 (2010)
2000 – 2009
- 2007
- [j65]Alice M. Dean, William S. 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
- [j64]Stefan Felsner, William T. Trotter:
Posets and planar graphs. J. Graph Theory 49(4): 273-284 (2005) - [c5]Alice M. Dean, William S. 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. GD 2005: 73-82 - 2002
- [j63]Peter C. Fishburn, William T. Trotter:
Containment orders for similar ellipses with a common center. Discret. Math. 256(1-2): 129-136 (2002) - [j62]Graham R. Brightwell, William T. Trotter:
A combinatorial approach to correlation inequalities. Discret. Math. 257(2-3): 311-327 (2002) - [j61]Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter:
A Note on Graph Pebbling. Graphs Comb. 18(2): 219-225 (2002) - 2001
- [j60]Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. Electron. J. Comb. 8(1) (2001) - [j59]Henry A. Kierstead, William T. Trotter:
Competitive Colorings of Oriented Graphs. Electron. J. Comb. 8(2) (2001) - 2000
- [j58]Henry A. Kierstead, William T. Trotter:
Interval orders and dimension. Discret. Math. 213(1-3): 179-188 (2000) - [j57]Stefan Felsner, William T. Trotter:
Dimension, Graph and Hypergraph Coloring. Order 17(2): 167-177 (2000)
1990 – 1999
- 1999
- [j56]Peter C. Fishburn, William T. Trotter:
Split semiorders. Discret. Math. 195(1-3): 111-126 (1999) - [j55]William T. Trotter:
Editorial. Discret. Math. 201(1-3): 1-3 (1999) - [j54]Geir Agnarsson, Stefan Felsner, William T. Trotter:
The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discret. Math. 201(1-3): 5-19 (1999) - [j53]Stefan Felsner, Peter C. Fishburn, William T. Trotter:
Finite three dimensional partial orders which are not sphere orders. Discret. Math. 201(1-3): 101-132 (1999) - [j52]William T. Trotter:
Combinatorial Aspects of Interval Orders and Interval Graphs. Electron. Notes Discret. Math. 2: 153 (1999) - 1998
- [j51]William T. Trotter, Peter Winkler:
Ramsey Theory and Sequences of Random Variables. Comb. Probab. Comput. 7(2): 221-238 (1998) - 1997
- [j50]Graham R. Brightwell, William T. Trotter:
The Order Dimension of Planar Maps. SIAM J. Discret. Math. 10(4): 515-528 (1997) - [c4]William T. Trotter:
Ramsey theory and partially ordered sets. Contemporary Trends in Discrete Mathematics 1997: 337-347 - 1995
- [j49]Stefan Felsner, William T. Trotter:
Colorings of diagrams of interval orders and alpha-sequences of sets. Discret. Math. 144(1-3): 23-31 (1995) - [j48]Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. SIAM J. Discret. Math. 8(4): 485-498 (1995) - 1994
- [j47]Richard A. Brualdi, Hyung Chan Jung, William T. Trotter:
On the poset of all posets on n elements. Discret. Appl. Math. 50(2): 111-123 (1994) - [j46]Stefan Felsner, William T. Trotter:
On the fractional dimension of partially ordered sets. Discret. Math. 136(1-3): 101-117 (1994) - [j45]Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line Coloring and Recursive Graph Theory. SIAM J. Discret. Math. 7(1): 72-89 (1994) - 1993
- [j44]James H. Schmerl, William T. Trotter:
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discret. Math. 113(1-3): 191-205 (1993) - [j43]Peter Horák, He Qing, William T. Trotter:
Induced matchings in cubic graphs. J. Graph Theory 17(2): 151-160 (1993) - [j42]Graham R. Brightwell, William T. Trotter:
The Order Dimension of Convex Polytopes. SIAM J. Discret. Math. 6(2): 230-245 (1993) - [e1]William T. Trotter:
Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 9, DIMACS/AMS 1993, ISBN 978-0-8218-6600-9 [contents] - 1992
- [j41]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. Discret. Comput. Geom. 7: 1-11 (1992) - [j40]Hal A. Kierstead, William T. Trotter:
Colorful induced subgraphs. Discret. Math. 101(1-3): 165-169 (1992) - [j39]Peter C. Fishburn, William T. Trotter:
Linear extensions of semiorders: a maximization problem. Discret. Math. 103(1): 25-40 (1992) - [j38]Madeleine Paoli, G. W. Peck, William T. Trotter, Douglas B. West:
Large regular graphs with no induced 2K2. Graphs Comb. 8(2): 165-197 (1992) - [j37]Peter C. Fishburn, William T. Trotter:
Dimensions of hypergraphs. J. Comb. Theory, Ser. B 56(2): 278-295 (1992) - 1991
- [j36]Dwight Duffus, Hal A. Kierstead, William T. Trotter:
Fibres and ordered set coloring. J. Comb. Theory, Ser. A 58(1): 158-164 (1991) - [j35]Paul Erdös, Henry A. Kierstead, William T. Trotter:
The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991) - [c3]Hal A. Kierstead, William T. Trotter:
On-line Graph Coloring. On-Line Algorithms 1991: 85-92 - [c2]Hal A. Kierstead, William T. Trotter:
Planar Graph Coloring with an Uncooperative Partner. Planar Graphs 1991: 85-93 - 1990
- [j34]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. Discret. Math. 81(2): 129-135 (1990)
1980 – 1989
- 1989
- [j33]László Lovász, Michael E. Saks, William T. Trotter:
An on-line graph coloring algorithm with sublinear performance ratio. Discret. Math. 75(1-3): 319-325 (1989) - 1988
- [j32]Clyde L. Monma, Bruce A. Reed, William T. Trotter:
Threshold tolerance graphs. J. Graph Theory 12(3): 343-362 (1988) - 1987
- [j31]Hal A. Kierstead, William T. Trotter:
A Ramsey theoretic problem for finite ordered sets. Discret. Math. 63(2-3): 217-223 (1987) - [j30]William T. Trotter, Douglas B. West:
Poset boxicity of graphs. Discret. Math. 64(1): 105-107 (1987) - [j29]Vojtech Rödl, William T. Trotter:
A note on ranking functions. Discret. Math. 67(3): 307-309 (1987) - 1985
- [j28]William T. Trotter:
The dimension of the Cartesian product of partial orders. Discret. Math. 53: 255-263 (1985) - 1984
- [j27]Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor:
Regressions and monotone chains: a ramsey - type extermal problem for partial orders. Comb. 4(1): 117-119 (1984) - [j26]Henry A. Kierstead, Endre Szemerédi, William T. Trotter:
On coloring graphs with locally small chromatic number. Comb. 4(2): 183-185 (1984) - [j25]Laurie B. Hopkins, William T. Trotter, Douglas B. West:
The interval number of a complete multipartite graph. Discret. Appl. Math. 8(2): 163-187 (1984) - [j24]Martin Charles Golumbic, Clyde L. Monma, William T. Trotter:
Tolerance graphs. Discret. Appl. Math. 9(2): 157-170 (1984) - [j23]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
- [j22]Endre Szemerédi, William T. Trotter:
Extremal problems in discrete geometry. Comb. 3(3): 381-392 (1983) - [j21]Endre Szemerédi, William T. Trotter:
A Combinatorial Distinction Between the Euclidean and Projective Planes. Eur. J. Comb. 4(4): 385-394 (1983) - [j20]C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter:
The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory, Ser. B 34(3): 239-243 (1983) - [c1]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 - 1982
- [j19]William T. Trotter, Ted R. Monroe:
A combinatorial problem involving graphs and matrices. Discret. Math. 39(1): 87-101 (1982) - 1981
- [j18]William T. Trotter:
Stacks and splits of partially ordered sets. Discret. Math. 35(1-3): 229-256 (1981) - 1980
- [j17]Stephen B. Maurer, I. Rabinovitch, William T. Trotter:
Large minimal realizers of a partial order II. Discret. Math. 31(3): 297-313 (1980) - [j16]Stephen B. Maurer, Issie Rabinovich, William T. Trotter:
A generalization of Turán's theorem to directed graphs. Discret. Math. 32(2): 167-189 (1980)
1970 – 1979
- 1979
- [j15]William T. Trotter:
A characterization of robert's inequality for boxicity. Discret. Math. 28(3): 303-313 (1979) - [j14]William T. Trotter, Frank Harary:
On double and multiple interval graphs. J. Graph Theory 3(3): 205-211 (1979) - 1978
- [j13]William T. Trotter, Paul Erdös:
When the cartesian product of directed cycles is Hamiltonian. J. Graph Theory 2(2): 137-142 (1978) - 1977
- [j12]William T. Trotter, John I. Moore Jr.:
The dimension of planar posets. J. Comb. Theory, Ser. B 22(1): 54-67 (1977) - 1976
- [j11]William T. Trotter, John I. Moore Jr.:
Some theorems on graphs and posets. Discret. Math. 15(1): 79-84 (1976) - [j10]William T. Trotter, Kenneth P. Bogart:
Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension. Discret. Math. 15(4): 389-400 (1976) - [j9]William T. Trotter, Kenneth P. Bogart:
On the complexity of posets. Discret. Math. 16(1): 71-82 (1976) - [j8]William T. Trotter, John I. Moore Jr.:
Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discret. Math. 16(4): 361-381 (1976) - [j7]William T. Trotter:
A Generalization of Hiraguchi's: Inequality for Posets. J. Comb. Theory, Ser. A 20(1): 114-123 (1976) - [j6]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) - [j5]William T. Trotter:
A Forbidden Subposet Characterization of an Order-Dimension Inequality. Math. Syst. Theory 10: 91-96 (1976) - 1975
- [j4]William T. Trotter:
Embedding finite posets in cubes. Discret. Math. 12(2): 165-172 (1975) - 1974
- [j3]William T. Trotter:
Dimension of the crown Skn. Discret. Math. 8(1): 85-103 (1974) - [j2]William T. Trotter:
Irreducible Posets with Large Height Exist. J. Comb. Theory, Ser. A 17(3): 337-344 (1974) - 1973
- [j1]Kenneth P. Bogart, William T. Trotter:
Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n. Discret. Math. 5(1): 33-43 (1973)
Coauthor Index
Hal A. Kierstead
aka: Henry A. Kierstead
aka: Henry A. Kierstead
78</