Upper and lower Ramsey bounds in bounded arithmetic. - Kerry Ojakian (Ann. Pure Appl. Log., 2005)

The Methods of Approximation and Lifting in Real Computation. - Manuel Lameiras Campagnolo; Kerry Ojakian (CCA, 2006)

Using Approximation to Relate Computational Classes over the Reals. - Manuel Lameiras Campagnolo; Kerry Ojakian (MCU, 2007)

The elementary computable functions over the real numbers: applying two new techniques. - Manuel Lameiras Campagnolo; Kerry Ojakian (Arch. Math. Log., 2008)

Characterizing Computable Analysis with Differential Equations. - Manuel Lameiras Campagnolo; Kerry Ojakian (CCA, 2008)

A characterization of computable analysis on unbounded domains using differential equations. - Manuel Lameiras Campagnolo; Kerry Ojakian (Inf. Comput., 2011)

Variations of cops and robber on the hypercube. - David Offner; Kerry Ojakian (Australas. J Comb., 2014)

Cop-Win Graphs: Optimal Strategies and Corner Rank. - David Offner; Kerry Ojakian (CoRR, 2016)

Comparing the power of cops to zombies in pursuit-evasion games. - David Offner; Kerry Ojakian (Discret. Appl. Math., 2019)

A combinatorial interpretation of the bijection of Goulden and Yong. - Kerry Ojakian (AKCE Int. J. Graphs Comb., 2020)

Bounding the k-rainbow total domination number. - Kerry Ojakian; Riste Skrekovski; Aleksandra Tepeh (Discret. Math., 2021)

Capture-time extremal cop-win graphs. - David Offner; Kerry Ojakian (Discuss. Math. Graph Theory, 2021)

Deduction, Constrained Zero Forcing, and Constrained Searching. - Andrea Burgess; Danny Dyer; Kerry Ojakian; Lusheng Wang 001; Mingyu Xiao 001; Boting Yang (CoRR, 2024)