K. Ojakian (with David Offner),
Cop-Win Graphs: Optimal Strategies and Corner Rank,
Submitted.
Preprint
K. Ojakian (with Riste Skrekovski and
Aleksandra Tepeh),
Bounding the k-rainbow total domination number,
Discrete Mathematics,
Volume 344, Issue 8, August 2021.
Preprint
K. Ojakian (with David Offner),
Capture-time extremal cop-win graphs,
Discussiones Mathematicae Graph Theory, 41 (2021), 923-948.
Get Article
(available for free online at this open access journal)
K. Ojakian,
A Combinatorial Interpretation of The Bijection of Goulden and Yong.
AKCE International Journal of Graphs and Combinatorics,
2020, vol. 17, no. 1, 429-442.
Get Article
(available for free online at this open access journal)
K. Ojakian (with David Offner),
Comparing the power of cops to zombies in pursuit-evasion games,
Discrete Applied Mathematics,
Volume 271, 1 December 2019, Pages 144-151.
Preprint
K. Ojakian (with David Offner),
Variations of cops and robber on the hypercube. Australasian Journal of Combinatorics,
Volume 59 (2), pages 229 - 250, 2014.
Get Article
(available for free online at this open access journal)
K. Ojakian (with Manuel L. Campagnolo),
A characterization of computable analysis on unbounded domains using differential equations.
Information and Computation, 209 (8) 1135-1159, 2011.
Preprint
K. Ojakian (with Manuel L. Campagnolo),
Characterizing Computable Analysis with Differential Equations
Fifth International Conference on Computability and Complexity in Analysis
2008.
Preprint
K. Ojakian (with Manuel L. Campagnolo),
The elementary computable functions over the real numbers: applying
two new techniques, Archives for Mathematical Logic (46) 2008.
Preprint
K. Ojakian (with Manuel L. Campagnolo),
Using Approximation to Relate Computational Classes over the
Reals,
in conference: Machines, Computations, and Universality 2007 ,
Lecture Notes in Computer Science (4664) 2007.
Preprint
K. Ojakian (with Manuel L. Campagnolo), The methods of approximation and lifting in real computation,
Third International Conference on Computability and Complexity in Analysis 2006 , Electronic Notes in Theoretical Computer Science (167) 2007.
Preprint
K. Ojakian, Upper and lower Ramsey bounds in bounded arithmetic, Annals of
Pure and Applied Logic, (135) 2005.
Preprint
K. Ojakian, Combinatorics in Bounded Arithmetic. PhD thesis, Carnegie Mellon University, 2004. Supervised by Jeremy Avigad.
K. Ojakian (with David Offner), Graphical Examples of Cop-Win Graphs (shows graphs that accompany the paper Corner Ranking, Realizable Vectors, and Extremal Cop-Win Graphs ).
K. Ojakian (with David Offner),
Graphical Examples of Cop-Win Graphs in Maple
(shows computations that accompany the paper
Capture-time extremal cop-win graphs ).
For those without Maple:
PDF Printout of the Maple Worksheet
Bounding the k-rainbow total domination number
Queensborough Community College (CUNY) Mathematics Colloquia via Zoom (May 2021)
Bounding the k-rainbow total domination number
New York Combinatorics Seminar at the Graduate Center in NY, NY (September 2019)
Graphs that are cop-win, but not zombie-win
CanaDAM 2019 in Vancouver, Canada (May 2019)
Zombies Can Be Much Dumber Than Cops
Graph Searching in Canada Workshop in Regina, Canada (August 2018)
Extremal Cop-Win Graphs
Canadian Discrete and Algorithmic Mathematics Conference (Toronto, Canada)
in the minisymposium Pursuit-Evasion Games on Graphs (June 2017)
Three Graph Duals and A Bijection
Hunter (CUNY) AMS Sectional Meeting
in the Special Session on Applications of Network Analysis, in Honor of Charlie Suffel's 75th Birthday (May 2017)
Extremal cop-win graphs
Stony Brook AMS Sectional Meeting (March 2016)
Capture time of cop-win graphs
Canadian Mathematical Society Annual Conference in Charlotton, PEI, Canada (June 2015)
Cop-win Graphs and Strategy
Graph Searching in Canada Workshop in Montreal, Canada (May 2015)
Games, Cops, and Robbers
Faculty Day at Bronx Community College (April 2015)
Graph Minor Theorem (An exposition)
New York Combinatorics Seminar (February 2015)