David C. Fisher

From MaRDI portal
Person:201977

Available identifiers

zbMath Open fisher.david-cMaRDI QIDQ201977

List of research outcomes





PublicationDate of PublicationType
Smooth and analytic actions of $SL(n,{\bf R})$ and $SL(n,{\bf Z})$ on closed $n$-dimensional manifolds2022-10-17Paper
https://portal.mardi4nfdi.de/entity/Q57086252005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54660662005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54660392005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54615812005-07-26Paper
Two families of graphs that are not CCE-orientable.2005-07-20Paper
Some remarks on domination2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44582162004-03-17Paper
Fractional dominations and fractional total dominations of graph complements2002-08-29Paper
Domination graphs with nontrivial components2002-07-14Paper
The isometric path number of a graph2002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q44892282000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49435242000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49400912000-03-01Paper
The domination and competition graphs of a tournament1999-08-23Paper
https://portal.mardi4nfdi.de/entity/Q43907201998-11-26Paper
https://portal.mardi4nfdi.de/entity/Q43933751998-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43906861998-10-19Paper
The number of dependent arcs in an acyclic orientation1998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q38382171998-08-09Paper
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs1998-07-28Paper
https://portal.mardi4nfdi.de/entity/Q52840281997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q48923411997-03-06Paper
https://portal.mardi4nfdi.de/entity/Q48711681996-05-21Paper
Fractional colorings with large denominators1995-11-29Paper
Size in maximal triangle-free graphs and minimal graphs of diameter 21995-10-03Paper
https://portal.mardi4nfdi.de/entity/Q43262041995-08-27Paper
Optimal strategies for random tournament games1995-05-11Paper
Tournament games and Condorcet voting1995-05-11Paper
Characteristic polynomials of Straffin digraphs1995-05-11Paper
Domination, Fractional Domination, 2-Packing, and Graph Products1995-05-09Paper
https://portal.mardi4nfdi.de/entity/Q43043651995-03-26Paper
Tournament games and positive tournaments1995-03-20Paper
Probabilities within optimal strategies for tournament games1995-02-01Paper
Fractional domination of strong direct products1994-09-05Paper
https://portal.mardi4nfdi.de/entity/Q42881771994-04-19Paper
https://portal.mardi4nfdi.de/entity/Q31392941993-11-11Paper
Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game1993-06-29Paper
Bounds on the largest root of the matching polynomial1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40285111993-03-28Paper
Bounds on the number of complete subgraphs1992-12-06Paper
If \(f\) has Lipschitz constant less than 2.17008, then \(x_{i+1}=x_ i+f(x_ i)\) has no odd periodic solutions1992-09-27Paper
The Number of Words of Length n in a Graph Monoid1992-06-25Paper
Dependence polynomials1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34784241990-01-01Paper
Lower bounds on the number of triangles in a graph1989-01-01Paper
Minimal Periods of Discrete and Smooth Orbits1989-01-01Paper
Strict bounds for the period of periodic orbits of difference equations1989-01-01Paper
Next-fit packs a list and its reverse into the same number of bins1988-01-01Paper
The number of triangles in a \(K_ 4\)-free graph1988-01-01Paper
Your favorite parallel algorithms might not be as fast as you think1988-01-01Paper
Shorter Notes: Better Bounds for Periodic Solutions of Differential Equations in Banach Spaces1986-01-01Paper
Spline quadrature formulas1984-01-01Paper

Research outcomes over time

This page was built for person: David C. Fisher