School of Mathematical Sciences

Dr Justin Ward


Lecturer in Optimisation/Operations Research

Telephone: 5065
Room Number: Mathematical Sciences Building, Room: MB-126
Office Hours: Thursday 2:00PM-4:00PM And by appointment


Justin Ward is a Lecturer in Optimisation and Operational Research in the School of Mathematics.  He specialises in the theory of computing and the design and analysis of algorithms for discrete optimisation problems.  His research focuses on obtaining approximation algorithms with provable guarantees for computationally hard optimisation problems.
Justin holds a PhD in computer science from the University of Toronto.  Before joining Queen Mary, he worked as a research fellow in the Department of Computer Science and the Centre for Discrete Mathematics and its Applications at the University of Warwick, and as a research scientist in the Theory of Computing Laboratory at EPFL.



  • Sviridenko M, Vondrák J, Ward J (2017). Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature Mathematics of Operations Research.
  • Ward J, Zivny S (2016). Maximizing k-Submodular Functions and Beyond ACM Trans. Algorithms.
  • Sviridenko M, Vondrák J, Ward J (2015). Optimal approximation for submodular and supermodular optimization with bounded curvature Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015.
  • Barbosa RDP, Ene A, Nguyen HL et al. (2015). The Power of Randomization: Distributed Submodular Maximization on Massive Datasets Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015.
  • Ward J, Zivny S (2014). Maximizing Bisubmodular and k-Submodular Functions Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014.
  • Filmus Y, Ward J (2014). Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search SIAM J. Comput..
  • Adamczyk M, Sviridenko M, Ward J (2014). Submodular Stochastic Probing on Matroids 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France.
  • Filmus Y, Ward J (2012). The Power of Local Search: Maximum Coverage over a Matroid 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France.
  • Feldman M, Naor J, Schwartz R et al. (2011). Improved Approximations for k-Exchange Systems - (Extended Abstract) Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings.
  • Ward J, Kimmell G, Alexander P (2005). Prufrock: a framework for constructing polytypic theorem provers 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), November 7-11, 2005, Long Beach, CA, USA.