William T. Trotter - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 104

2024

Dimension is polynomial in height for posets with planar cover graphsJakub Kozik, Piotr Micek, William T. Trotter. jctb, 165:164-196, March 2024. [doi]

2021

Planar Posets that are Accessible from Below Have Dimension at Most 6Csaba Biró, Bartlomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young. order, 38(1):21-36, 2021. [doi]

Fractional Local DimensionHeather C. Smith, William T. Trotter. order, 38(2):329-350, 2021. [doi]

2020

2019

2018

Burling Graphs, Chromatic Number, and Orthogonal Tree-DecompositionsStefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert. combinatorics, 25(1):1, 2018. [doi]

2017

Burling graphs, chromatic number, and orthogonal tree-decompositionsStefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert. endm, 61:415-420, 2017. [doi]

On the Dimension of Posets with Cover Graphs of Treewidth 2Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert. order, 34(2):185-234, 2017. [doi]

Boolean Dimension and Local DimensionWilliam T. Trotter, Bartosz Walczak. endm, 61:1047-1053, 2017. [doi]

2016

Forcing Posets with Large Dimension to Contain Large Standard ExamplesCsaba Biró, Peter Hamburger, Attila Pór, William T. Trotter. gc, 32(3):861-880, 2016. [doi]

Posets and VPG GraphsElad Cohen, Martin Charles Golumbic, William T. Trotter, Ruidong Wang. order, 33(1):39-49, 2016. [doi]

Tree-width and dimensionGwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang. combinatorica, 36(4):431-450, 2016. [doi]

First-fit coloring on interval graphs has performance ratio at least 5Hal A. Kierstead, David A. Smith, William T. Trotter. ejc, 51:236-254, 2016. [doi]

Dimension and Matchings in Comparability and Incomparability GraphsWilliam T. Trotter, Ruidong Wang. order, 33(1):101-119, 2016. [doi]

Planar Posets, Dimension, Breadth and the Number of Minimal ElementsWilliam T. Trotter, Ruidong Wang. order, 33(2):333-346, 2016. [doi]

2015

The Dimension of Posets with Planar Cover GraphsStefan Felsner, William T. Trotter, Veit Wiechert. gc, 31(4):927-939, 2015. [doi]

2014

An extremal problem on crossing vectorsMichal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak. JCT, 128:41-55, 2014. [doi]

Triangle-free intersection graphs of line segments with large chromatic numberArkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak. JCT, 105:6-10, 2014. [doi]

Hamiltonian Cycles and Symmetric Chains in Boolean LatticesNoah Streib, William T. Trotter. gc, 30(6):1565-1586, 2014. [doi]

Dimension and height for posets with planar cover graphsNoah Streib, William T. Trotter. ejc, 35:474-489, 2014. [doi]

Incidence Posets and Cover GraphsWilliam T. Trotter, Ruidong Wang. order, 31(2):279-287, 2014. [doi]

2013

On-Line Dimension for Posets Excluding Two Long Incomparable ChainsStefan Felsner, Tomasz Krawczyk, William T. Trotter. order, 30(1):1-12, 2013. [doi]

Triangle-Free Geometric Intersection Graphs with Large Chromatic NumberArkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak. dcg, 50(3):714-726, 2013. [doi]

Applications of the Probabilistic Method to Partially Ordered SetsWilliam T. Trotter. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 313-329, Springer, 2013. [doi]

2011

A combinatorial approach to height sequences in finite partially ordered setsCsaba Biró, William T. Trotter. DM, 311(7):563-569, 2011. [doi]

Dimension and Height for Posets with Planar Cover GraphsNoah Streib, William T. Trotter. endm, 38:807-812, 2011. [doi]

2010

Segment OrdersCsaba BirÃ³, William T. Trotter. dcg, 43(3):680-704, 2010. [doi]

Interval partitions and Stanley depthCsaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young. JCT, 117(4):475-482, 2010. [doi]

Intersection Graphs of Pseudosegments: Chordal GraphsCornelia Dangelmayr, Stefan Felsner, William T. Trotter. jgaa, 14(2):199-220, 2010. [doi]

Adjacency posets of planar graphsStefan Felsner, Ching Man Li, William T. Trotter. DM, 310(5):1097-1104, 2010. [doi]

On the size of maximal antichains and the number of pairwise disjoint maximal chainsDavid M. Howard, William T. Trotter. DM, 310(21):2890-2894, 2010. [doi]

2007

Bar k-Visibility GraphsAlice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter. jgaa, 11(1):45-59, 2007. [doi]

2005

Bar ::::k::::-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and ThicknessAlice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter. gd 2006: 73-82 [doi]

Posets and planar graphsStefan Felsner, William T. Trotter. jgt, 49(4):273-284, 2005. [doi]

2002

A combinatorial approach to correlation inequalitiesGraham Brightwell, William T. Trotter. DM, 257(2-3):311-327, 2002. [doi]

A Note on Graph PebblingAndrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter. gc, 18(2):219-225, 2002. [doi]

Containment orders for similar ellipses with a common centerPeter C. Fishburn, William T. Trotter. DM, 256(1-2):129-136, 2002. [doi]

2001

Spanning Trees of Bounded DegreeAndrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter. combinatorics, 8(1), 2001. [doi]

Competitive Colorings of Oriented GraphsHenry A. Kierstead, William T. Trotter. combinatorics, 8(2), 2001. [doi]

2000

Dimension, Graph and Hypergraph ColoringStefan Felsner, William T. Trotter. order, 17(2):167-177, 2000. [doi]

Interval orders and dimensionHenry A. Kierstead, William T. Trotter. DM, 213(1-3):179-188, 2000. [doi]

1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theoryGeir Agnarsson, Stefan Felsner, William T. Trotter. DM, 201(1-3):5-19, 1999. [doi]

Finite three dimensional partial orders which are not sphere ordersStefan Felsner, Peter C. Fishburn, William T. Trotter. DM, 201(1-3):101-132, 1999. [doi]

Split semiordersPeter C. Fishburn, William T. Trotter. DM, 195(1-3):111-126, 1999. [doi]

EditorialWilliam T. Trotter. DM, 201(1-3):1-3, 1999. [doi]

Combinatorial Aspects of Interval Orders and Interval GraphsWilliam T. Trotter. endm, 2:153, 1999. [doi]

1998

Ramsey Theory and Sequences of Random VariablesWilliam T. Trotter, Peter Winkler. cpc, 7(2):221-238, 1998.

1997

The Order Dimension of Planar MapsGraham Brightwell, William T. Trotter. siamdm, 10(4):515-528, 1997. [doi]

Ramsey theory and partially ordered setsWilliam T. Trotter. dimacs 1999: 337-348

1995

Colorings of diagrams of interval orders and alpha-sequences of setsStefan Felsner, William T. Trotter. DM, 144(1-3):23-31, 1995. [doi]

On-Line and First-Fit Coloring of Graphs That Do Not Induce P::5::Henry A. Kierstead, Stephen G. Penrice, William T. Trotter. siamdm, 8(4):485-498, 1995. [doi]

1994

On the poset of all posets on n elementsRichard A. Brualdi, Hyung Chan Jung, William T. Trotter. DAM, 50(2):111-123, 1994.

On the fractional dimension of partially ordered setsStefan Felsner, William T. Trotter. DM, 136(1-3):101-117, 1994. [doi]

On-Line Coloring and Recursive Graph TheoryHenry A. Kierstead, Stephen G. Penrice, William T. Trotter. siamdm, 7(1):72-89, 1994. [doi]

1993

The Order Dimension of Convex PolytopesGraham Brightwell, William T. Trotter. siamdm, 6(2):230-245, 1993.

Induced matchings in cubic graphsPeter Horák, He Qing, William T. Trotter. jgt, 17(2):151-160, 1993. [doi]

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structuresJames H. Schmerl, William T. Trotter. DM, 113(1-3):191-205, 1993. [doi]

1992

The Number of Different Distances Determined by a Set of Points in the Euclidean PlaneFan R. K. Chung, Endre Szemerédi, William T. Trotter. dcg, 7:1-11, 1992.

Dimensions of hypergraphsPeter C. Fishburn, William T. Trotter. JCT, 56(2):278-295, 1992. [doi]

Linear extensions of semiorders: a maximization problemPeter C. Fishburn, William T. Trotter. DM, 103(1):25-40, 1992. [doi]

Colorful induced subgraphsHal A. Kierstead, William T. Trotter. DM, 101(1-3):165-169, 1992. [doi]

2Madeleine Paoli, G. W. Peck, William T. Trotter, Douglas B. West. gc, 8(2):165-197, 1992. [doi]

1991

Fibres and ordered set coloringDwight Duffus, Hal A. Kierstead, William T. Trotter. JCT, 58(1):158-164, 1991. [doi]

The Dimension of Random Ordered SetsPaul Erdös, Henry A. Kierstead, William T. Trotter. rsa, 2(3):254-276, 1991.

On-line Graph ColoringHal A. Kierstead, William T. Trotter. dimacs 1992: 85-92

Planar Graph Coloring with an Uncooperative PartnerHal A. Kierstead, William T. Trotter. dimacs 1993: 85-94

1990

The maximum number of edges in 2K::2::-free graphs of bounded degreeFan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter. DM, 81(2):129-135, 1990. [doi]

1989

An on-line graph coloring algorithm with sublinear performance ratioLászló Lovász, Michael E. Saks, William T. Trotter. DM, 75(1-3):319-325, 1989. [doi]

1988

Threshold tolerance graphsClyde L. Monma, Bruce Reed, William T. Trotter. jgt, 12(3):343-362, 1988. [doi]

1987

A Ramsey theoretic problem for finite ordered setsHal A. Kierstead, William T. Trotter. DM, 63(2-3):217-223, 1987. [doi]

A note on ranking functionsVojtech Rödl, William T. Trotter. DM, 67(3):307-309, 1987. [doi]

Poset boxicity of graphsWilliam T. Trotter, Douglas B. West. DM, 64(1):105-107, 1987. [doi]

1985

The dimension of the Cartesian product of partial ordersWilliam T. Trotter. DM, 53:255-263, 1985. [doi]

1984

Tolerance graphsMartin Charles Golumbic, Clyde L. Monma, William T. Trotter. DAM, 9(2):157-170, 1984. [doi]

A Sperner Theorem on Unrelated Chains of SubsetsJerrold R. Griggs, Jürgen Stahl, William T. Trotter. JCT, 36(1):124-127, 1984.

The interval number of a complete multipartite graphLaurie B. Hopkins, William T. Trotter, Douglas B. West. DAM, 8(2):163-187, 1984. [doi]

On coloring graphs with locally small chromatic numberHenry A. Kierstead, Endre Szemerédi, William T. Trotter. combinatorica, 4(2):183-185, 1984.

Regressions and monotone chains: a ramsey - type extermal problem for partial ordersDouglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor. combinatorica, 4(1):117-119, 1984.

1983

On Determinism versus Non-Determinism and Related Problems (Preliminary Version)Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter. focs 1983: 429-438

Extremal problems in discrete geometryEndre Szemerédi, William T. Trotter. combinatorica, 3(3):381-392, 1983.

A Combinatorial Distinction Between the Euclidean and Projective PlanesEndre Szemerédi, William T. Trotter. ejc, 4(4):385-394, 1983. [doi]

1982

A combinatorial problem involving graphs and matricesWilliam T. Trotter, Ted R. Monroe. DM, 39(1):87-101, 1982. [doi]

1981

Stacks and splits of partially ordered setsWilliam T. Trotter. DM, 35(1-3):229-256, 1981. [doi]

1980

A generalization of Turán s theorem to directed graphsStephen B. Maurer, Issie Rabinovich, William T. Trotter. DM, 32(2):167-189, 1980. [doi]

Large minimal realizers of a partial order IIStephen B. Maurer, I. Rabinovitch, William T. Trotter. DM, 31(3):297-313, 1980. [doi]

1979

On double and multiple interval graphsWilliam T. Trotter, Frank Harary. jgt, 3(3):205-211, 1979. [doi]

A characterization of robert's inequality for boxicityWilliam T. Trotter. DM, 28(3):303-313, 1979. [doi]

1978

When the cartesian product of directed cycles is HamiltonianWilliam T. Trotter, Paul Erdös. jgt, 2(2):137-142, 1978. [doi]

1977

The dimension of planar posetsWilliam T. Trotter, John I. Moore. JCT, 22(1):54-67, 1977. [doi]

1976

A Bound on the Dimension of Interval OrdersKenneth P. Bogart, Issie Rabinovich, William T. Trotter. JCT, 21(3):319-328, 1976.

Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimensionWilliam T. Trotter, Kenneth P. Bogart. DM, 15(4):389-400, 1976. [doi]

A Generalization of Hiraguchi s: Inequality for PosetsWilliam T. Trotter. JCT, 20(1):114-123, 1976.

On the complexity of posetsWilliam T. Trotter, Kenneth P. Bogart. DM, 16(1):71-82, 1976. [doi]

A Forbidden Subposet Characterization of an Order-Dimension InequalityWilliam T. Trotter. mst, 10:91-96, 1976.

Some theorems on graphs and posetsWilliam T. Trotter, John I. Moore Jr.. DM, 15(1):79-84, 1976. [doi]

Characterization problems for graphs, partially ordered sets, lattices, and families of setsWilliam T. Trotter, John I. Moore Jr.. DM, 16(4):361-381, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL