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
293 2008 Fast clustering using MapReduce A Ene, S Im, B Moseley
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
282 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
98 2015 Constrained submodular maximization: Beyond 1/e A Ene, HL Nguyen
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
81 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
79 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
77 2019 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
75 2009 Approximation algorithms for submodular multiway partition C Chekuri, A Ene
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 807-816, 2011
73 2011 Prize-collecting Steiner problems on planar graphs M Bateni, C Chekuri, A Ene, MT Hajiaghayi, N Korula, D Marx
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
56 2011 A nearly-linear time algorithm for submodular maximization with a knapsack constraint A Ene, HL Nguyen
arXiv preprint arXiv:1709.09767, 2017
55 2017 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
52 2013 Random coordinate descent methods for minimizing decomposable submodular functions A Ene, H Nguyen
International Conference on Machine Learning, 787-795, 2015
50 2015 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
43 2013 Submodular cost allocation problem and applications C Chekuri, A Ene
Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011
43 2011 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
41 2019 On approximating maximum independent set of rectangles J Chuzhoy, A Ene
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
33 2016 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
30 2022 A reduction for optimizing lattice submodular functions with diminishing returns A Ene, HL Nguyen
arXiv preprint arXiv:1606.08362, 2016
29 2016 Improved Convergence for A Ene, A Vladu
International Conference on Machine Learning, 1794-1801, 2019
27 2019 Decomposable submodular function minimization: discrete and continuous A Ene, H Nguyen, LA Végh
Advances in neural information processing systems 30, 2017
27 2017 
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignVerified email at illinois.edu
