| 2009 |
| 79 | EE | Qi Liu,
Douglas B. West,
Gexin Yu:
Implications among linkage properties in graphs.
Journal of Graph Theory 60(4): 327-337 (2009) |
| 2008 |
| 78 | EE | Tracy Grauman,
Stephen G. Hartke,
Adam Jobson,
Bill Kinnersley,
Douglas B. West,
Lesley Wiglesworth,
Pratik Worah,
Hehui Wu:
The hub number of a graph.
Inf. Process. Lett. 108(4): 226-228 (2008) |
| 77 | EE | Douglas B. West,
Xuding Zhu:
Circular chromatic index of Cartesian products of graphs.
Journal of Graph Theory 57(1): 7-18 (2008) |
| 76 | EE | David P. Bunde,
Erin W. Chambers,
Daniel W. Cranston,
Kevin Milans,
Douglas B. West:
Pebbling and optimal pebbling in graphs.
Journal of Graph Theory 57(3): 215-238 (2008) |
| 2007 |
| 75 | EE | Douglas B. West:
Editorial Announcement: Hello, World.
Discrete Mathematics 307(19-20): 2329 (2007) |
| 74 | EE | Daniel W. Cranston,
Ivan Hal Sudborough,
Douglas B. West:
Short proofs for cut-and-paste sorting of permutations.
Discrete Mathematics 307(22): 2866-2870 (2007) |
| 73 | EE | Bojan Mohar,
Richard J. Nowakowski,
Douglas B. West:
Research problems from the 5th Slovenian Conference (Bled, 2003).
Discrete Mathematics 307(3-5): 650-658 (2007) |
| 2006 |
| 72 | EE | Michael O. Albertson,
Douglas B. West:
Extending precolorings to circular colorings.
J. Comb. Theory, Ser. B 96(4): 472-481 (2006) |
| 2005 |
| 71 | EE | Radhika Ramamurthi,
Douglas B. West:
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.
Combinatorica 25(3): 355-366 (2005) |
| 70 | EE | Zoltán Füredi,
Alexandr V. Kostochka,
Riste Skrekovski,
Michael Stiebitz,
Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
Journal of Graph Theory 50(4): 273-292 (2005) |
| 2004 |
| 69 | EE | Tao Jiang,
Douglas B. West:
Edge-colorings of complete graphs that avoid polychromatic trees.
Discrete Mathematics 274(1-3): 137-145 (2004) |
| 68 | EE | Radhika Ramamurthi,
Douglas B. West:
Maximum face-constrained coloring of plane graphs.
Discrete Mathematics 274(1-3): 233-240 (2004) |
| 67 | EE | Mingjang Chen,
Gerard J. Chang,
Douglas B. West:
Interval numbers of powers of block graph.
Discrete Mathematics 275(1-3): 87-96 (2004) |
| 66 | EE | Dmitry Fon-Der-Flaass,
Douglas B. West:
Graphic and Protographic Lists of Integers.
Electr. J. Comb. 11(1): (2004) |
| 65 | EE | Robert E. Jamison,
Douglas B. West:
On Pattern Ramsey Numbers of Graphs.
Graphs and Combinatorics 20(3): 333-339 (2004) |
| 64 | EE | Oleg V. Borodin,
Seog-Jin Kim,
Alexandr V. Kostochka,
Douglas B. West:
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory, Ser. B 90(1): 147-159 (2004) |
| 63 | EE | Yi-Wu Chang,
Joan P. Hutchinson,
Michael S. Jacobson,
Jenö Lehel,
Douglas B. West:
The Bar Visibility Number of a Graph.
SIAM J. Discrete Math. 18(3): 462-471 (2004) |
| 62 | EE | Michael O. Albertson,
Alexandr V. Kostochka,
Douglas B. West:
Precoloring Extensions of Brooks' Theorem.
SIAM J. Discrete Math. 18(3): 542-553 (2004) |
| 2003 |
| 61 | | Tao Jiang,
Douglas B. West:
On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.
Combinatorics, Probability & Computing 12(5-6): 585-598 (2003) |
| 60 | EE | Carla D. Savage,
Ian Shields,
Douglas B. West:
On the existence of Hamiltonian paths in the cover graph of M(n).
Discrete Mathematics 262(1-3): 241-252 (2003) |
| 59 | EE | Mariko Hagita,
André Kündgen,
Douglas B. West:
Probabilistic Methods for Decomposition Dimension of Graphs.
Graphs and Combinatorics 19(4): 493-503 (2003) |
| 2002 |
| 58 | EE | Charles W. Huegy,
Douglas B. West:
A Fibonacci tiling of the plane.
Discrete Mathematics 249(1-3): 111-116 (2002) |
| 57 | EE | Lenore Cowen,
Jerrold R. Griggs,
Douglas B. West:
Foreword.
Discrete Mathematics 257(2-3): 191-192 (2002) |
| 56 | EE | Dhruv Mubayi,
Douglas B. West:
On restricted edge-colorings of bicliques.
Discrete Mathematics 257(2-3): 513-529 (2002) |
| 55 | EE | Herbert Fleischner,
Robert R. Molina,
Ken W. Smith,
Douglas B. West:
A Proof of the Two-path Conjecture.
Electr. J. Comb. 9(1): (2002) |
| 54 | EE | Tao Jiang,
Douglas B. West:
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.
Electronic Notes in Discrete Mathematics 11: 376-385 (2002) |
| 53 | EE | Radhika Ramamurthi,
Douglas B. West:
Maximum Face-Constrained Coloring of Plane Graphs.
Electronic Notes in Discrete Mathematics 11: 542-549 (2002) |
| 52 | EE | Tao Jiang,
Dhruv Mubayi,
Zsolt Tuza,
Vitaly I. Voloshin,
Douglas B. West:
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs and Combinatorics 18(2): 309-318 (2002) |
| 2001 |
| 51 | EE | Dhruv Mubayi,
Todd G. Will,
Douglas B. West:
Realizing degree imbalances in directed graphs.
Discrete Mathematics 239(1-3): 147-153 (2001) |
| 50 | EE | Zoltán Füredi,
Douglas B. West:
Ramsey Theory and Bandwidth of Graphs.
Graphs and Combinatorics 17(3): 463-471 (2001) |
| 49 | EE | Weiping Shi,
Douglas B. West:
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs.
SIAM J. Discrete Math. 14(4): 510-523 (2001) |
| 2000 |
| 48 | EE | Béla Bollobás,
Douglas B. West:
A note on generalized chromatic number and generalized girth.
Discrete Mathematics 213(1-3): 29-34 (2000) |
| 47 | EE | Hirotsugu Asari,
Tao Jiang,
André Kündgen,
Douglas B. West:
Perfection thickness of graphs.
Discrete Mathematics 215: 263-264 (2000) |
| 46 | EE | Tao Jiang,
Dhruv Mubayi,
Aditya Shastri,
Douglas B. West:
Correction to Edge-Bandwidth of Graphs.
SIAM J. Discrete Math. 13(1): 1 (2000) |
| 45 | EE | Yair Caro,
Douglas B. West,
Raphael Yuster:
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discrete Math. 13(2): 202-211 (2000) |
| 1999 |
| 44 | EE | Kenneth P. Bogart,
Douglas B. West:
A short proof that 'proper = unit'.
Discrete Mathematics 201(1-3): 21-23 (1999) |
| 43 | EE | Tao Jiang,
Dhruv Mubayi,
Zsolt Tuza,
Vitaly I. Voloshin,
Douglas B. West:
Chromatic spectrum is broken.
Electronic Notes in Discrete Mathematics 3: 86-89 (1999) |
| 42 | | Weiping Shi,
Douglas B. West:
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs.
SIAM J. Comput. 28(5): 1541-1551 (1999) |
| 41 | EE | Tao Jiang,
Dhruv Mubayi,
Aditya Shastri,
Douglas B. West:
Edge-Bandwidth of Graphs.
SIAM J. Discrete Math. 12(3): 307-316 (1999) |
| 1998 |
| 40 | EE | Douglas B. West:
Short proofs for interval digraphs.
Discrete Mathematics 178(1-3): 287-292 (1998) |
| 39 | EE | Xinming Liu,
Douglas B. West:
Line digraphs and coreflexive vertex sets.
Discrete Mathematics 188(1-3): 269-277 (1998) |
| 38 | EE | Le Tu Quoc Hung,
Maciej M. Syslo,
Margaret L. Weaver,
Douglas B. West:
Bandwidth and density for block graphs.
Discrete Mathematics 189(1-3): 163-176 (1998) |
| 1997 |
| 37 | | Weiping Shi,
Douglas B. West:
Optimal Structural Diagnosis of Wiring Networks.
FTCS 1997: 162-171 |
| 36 | EE | David C. Fisher,
Kathryn Fraughnaugh,
Larry J. Langley,
Douglas B. West:
The Number of Dependent Arcs in an Acyclic Orientation.
J. Comb. Theory, Ser. B 71(1): 73-78 (1997) |
| 1996 |
| 35 | EE | Myung S. Chung,
Douglas B. West:
Large 2P3-free graphs with bounded degree.
Discrete Mathematics 150(1-3): 69-79 (1996) |
| 34 | EE | Thomas M. Kratzke,
Douglas B. West:
The Total Interval Number of a Graph II: Trees and Complexity.
SIAM J. Discrete Math. 9(2): 339-348 (1996) |
| 1995 |
| 33 | | Weiping Shi,
Douglas B. West:
Optimal Algorithms for Finding Connected Components of an Unknown Graph.
COCOON 1995: 131-140 |
| 32 | EE | Douglas B. West:
Acyclic orientations of complete bipartite graphs.
Discrete Mathematics 138(1-3): 393-396 (1995) |
| 31 | EE | Tom Madej,
Douglas B. West:
Interval number of special posets and random posets.
Discrete Mathematics 144(1-3): 67-74 (1995) |
| 30 | EE | Malay K. Sen,
B. K. Sanyal,
Douglas B. West:
Representing digraphs using intervals or circular arcs.
Discrete Mathematics 147(1-3): 235-245 (1995) |
| 29 | | Noga Alon,
Richard M. Karp,
David Peleg,
Douglas B. West:
A Graph-Theoretic Game and Its Application to the k-Server Problem.
SIAM J. Comput. 24(1): 78-100 (1995) |
| 1994 |
| 28 | | Myung S. Chung,
Douglas B. West:
The p-Intersection Number of a Complete Bipartite Graph and Orthogonal Double Coverings of a Clique.
Combinatorica 14(4): 453-461 (1994) |
| 27 | | Douglas B. West:
Covering a Poset by Interval Orders.
J. Comb. Theory, Ser. A 66(1): 169-171 (1994) |
| 1993 |
| 26 | | Béla Bollobás,
Paul Erdös,
Joel Spencer,
Douglas B. West:
Clique coverings of the edges of a random graph.
Combinatorica 13(1): 1-5 (1993) |
| 25 | EE | Yi-Wu Chang,
Michael S. Jacobson,
Clyde L. Monma,
Douglas B. West:
Subtree and Substar Intersection Numbers.
Discrete Applied Mathematics 44(1-3): 205-220 (1993) |
| 24 | EE | Thomas M. Kratzke,
Douglas B. West:
The total interval number of a graph, I: Fundamental classes.
Discrete Mathematics 118(1-3): 145-156 (1993) |
| 23 | EE | Douglas B. West:
Generating Linear Extensions by Adjacent Transpositions.
J. Comb. Theory, Ser. B 58(1): 58-64 (1993) |
| 1991 |
| 22 | EE | Douglas B. West:
The maximum number of winning 2-sets.
Discrete Applied Mathematics 34(1-3): 279-284 (1991) |
| 21 | EE | Tom Madej,
Douglas B. West:
The interval inclusion number of a partially ordered set.
Discrete Mathematics 88(2-3): 259-277 (1991) |
| 20 | | Daniel J. Kleitman,
Douglas B. West:
Spanning Trees with Many Leaves.
SIAM J. Discrete Math. 4(1): 99-106 (1991) |
| 1990 |
| 19 | | Herbert Edelsbrunner,
Franco P. Preparata,
Douglas B. West:
Tetrahedrizing Point Sets in Three Dimensions.
J. Symb. Comput. 10(3/4): 335-348 (1990) |
| 1989 |
| 18 | EE | Douglas B. West:
A short proof of the degree bound for interval number.
Discrete Mathematics 73(3): 309-310 (1989) |
| 17 | EE | John Ginsburg,
Bill Sands,
Douglas B. West:
A length-width inequality for partially ordered sets with two-element cutsets.
J. Comb. Theory, Ser. B 46(2): 232-239 (1989) |
| 1988 |
| 16 | EE | Dezsö Miklós,
Mark J. Newman,
Ákos Seress,
Douglas B. West:
The addition game: an abstraction of a communication problem.
Discrete Mathematics 68(2-3): 265-272 (1988) |
| 15 | | Douglas B. West,
Prithviraj Banerjee:
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports.
IEEE Trans. Computers 37(9): 1148-1151 (1988) |
| 14 | | Michael C. Loui,
Teresa A. Matsushita,
Douglas B. West:
Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett. 28(6): 327 (1988) |
| 1987 |
| 13 | EE | Douglas B. West:
Unichain coverings in partial orders with the nested saturation property.
Discrete Mathematics 63(2-3): 297-303 (1987) |
| 12 | EE | William T. Trotter,
Douglas B. West:
Poset boxicity of graphs.
Discrete Mathematics 64(1): 105-107 (1987) |
| 11 | EE | Martin Aigner,
Douglas B. West:
Sorting by insertion of leading elements.
J. Comb. Theory, Ser. A 45(2): 306-309 (1987) |
| 1986 |
| 10 | | Michael C. Loui,
Teresa A. Matsushita,
Douglas B. West:
Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett. 22(4): 185-187 (1986) |
| 9 | EE | Douglas B. West:
"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible.
J. Comb. Theory, Ser. A 41(1): 105-116 (1986) |
| 1985 |
| 8 | EE | Paul Erdös,
Douglas B. West:
A note on the interval number of a graph.
Discrete Mathematics 55(2): 129-133 (1985) |
| 7 | EE | Bruce Reznick,
Prasoon Tiwari,
Douglas B. West:
Decomposition of product graphs into complete bipartite subgraphs.
Discrete Mathematics 57(1-2): 189-193 (1985) |
| 1984 |
| 6 | | 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) |
| 1983 |
| 5 | | Douglas B. West,
Lawrence H. Harper,
David E. Daykin:
Some Remarks on Normalized Matching.
J. Comb. Theory, Ser. A 35(3): 301-308 (1983) |
| 4 | EE | Edward R. Scheinerman,
Douglas B. West:
The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory, Ser. B 35(3): 224-239 (1983) |
| 1982 |
| 3 | EE | Douglas B. West:
A class of solutions to the gossip problem, part I.
Discrete Mathematics 39(3): 307-326 (1982) |
| 2 | EE | Douglas B. West:
A class of solutions to the gossip problem, part II.
Discrete Mathematics 40(1): 87-113 (1982) |
| 1 | EE | Douglas B. West:
A class of solutions to the gossip problem, part III.
Discrete Mathematics 40(2-3): 285-310 (1982) |