Journal Publications

1. J. Lyle, S. Patterson
   Note on the Annihilation Number and 2-Domination Number of a Tree.
   Journal of Combinatorial Optimization
   Volume 33, Issue 3, pp 968–976 (2017)
    
2. J. Lyle.
   A Structural Approach for Independent Domination of Regular Graphs
   Graphs and Combinatorics
   Volume 31, Issue 5, pp 1567-1588 (2015)
    
3. B. Banerjee, J. Lyle, and L. Kraemer.
   The complexity of multi-agent plan recognition
   Autonomous Agents and Multi-Agent Systems
   volume 29, Issue 1, pp 40-72 (2015)
    
4. J. Lyle.
   A Note on Independent Sets in Graphs with Large Minimum Degree and Small Cliques
   Electronic Journal of Combinatorics
   volume 21, Issue 2, Paper #P2.38, pp 1-17 (2014)
    
5. W.Goddard, M. Henning, J. Lyle, and J. Southey.
   On the Independent Domination Number of Regular Graphs.
   Annals of Combinatorics
   volume 16, Issue 4, pp 719-732 (2012)
    
6. W. Goddard and J. Lyle,
   Independent dominating sets in triangle-free graphs.
   Journal of Combinatorial Optimization,
   volume 23, no. 1, pp 9-20 (2012)
    
7. J. Lyle,
   On the Chromatic Number of H-Free Graphs of Large Minimum Degree.
   Graphs and Combinatorics,
   volume 27, no. 5, pp 741-754 (2011)
    
8. W. Goddard, and J. Lyle,
   Dense graphs with small clique number.
   Journal of Graph Theory,
   volume 66, no. 4, pp 319 - 331 (2011)
    
9. W. Goddard, and J. Lyle,
   The binding number of a graph and its cliques.
   Discrete Applied Mathematics
   volume 157, no. 15, pp 3336 - 3340. (2009)
    
10. R. Laskar and J. Lyle,
    Fall colorings of Bipartite Graphs and Cartesian Products of Graphs.
    Discrete Applied Mathematics
    volume 157, no. 2, pp 330-338. (2009)
     
11. J. Lyle,
    “A Linear Time Algorithm for the Role Assignment of Trees”
    Journal of Combinatorial Mathematics and Combinatorial Computing
    volume 64, pp 155-162. (2008)
     

Refereed Conference Proceedings

1. B. Banerjee, J. Lyle, L. Kraemer, and R. Yellamraju.
   “Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs.”
   Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12),
   pp. 1256 - 1262. (2012)
    
2. B. Banerjee, J. Lyle, L. Kraemer, and R. Yellamraju.
   “Solving Finite Horizon Decentralized POMDPs by Distributed Reinforcement Learning.”
   Proc. of the AAMAS Workshop on Multiagent Sequential Decision Making Under Uncertainty (MSDM-12)
   pp. 9 -16. (2012)
    
3. B. Banerjee, J. Lyle, and L. Kraemer.
   “New Algorithms and Hardness Results for Multi-Agent Plan Recognition.”
   GAPRec 2011: Proc. the 1st ICAPS workshop on Goal, Activity and Plan Rec.,
   pp. 24 -31. (2011)
    
4. B. Banerjee, L. Kraemer, and J. Lyle.
   “Multi-Agent Plan Recognition: Formalization and Algorithms.”
   Proceedings of the 24th AAAI Conference on Artificial Intelligence,
   pp. 1059 -1064. (2010)
    
5. Baumann, J., Calkin, N., and Lyle, J.
   “On the Domination of Kings.”
   Congressus Numerantium, 197,
   pp 161 - 176. (2009)
    
6. J. Lyle, N. Drake, and R. Laskar,
   “Fall Coloring of Strongly Chordal Graphs.”
   Congressus Numerantium, 172,
   pp 149 - 159. (2005)
    
7. J. Lyle, S. Daugherty, and R. Laskar,
   “The Total Influence Number of a Graph.”
   Congressus Numerantium, 174,
   pp 107 - 121. (2005)