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