Empirical Analysis of Case-Editing Approaches for Numeric Prediction. - Michael A. Redmond; Timothy Highley (SCSS, 2009)

Granularity of weighted averages and use of rate statistics in AggPro. - Timothy Highley; Ross Gore; Cameron Snapp (WSC, 2010)

An approach to the fairy tale card game: a rotating sets competitive knapsack problem with strongly stochastic rewards and item availability. - Candice Schumann; Timothy Highley; Howard Stickley (J. Comput. Sci. Coll., 2015)

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph (TROPICAL EXCHANGE) is NP-Complete. - Timothy Highley (CoRR, 2016)

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent. - Timothy Highley; Hoang Le (Discret. Math. Theor. Comput. Sci., 2018)

The First International Competition in Machine Reconnaissance Blind Chess. - Ryan W. Gardner; Corey Lowman; Casey Richardson; Ashley J. Llorens; Jared Markowitz; Nathan Drenkow; Andrew Newman; Gregory Clark; Gino Perrotta; Robert Perrotta; Timothy Highley; Vlad Shcherbina; et al. (NeurIPS (Competition and Demos), 2019)

Dealing with uncertainty: a PiecewiseGrid agent for reconnaissance blind chess. - Timothy Highley; Brendan Funk; Laureen Okin (J. Comput. Sci. Coll., 2020)

Checkpoint variations for deep Q-learning in reconnaissance blind chess. - Kyle Blowitski; Timothy Highley (J. Comput. Sci. Coll., 2021)

Using Information Structure Design to Reduce Bribery. - Timothy Highley; Kidanewold Demesie (J. Comput. Sci. Coll., 2022)