Jeremy Lyle

According to our database, Jeremy Lyle authored at least 14 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Graphs with small Italian domatic number.

Keith Gallegos, Jeremy Lyle

Discret. Appl. Math., July, 2023

2017

A note on the annihilation number and 2-domination number of a tree.

Jeremy Lyle, Sean Patterson

J. Comb. Optim., 2017

2015

A Structural Approach for Independent Domination of Regular Graphs.

Jeremy Lyle

Graphs Comb., 2015

The complexity of multi-agent plan recognition.

Bikramjit Banerjee, Jeremy Lyle, Landon Kraemer

Auton. Agents Multi Agent Syst., 2015

2014

A Note on Independent Sets in Graphs with Large Minimum Degree and Small Cliques.

Jeremy Lyle

Electron. J. Comb., 2014

2012

Independent dominating sets in triangle-free graphs.

Wayne Goddard, Jeremy Lyle

J. Comb. Optim., 2012

Efficient context free parsing of multi-agent activities for team and plan recognition.

Bikramjit Banerjee, Jeremy Lyle, Landon Kraemer

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs.

Bikramjit Banerjee, Jeremy Lyle, Landon Kraemer, Rajesh Yellamraju

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Dense graphs with small clique number.

Wayne Goddard, Jeremy Lyle

J. Graph Theory, 2011

On the Chromatic Number of <i>H</i>-Free Graphs of Large Minimum Degree.

Jeremy Lyle

Graphs Comb., 2011

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

Proceedings of the SIGGRAPH Asia 2011 Posters, Hong Kong, December 12-15, 2011, 2011

2010

Multi-Agent Plan Recognition: Formalization and Algorithms.

Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

The binding number of a graph and its cliques.

Jeremy Lyle, Wayne Goddard

Discret. Appl. Math., 2009

Fall colouring of bipartite graphs and cartesian products of graphs.

Renu C. Laskar, Jeremy Lyle

Discret. Appl. Math., 2009