Thiery T, Ward J ( 2022 ) . Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression . Proceedings of Machine Learning Research . Editors: Po-Ling, L, Raginsky, M , Conference: 35th Annual Conference on Learning Theory vol. 178 , 3605 - 3634 .
Huang C-C, Ward J ( 2020 ) . FPT-Algorithms for the \ell-Matchoid Problem with a Coverage Objective .
Huang C-C, Thiery T, Ward J ( 2020 ) . Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints . Editors: Byrka, J, Meka, R , Conference: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)62:1 - 62:19 .
Ahmadian S, Norouzi-Fard A, Svensson O, Ward J ( 2019 ) . Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms . SIAM Journal on Computing vol. 49 , ( 4 ) 97 - 156 .
Ahmadian S, Norouzi-Fard A, Svensson O, Ward J ( 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 . Editors: Umans, C , Conference: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)61 - 72 .
Sviridenko M, Vondrák J, Ward J ( 2017 ) . Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature . Mathematics of Operations Research
Makarychev K, Makarychev Y, Sviridenko M, Ward J ( 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 . Editors: Jansen, K, Mathieu, C, Rolim, JDP, Umans, C et al. , vol. 60 , 14:1 - 14:20 .
Barbosa RDP, Ene A, Nguyen HL, Ward J ( 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 . Editors: Dinur, I , 645 - 654 .
Ward J, Zivny S ( 2016 ) . Maximizing k-Submodular Functions and Beyond . ACM Trans. Algorithms vol. 12 , Article 4 , 47:1 - 47:26 .
Adamczyk M, Sviridenko M, Ward J ( 2016 ) . Submodular Stochastic Probing on Matroids . Math. Oper. Res. vol. 41 , Article 3 , 1022 - 1038 .
Barbosa RDP, Ene A, Nguyen HL, Ward J ( 2015 ) . The Power of Randomization: Distributed Submodular Maximization on Massive Datasets . Proceedings of the 32nd International Conference on Machine Learning . Editors: Bach, FR, Blei, DM , Conference: International Conference on Machine Learning Research ( Lille, France ) from: 07/07/2015 to: 09/07/2015 , vol. 37 , 1236 - 1244 .
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 . Editors: Indyk, P , 1134 - 1148 .
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 . Editors: Chekuri, C , 1468 - 1481 .
Filmus Y, Ward J ( 2014 ) . Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search . SIAM J. Comput. vol. 43 , Article 2 , 514 - 542 .
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 . Editors: Mayr, EW, Portier, N , vol. 25 , 29 - 40 .
Sviridenko M, Ward J ( 2013 ) . Large Neighborhood Local Search for the Maximum Set Packing Problem . Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I . Editors: Fomin, FV, Freivalds, R, Kwiatkowska, MZ, Peleg, D et al. , vol. 7965 , 792 - 803 .
Ward J ( 2012 ) . A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems . 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France . Editors: Dürr, C, Wilke, T , vol. 14 , 42 - 53 .
Filmus Y, Ward J ( 2012 ) . A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint . 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 . 659 - 668 .
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 . Editors: Dürr, C, Wilke, T , vol. 14 , 601 - 612 .
Feldman M, Naor J, Schwartz R, Ward J ( 2011 ) . Improved Approximations for k-Exchange Systems - (Extended Abstract) . Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings . Editors: Demetrescu, C, Halldórsson, MM , vol. 6942 , 784 - 798 .
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 . Editors: Redmiles, DF, Ellman, T, Zisman, A , 423 - 426 .