T. V. Hromadka, R.J. Whitley, S. B. Horton, M. J. Smith, J. M. Lindquist. Generous Statistical Tests. Stochastic Environmental Research and Risk Assessment, 23 (2009), pp. 9-12.

G. McCormick, S. Horton, and L. Harrison. Things fall apart: the "end game" dynamics of internal wars. Third World Quarterly, 28 (2007), pp. 321-367.

M. Huber and S. Horton. How Ken Griffey, Jr. is like Kevin Bacon or, degrees of separation in baseball. Journal of Recreational Mathematics, 33 (2006), pp. 194-203.

R. Gera, C. Rasmussen, P. Stanica, and S. Horton. Results on the Min-Sum Vertex Cover Problem. Congressus Numerantium 178 (2006), pp 161-172.

R. Gera, C. Rasmussen, and S. Horton. Dominator Colorings and Safe Clique Partitions. Congressus Numerantium 181 (2006), pp. 19-32.

Steven B. Horton. On Some Problems Related to Dominating Set. Graph Theory Notes of New York 48 (2005).

Jean R.S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, and Grzegorz Kubicki . On Domination and Reinforcement Numbers in Trees. Accepted for publication in Discrete Math (2007).

J. R. S. Blair and S. B. Horton. Broadcast Covers in Graphs. Congressus Numerantium 173 (2005), pp 109-115.

J. R. S. Blair, S. B. Horton, S. T. Hedetniemi, S. M. Hedetniemi, W. Goddard. Domination Equivalence: Algorithms and Complexity. AKCE International Journal of Graphs and Combinatorics 2 (2005), pp 123-136.

J. R. S. Blair, P. Heggernes, S. B. Horton, and F. Manne. Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. Congressus Numerantium 169 (2004), pp 55-77.

S. B. Horton, T. Easton, and R. G. Parker. The Linear Arrangement Problem on Recursively Constructed Graphs. Networks 42(3) (2003), pp. 165-168.

T. Easton, S.B. Horton, R.G. Parker. On the Complexity of Certain Completion Problems. Congressus Numerantium 145 (2000), pp 9-31.

S.B. Horton, W. Jerzak, A.A. Napoli, and N. Prins. A Math, Science, and Technology Interdisciplinary Lively Application of Mathematics at the United States Military Academy. Primus Vol. 10, Number 1 (2000), pp 42-52.

S.B. Horton, R.G. Parker, R.B. Borie. On Minimum Cuts and the Linear Arrangement Problem. Discrete Applied Mathematics 103 (2000), pp 127-139.

T. Easton, S.B. Horton, R.G. Parker. A Solvable Case of the Optimal Linear Arrangement Problem on Halin Graphs. Congressus Numerantium 119 (1996), pp 3-17.

S.B. Horton, R.G. Parker. On Halin Subgraphs and Supergraphs. Discrete Applied Mathematics 56 (1995), pp 19-35.

W.P. Fox, S.B. Horton. A "7 into 4" Carry Through Problem. Primus Vol. 5, Number 2 (1995), pp 163-177.

R.B. Borie, S.B. Horton, R.G. Parker. On Some Results Pertaining to Halin Graphs. Congressus Numerantium 89 (1992), pp 65-87.

S.B. Horton. The Optimal Linear Arrangement Problem: Algorithms and Approximation. Ph.D. Thesis, Georgia Institute of Technology (1997).

S.B. Horton. Graph Approximation: Issues and Complexity. M.S. Thesis, Georgia Institute of Technology (1991).