Dr Justin Ward
Senior Lecturer in Optimisation
Email: justin.ward@qmul.ac.ukTelephone: 5065Room Number: Mathematical Sciences Building, Room: MB-126Website: http://www.maths.qmul.ac.uk/~jward/Office Hours: Wednesday 10:00 PM-12:00PM by appointment
Profile
Justin Ward is a Senior Lecturer in Optimisation at 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.
Research
Research Interests:
See Justin Ward’s research profile pages including details of research interests, publications, and live grants.
Publications
-
(2023). FPT-Algorithms for the l-Matchoid Problem with a Coverage Objective SIAM Journal on Discrete Mathematics nameOfConference.
-
(2022). Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression Proceedings of Machine Learning Research 35th Annual Conference on Learning Theory.
-
(2020). Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints journal Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020).
-
(2019). Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms SIAM Journal on Computing nameOfConference.
-
(2017). Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
-
(2017). Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature Mathematics of Operations Research nameOfConference.
-
(2016). A Bi-Criteria Approximation Algorithm for k-Means Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France nameOfConference.
-
(2016). A New Framework for Distributed Submodular Maximization IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA nameOfConference.
-
(2016). Maximizing k-Submodular Functions and Beyond ACM Trans. Algorithms nameOfConference.
-
(2016). Submodular Stochastic Probing on Matroids Math. Oper. Res. nameOfConference.