Sorting Twice Through a Stack. - Julian West (Theor. Comput. Sci., 1993)

Generating trees and the Catalan and Schröder numbers. - Julian West (Discret. Math., 1995)

Generating trees and forbidden subsequences. - Julian West (Discret. Math., 1996)

Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations. - Ian P. Goulden; Julian West (J. Comb. Theory A, 1996)

A Robinson - Schensted Algorithm for a Class of Partial Orders. - Thomas S. Sundquist; David G. Wagner; Julian West (J. Comb. Theory A, 1997)

Forbidden subsequences and Chebyshev polynomials. - Timothy Chow; Julian West (Discret. Math., 1999)

The Permutations 123 p 4... p m and 321 p 4... p m are Wilf-Equivalent. - Eric Babson; Julian West (Graphs Comb., 2000)

Complementary Algorithms for Tableaux. - Tom Roby; Frank Sottile; Jeffrey Stroomer; Julian West (J. Comb. Theory A, 2001)

Explicit enumeration of 321, hexagon-avoiding permutations. - Zvezdelina Stankova; Julian West (Discret. Math., 2004)

Wilf-equivalence for singleton classes. - Jörgen Backelin; Julian West; Guoce Xin (Adv. Appl. Math., 2007)

Perfect Matchings for the Three-Term Gale-Robinson Sequences. - Mireille Bousquet-Mélou; James Propp; Julian West (Electron. J. Comb., 2009)

The Dyck pattern poset. - Axel Bacher; Antonio Bernini; Luca Ferrari 001; Benjamin Gunby; Renzo Pinzani; Julian West (Discret. Math., 2014)