Jeremy Lyle

Orcid: 0000-0002-2092-4150

According to our database1, Jeremy Lyle authored at least 15 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Independent sets in K6-free graphs with large degree.
Discret. Math., 2026

2023
Graphs with small Italian domatic number.
Discret. Appl. Math., July, 2023

2017
A note on the annihilation number and 2-domination number of a tree.
J. Comb. Optim., 2017

2015
A Structural Approach for Independent Domination of Regular Graphs.
Graphs Comb., 2015

The complexity of multi-agent plan recognition.
Auton. Agents Multi Agent Syst., 2015

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

2012
Independent dominating sets in triangle-free graphs.
J. Comb. Optim., 2012

Efficient context free parsing of multi-agent activities for team and plan recognition.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Dense graphs with small clique number.
J. Graph Theory, 2011

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

HumMod explorer: a multi-scale time-varying human modeling navigator.
Proceedings of the SIGGRAPH Asia 2011 Posters, Hong Kong, December 12-15, 2011, 2011

2010
Multi-Agent Plan Recognition: Formalization and Algorithms.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
The binding number of a graph and its cliques.
Discret. Appl. Math., 2009

Fall colouring of bipartite graphs and cartesian products of graphs.
Discret. Appl. Math., 2009


  Loading...