The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David C. Fisher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David C. Fisher
    Communication Complexity of Matrix Multiplication-Abstract. [Citation Graph (0, 0)][DBLP]
    PPSC, 1987, pp:50- [Conf]
  2. David C. Fisher
    On the n x n Knight Cover Problem. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  3. David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley
    P3-Connected Graphs of Minimum Size. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  4. David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam
    Two families of graphs that are not CCE-orientable. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  5. David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid
    Domination Graphs of Tournaments with Isolated Vertices. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  6. David C. Fisher, Paul Thalos
    Bishop Covers of Rectangular Boards. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:65, n:, pp:- [Journal]
  7. David C. Fisher
    Fractional dominations and fractional total dominations of graph complements. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:283-291 [Journal]
  8. David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer
    Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:93-105 [Journal]
  9. David C. Fisher, Jennifer Ryan
    Probabilities Within optimal Strategies for Tournament Games. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:1, pp:87-91 [Journal]
  10. David C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar
    Fractional domination of strong direct products. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:1, pp:89-91 [Journal]
  11. David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid
    Domination Graphs with Nontrivial Components. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:227-236 [Journal]
  12. 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]
  13. David C. Fisher
    Domination, Fractional Domination, 2-Packing, and Graph Products. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:493-498 [Journal]
  14. David C. Fisher
    Your Favorite Parallel Algorithms Might Not Be as Fast as You Think. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:2, pp:211-213 [Journal]
  15. David C. Fisher
    The number of triangles in a K4-free graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:2, pp:203-205 [Journal]
  16. David C. Fisher, Anita E. Solow
    Dependence polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:251-258 [Journal]
  17. David C. Fisher, Jennifer Ryan
    Bounds on the number of complete subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:313-320 [Journal]
  18. David C. Fisher, Jennifer Ryan
    Bounds on the largest root of the matching polynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:275-278 [Journal]
  19. Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary
    Size in maximal triangle-free graphs and minimal graphs of diameter 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:93-99 [Journal]

Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002