| Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition A Gozzard, M Ward, A Datta Information Sciences 422, 282-289, 2018 | 24 | 2018 |
| A modal aleatoric calculus for probabilistic reasoning T French, A Gozzard, M Reynolds Logic and Its Applications: 8th Indian Conference, ICLA 2019, Delhi, India …, 2019 | 8 | 2019 |
| A Faster Algorithm for Maximum Induced Matchings on Circle Graphs. M Ward, A Gozzard, MJ Wise, A Datta J. Graph Algorithms Appl. 22 (2), 389-396, 2018 | 4 | 2018 |
| Dynamic aleatoric reasoning in games of bluffing and chance T French, A Gozzard, M Reynolds Proceedings of the 18th International Conference on Autonomous Agents and …, 2019 | 3 | 2019 |
| A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints. M Ward, A Gozzard, A Datta J. Graph Algorithms Appl. 21 (4), 547-554, 2017 | 3 | 2017 |
| Aleatoric dynamic epistemic logic for learning agents T French, A Gozzard, M Reynolds PRICAI 2019: Trends in Artificial Intelligence: 16th Pacific Rim …, 2019 | 2 | 2019 |
| A modal aleatoric calculus for probabilistic reasoning: extended version T French, A Gozzard, M Reynolds arXiv preprint arXiv:1812.11741, 2018 | 1 | 2018 |
| Algorithms for Geometric Intersection Graphs A Gozzard | | 2023 |
| Algorithms for Average Path Length Minimisation Through Edge Addition A Gozzard | | |
