An Analog of Schensted's Algorithm for Shifted Young Tableaux. - Bruce E. Sagan (J. Comb. Theory A, 1979)

Congruences Derived from Group Action. - Gian-Carlo Rota; Bruce E. Sagan (Eur. J. Comb., 1980)

On Selecting a Random Shifted Young Tableau. - Bruce E. Sagan (J. Algorithms, 1980)

From sets to functions: Three elementary examples. - S. A. Joni; Gian-Carlo Rota; Bruce E. Sagan (Discret. Math., 1981)

Enumeration of Partitions with Hooklengths. - Bruce E. Sagan (Eur. J. Comb., 1982)

A note on Abel polynomials and rooted labeled forests. - Bruce E. Sagan (Discret. Math., 1983)

Bijective proofs of two broken circuit theorems. - Andreas Blass; Bruce E. Sagan (J. Graph Theory, 1986)

Shifted tableaux, schur Q-functions, and a conjecture of R. Stanley. - Bruce E. Sagan (J. Comb. Theory A, 1987)

On Enhancing Hypercube Multiprocessors. - Abdol-Hossein Esfahanian; Lionel M. Ni; Bruce E. Sagan (ICPP (1), 1988)

Inductive and injective proofs of log concavity results. - Bruce E. Sagan (Discret. Math., 1988)

A Note on Independent Sets in Trees. - Bruce E. Sagan (SIAM J. Discret. Math., 1988)

Robinson-schensted algorithms for skew tableaux. - Bruce E. Sagan; Richard P. Stanley (J. Comb. Theory A, 1990)

The symmetric group - representations, combinatorial algorithms, and symmetric functions. - Bruce E. Sagan (Wadsworth, 1991)

A maj Statistic for Set Partitions. - Bruce E. Sagan (Eur. J. Comb., 1991)

The Twisted N-Cube with Application to Multiprocessing. - Abdol-Hossein Esfahanian; Lionel M. Ni; Bruce E. Sagan (IEEE Trans. Computers, 1991)

Inductive proofs of q-log concavity. - Bruce E. Sagan (Discret. Math., 1992)

Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions. - Bruce E. Sagan (Theor. Comput. Sci., 1993)

Maximizing Möbius functions on subsets of Boolean algebras. - Bruce E. Sagan; Yeong-Nan Yeh; Günter M. Ziegler (Discret. Math., 1994)

A relative of the Thue-Morse sequence. - Jean-Paul Allouche; André Arnold; Jean Berstel; Srecko Brlek; William Jockusch; Simon Plouffe; Bruce E. Sagan (Discret. Math., 1995)

La correspondance de Robinson-Schensted pour les tableaux oscillants gauches. - Serge Dulucq; Bruce E. Sagan (Discret. Math., 1995)

A Generalization of Semimodular Supersolvable Lattices. - Curtis D. Bennett; Bruce E. Sagan (J. Comb. Theory A, 1995)

Enumeration of trees by inversions. - Ira M. Gessel; Bruce E. Sagan; Yeong-Nan Yeh (J. Graph Theory, 1995)

The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions. - Ira M. Gessel; Bruce E. Sagan (Electron. J. Comb., 1996)

Unimodality and the Reflection Principle. - Bruce E. Sagan (Ars Comb., 1998)

Counting Methods. - Jay Yellen; Edward W. Packel; Robert G. Rieper; George E. Andrews; Alan C. Tucker; Edward A. Bender; Bruce E. Sagan (Handbook of Discrete and Combinatorial Mathematics, 1999)

Sinks in Acyclic Orientations of Graphs. - David D. Gebhard; Bruce E. Sagan (J. Comb. Theory B, 2000)

Left-Modular Elements of Lattices. - Shu-Chung Liu; Bruce E. Sagan (J. Comb. Theory A, 2000)

The Multiplicities of a Dual-thin Q-polynomial Association Scheme. - Bruce E. Sagan; John S. Caughman IV (Electron. J. Comb., 2001)

Pattern Frequency Sequences and Internal Zeros. - Miklós Bóna; Bruce E. Sagan; Vincent R. Vatter (Adv. Appl. Math., 2002)

Two injective proofs of a conjecture of Simion. - Miklós Bóna; Bruce E. Sagan (J. Comb. Theory A, 2003)

Bounding quantities related to the packing density of 1(ℓ+1)ℓ⋯2. - Martin Hildebrand; Bruce E. Sagan; Vincent R. Vatter (Adv. Appl. Math., 2004)

Topological properties of activity orders for matroid bases. - Rieuwert J. Blok; Bruce E. Sagan (J. Comb. Theory B, 2005)

An algorithmic sign-reversing involution for special rim-hook tableaux. - Bruce E. Sagan; Jaejin Lee (J. Algorithms, 2006)

Maximal and maximum independent sets in graphs with at most r cycles. - Bruce E. Sagan; Vincent R. Vatter (J. Graph Theory, 2006)

Maximal independent sets in graphs with at most r cycles. - Goh Chee Ying; Khee Meng Koh; Bruce E. Sagan; Vincent R. Vatter (J. Graph Theory, 2006)

Rationality of the Möbius function of a composition poset. - Anders Björner; Bruce E. Sagan (Theor. Comput. Sci., 2006)

Counting permutations by congruence class of major index. - Hélène Barcelo; Bruce E. Sagan; Sheila Sundaram (Adv. Appl. Math., 2007)

What power of two divides a weighted Catalan number? - Alexander Postnikov; Bruce E. Sagan (J. Comb. Theory A, 2007)

A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. - Nicholas A. Loehr; Bruce E. Sagan; Gregory S. Warrington (Ars Comb., 2008)

Proper Partitions of a Polygon and k-Catalan Numbers. - Bruce E. Sagan (Ars Comb., 2008)

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. - Sergey Kitaev; Jeffrey Liese; Jeffrey B. Remmel; Bruce E. Sagan (Electron. J. Comb., 2009)

Monomial bases for broken circuit complexes. - Jason I. Brown; Bruce E. Sagan (Eur. J. Comb., 2009)

Set partition statistics and q-Fibonacci numbers. - Adam M. Goyt; Bruce E. Sagan (Eur. J. Comb., 2009)

Infinite log-concavity: Developments and conjectures. - Peter R. W. McNamara; Bruce E. Sagan (Adv. Appl. Math., 2010)

Pattern Avoidance in Set Partitions. - Bruce E. Sagan (Ars Comb., 2010)

Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas Sequences. - Bruce E. Sagan; Carla D. Savage (Integers, 2010)

Eulerian quasisymmetric functions and cyclic sieving. - Bruce E. Sagan; John Shareshian; Michelle L. Wachs (Adv. Appl. Math., 2011)

Partitions, Rooks, and Symmetric Functions in Noncommuting Variables. - Mahir Bilen Can; Bruce E. Sagan (Electron. J. Comb., 2011)

Permutation patterns and statistics. - Theodore Dokos; Tim Dwyer; Bryan P. Johnson; Bruce E. Sagan; Kimberly Selsor (Discret. Math., 2012)

Counting s(3+1)-avoiding permutations. - M. D. Atkinson; Bruce E. Sagan; Vincent R. Vatter (Eur. J. Comb., 2012)

Mahonian pairs. - Bruce E. Sagan; Carla D. Savage (J. Comb. Theory A, 2012)

On 021-Avoiding Ascent Sequences. - William Y. C. Chen; Alvin Y. L. Dai; Theodore Dokos; Tim Dwyer; Bruce E. Sagan (Electron. J. Comb., 2013)

Inversion polynomials for 321-avoiding permutations. - Szu-En Cheng; Sergi Elizalde; Anisse Kasraoui; Bruce E. Sagan (Discret. Math., 2013)

The Fractal Nature of the Fibonomial Triangle. - Xi Chen; Bruce E. Sagan (Integers, 2014)

m-Level rook placements. - Kenneth Barrese; Nicholas A. Loehr; Jeffrey B. Remmel; Bruce E. Sagan (J. Comb. Theory A, 2014)

Factoring the characteristic polynomial of a lattice. - Joshua Hallam; Bruce E. Sagan (J. Comb. Theory A, 2015)

Set partition patterns and statistics. - Samantha Dahlberg; Robert Dorward; Jonathan Gerhard; Thomas Grubb; Carlin Purcell; Lindsey Reppuhn; Bruce E. Sagan (Discret. Math., 2016)

Bijections on m-level rook placements. - Kenneth Barrese; Nicholas A. Loehr; Jeffrey B. Remmel; Bruce E. Sagan (Eur. J. Comb., 2016)

Antipodes and involutions. - Carolina Benedetti; Bruce E. Sagan (J. Comb. Theory A, 2017)

Restricted growth function patterns and statistics. - Lindsey R. Campbell; Samantha Dahlberg; Robert Dorward; Jonathan Gerhard; Thomas Grubb; Carlin Purcell; Bruce E. Sagan (Adv. Appl. Math., 2018)

Distance preserving graphs and graph products. - M. H. Khalifeh; Bruce E. Sagan; Emad Zahedi (Ars Comb., 2018)

Pattern-avoiding polytopes. - Robert Davis; Bruce E. Sagan (Eur. J. Comb., 2018)

On the 1/3-2/3 Conjecture. - Emily J. Olson; Bruce E. Sagan (Order, 2018)

backbone: An R Package for Backbone Extraction of Weighted Graphs. - Rachel Domagalski; Zachary P. Neal; Bruce E. Sagan (CoRR, 2019)

Descent polynomials. - Alexander Diaz-Lopez; Pamela E. Harris; Erik Insko; Mohamed Omar; Bruce E. Sagan (Discret. Math., 2019)

Increasing spanning forests in graphs and simplicial complexes. - Joshua Hallam; Jeremy L. Martin; Bruce E. Sagan (Eur. J. Comb., 2019)

Bijective proofs of shuffle compatibility results. - Duff Baker-Jarvis; Bruce E. Sagan (Adv. Appl. Math., 2020)

On a rank-unimodality conjecture of Morier-Genoud and Ovsienko. - Thomas McConville; Bruce E. Sagan; Clifford D. Smyth (Discret. Math., 2021)

Bijective Proofs of Proper Coloring Theorems. - Bruce E. Sagan; Vincent Vatter (Am. Math. Mon., 2021)

Cyclic pattern containment and avoidance. - Rachel Domagalski; Sergi Elizalde; Jinting Liang; Quinn Minnich; Bruce E. Sagan; Jamie Schmidt; Alexander Sietsema (Adv. Appl. Math., 2022)

Pinnacle set properties. - Rachel Domagalski; Jinting Liang; Quinn Minnich; Bruce E. Sagan; Jamie Schmidt; Alexander Sietsema (Discret. Math., 2022)

Difference ascent sequences. - Mark Dukes; Bruce E. Sagan (Adv. Appl. Math., 2024)

q-Stirling numbers in type B. - Bruce E. Sagan; Joshua P. Swanson (Eur. J. Comb., 2024)

Self-modified difference ascent sequences. - Giulio Cerbai; Anders Claesson; Bruce E. Sagan (Adv. Appl. Math., 2025)

Modified difference ascent sequences and Fishburn structures. - Giulio Cerbai; Anders Claesson; Bruce E. Sagan (Discret. Math., 2026)

Generalized Euler numbers and ordered set partitions. - Bruce E. Sagan (Discret. Math., 2026)