The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Douglas B. West: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  71. Optimal strong parity edge-coloring of complete graphs. [Citation Graph (, )][DBLP]


  72. The maximum number of winning 2-sets. [Citation Graph (, )][DBLP]


  73. Short proofs for cut-and-paste sorting of permutations. [Citation Graph (, )][DBLP]


  74. Decomposition of sparse graphs, with application to game coloring number. [Citation Graph (, )][DBLP]


  75. A short constructive proof of the Erdos-Gallai characterization of graphic lists. [Citation Graph (, )][DBLP]


  76. Degree-associated reconstruction number of graphs. [Citation Graph (, )][DBLP]


  77. Forbidden subposets for fractional weak discrepancy at most k. [Citation Graph (, )][DBLP]


Search in 0.172secs, Finished in 0.178secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002