A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints. - Max Ward 001; Andrew Gozzard; Amitava Datta (J. Graph Algorithms Appl., 2017)

A modal aleatoric calculus for probabilistic reasoning: extended version. - Tim French 002; Andrew Gozzard; Mark Reynolds 001 (CoRR, 2018)

Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. - Andrew Gozzard; Max Ward 001; Amitava Datta (Inf. Sci., 2018)

A Faster Algorithm for Maximum Induced Matchings on Circle Graphs. - Max Ward 001; Andrew Gozzard; Michael J. Wise; Amitava Datta (J. Graph Algorithms Appl., 2018)

Dynamic Aleatoric Reasoning in Games of Bluffing and Chance. - Tim French 002; Andrew Gozzard; Mark Reynolds 001 (AAMAS, 2019)

A Modal Aleatoric Calculus for Probabilistic Reasoning. - Tim French 002; Andrew Gozzard; Mark Reynolds 001 (ICLA, 2019)

Aleatoric Dynamic Epistemic Logic for Learning Agents. - Tim French 002; Andrew Gozzard; Mark Reynolds 001 (PRICAI (1), 2019)