Fall colouring of bipartite graphs and cartesian products of graphs. - Renu C. Laskar; Jeremy Lyle (Discret. Appl. Math., 2009)

The binding number of a graph and its cliques. - Jeremy Lyle; Wayne Goddard (Discret. Appl. Math., 2009)

Multi-Agent Plan Recognition: Formalization and Algorithms. - Bikramjit Banerjee; Landon Kraemer; Jeremy Lyle (AAAI, 2010)

HumMod explorer: a multi-scale time-varying human modeling navigator. - Liming Xu; Jeremy Lyle; Yubao Wu; Zhigeng Pan; Mingmin Zhang; David H. Laidlaw; Robert L. Hester; Jian Chen 006 (SIGGRAPH Asia Posters, 2011)

On the Chromatic Number of H-Free Graphs of Large Minimum Degree. - Jeremy Lyle (Graphs Comb., 2011)

Dense graphs with small clique number. - Wayne Goddard; Jeremy Lyle (J. Graph Theory, 2011)

Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs. - Bikramjit Banerjee; Jeremy Lyle; Landon Kraemer; Rajesh Yellamraju (AAAI, 2012)

Efficient context free parsing of multi-agent activities for team and plan recognition. - Bikramjit Banerjee; Jeremy Lyle; Landon Kraemer (AAMAS, 2012)

Independent dominating sets in triangle-free graphs. - Wayne Goddard; Jeremy Lyle (J. Comb. Optim., 2012)

A Note on Independent Sets in Graphs with Large Minimum Degree and Small Cliques. - Jeremy Lyle (Electron. J. Comb., 2014)

The complexity of multi-agent plan recognition. - Bikramjit Banerjee; Jeremy Lyle; Landon Kraemer (Auton. Agents Multi Agent Syst., 2015)

A Structural Approach for Independent Domination of Regular Graphs. - Jeremy Lyle (Graphs Comb., 2015)

A note on the annihilation number and 2-domination number of a tree. - Jeremy Lyle; Sean Patterson (J. Comb. Optim., 2017)

Graphs with small Italian domatic number. - Keith Gallegos; Jeremy Lyle (Discret. Appl. Math., 2023)