The following pages link to David C. Fisher (Q201977):
Displaying 50 items.
- (Q1059802) (redirect page) (← links)
- Spline quadrature formulas (Q1059803) (← links)
- Next-fit packs a list and its reverse into the same number of bins (Q1109684) (← links)
- The number of triangles in a \(K_ 4\)-free graph (Q1112062) (← links)
- If \(f\) has Lipschitz constant less than 2.17008, then \(x_{i+1}=x_ i+f(x_ i)\) has no odd periodic solutions (Q1192544) (← links)
- Bounds on the number of complete subgraphs (Q1195482) (← links)
- Bounds on the largest root of the matching polynomial (Q1208371) (← links)
- Fractional domination of strong direct products (Q1324692) (← links)
- Probabilities within optimal strategies for tournament games (Q1343161) (← links)
- The number of dependent arcs in an acyclic orientation (Q1386477) (← links)
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs (Q1392568) (← links)
- Fractional dominations and fractional total dominations of graph complements (Q1613430) (← links)
- Characteristic polynomials of Straffin digraphs (Q1805198) (← links)
- Optimal strategies for random tournament games (Q1805310) (← links)
- Tournament games and Condorcet voting (Q1805311) (← links)
- Strict bounds for the period of periodic orbits of difference equations (Q1824777) (← links)
- Size in maximal triangle-free graphs and minimal graphs of diameter 2 (Q1842148) (← links)
- Dependence polynomials (Q2640617) (← links)
- (Q2715996) (← links)
- (Q2747184) (← links)
- (Q3139294) (← links)
- (Q3478424) (← links)
- Shorter Notes: Better Bounds for Periodic Solutions of Differential Equations in Banach Spaces (Q3769243) (← links)
- Your favorite parallel algorithms might not be as fast as you think (Q3801069) (← links)
- Minimal Periods of Discrete and Smooth Orbits (Q3825367) (← links)
- Lower bounds on the number of triangles in a graph (Q3826589) (← links)
- (Q3838217) (← links)
- (Q4028511) (← links)
- The domination and competition graphs of a tournament (Q4242915) (← links)
- (Q4288177) (← links)
- (Q4304365) (← links)
- Domination, Fractional Domination, 2-Packing, and Graph Products (Q4307055) (← links)
- (Q4326204) (← links)
- Tournament games and positive tournaments (Q4326540) (← links)
- (Q4390686) (← links)
- (Q4390720) (← links)
- (Q4393375) (← links)
- (Q4458216) (← links)
- Some remarks on domination (Q4474284) (← links)
- (Q4489228) (← links)
- The Number of Words of Length n in a Graph Monoid (Q4712949) (← links)
- Fractional colorings with large denominators (Q4857439) (← links)
- (Q4871168) (← links)
- (Q4892341) (← links)
- (Q4940091) (← links)
- (Q4943524) (← links)
- (Q5284028) (← links)
- Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game (Q5286368) (← links)
- (Q5461581) (← links)
- (Q5466039) (← links)
