| Fast exact and heuristic methods for role minimization problems A Ene, W Horne, N Milosavljevic, P Rao, R Schreiber, RE Tarjan Proceedings of the 13th ACM symposium on Access control models and …, 2008 | 315 | 2008 |
| Fast clustering using MapReduce A Ene, S Im, B Moseley Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011 | 296 | 2011 |
| The power of randomization: Distributed submodular maximization on massive datasets R Barbosa, A Ene, H Nguyen, J Ward International Conference on Machine Learning, 1236-1244, 2015 | 109 | 2015 |
| Constrained submodular maximization: Beyond 1/e A Ene, HL Nguyen 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 95 | 2016 |
| A new framework for distributed submodular maximization RP Barbosa, A Ene, HL Nguyen, J Ward 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 88 | 2016 |
| Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time A Ene, HL Nguyễn Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 84 | 2019 |
| Approximation algorithms for submodular multiway partition C Chekuri, A Ene 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 807-816, 2011 | 80 | 2011 |
| Unsplittable flow in paths and trees and column-restricted packing integer programs C Chekuri, A Ene, N Korula Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 77 | 2009 |
| A nearly-linear time algorithm for submodular maximization with a knapsack constraint A Ene, HL Nguyen arXiv preprint arXiv:1709.09767, 2017 | 70 | 2017 |
| Prize-collecting Steiner problems on planar graphs MH Bateni, C Chekuri, A Ene, MT Hajiaghayi, N Korula, D Marx Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 58 | 2011 |
| Random coordinate descent methods for minimizing decomposable submodular functions A Ene, H Nguyen International Conference on Machine Learning, 787-795, 2015 | 57 | 2015 |
| Local distribution and the symmetry gap: Approximability of multiway partitioning problems A Ene, J Vondrák, Y Wu Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 56 | 2013 |
| Submodular maximization with matroid and packing constraints in parallel A Ene, HL Nguyễn, A Vladu Proceedings of the 51st annual ACM SIGACT symposium on theory of computing …, 2019 | 47 | 2019 |
| Submodular cost allocation problem and applications C Chekuri, A Ene Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011 | 47 | 2011 |
| High probability convergence of stochastic gradient methods Z Liu, TD Nguyen, TH Nguyen, A Ene, H Nguyen International Conference on Machine Learning, 21884-21914, 2023 | 43 | 2023 |
| Poly-logarithmic approximation for maximum node disjoint paths with constant congestion C Chekuri, A Ene Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 42 | 2013 |
| On approximating maximum independent set of rectangles J Chuzhoy, A Ene 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 38 | 2016 |
| An efficient framework for balancing submodularity and cost SM Nikolakaki, A Ene, E Terzi Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021 | 37 | 2021 |
| An optimal streaming algorithm for submodular maximization with a cardinality constraint N Alaluf, A Ene, M Feldman, HL Nguyen, A Suh Mathematics of Operations Research 47 (4), 2667-2690, 2022 | 35 | 2022 |
| Adaptive gradient methods for constrained convex optimization and variational inequalities A Ene, HL Nguyen, A Vladu Proceedings of the AAAI Conference on Artificial Intelligence 35 (8), 7314-7321, 2021 | 33 | 2021 |
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignVerified email at illinois.edu
